./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:48,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:48,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:48,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:48,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:48,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:48,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:48,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:48,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:48,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:48,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:48,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:48,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:48,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:48,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:48,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:48,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:48,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:48,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:48,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:48,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:48,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:48,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:48,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:48,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:48,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:48,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:48,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:48,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:48,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:48,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:48,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:48,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:48,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:48,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:48,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:48,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:48,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:48,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:48,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:48,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:48,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:48,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:48,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:48,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:48,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:48,944 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:48,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:48,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:48,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:48,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:48,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:48,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:48,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:48,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:48,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:48,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:48,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:48,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:48,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:48,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:48,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:48,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:48,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:48,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:48,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:48,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:48,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:48,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:48,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:48,953 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:48,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-28 15:38:49,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:49,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:49,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:49,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:49,266 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:49,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 15:38:49,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c81879f/24caf680c48d401db4a2d804442ca8c8/FLAGa207529a7 [2019-11-28 15:38:49,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:49,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 15:38:49,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c81879f/24caf680c48d401db4a2d804442ca8c8/FLAGa207529a7 [2019-11-28 15:38:50,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c81879f/24caf680c48d401db4a2d804442ca8c8 [2019-11-28 15:38:50,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:50,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:50,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:50,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:50,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:50,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee01756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50, skipping insertion in model container [2019-11-28 15:38:50,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:50,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:50,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:50,593 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:50,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:50,675 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:50,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50 WrapperNode [2019-11-28 15:38:50,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:50,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:50,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:50,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:50,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:50,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:50,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:50,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:50,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... [2019-11-28 15:38:50,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:50,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:50,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:50,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:50,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:50,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:50,987 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:51,590 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:38:51,591 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:38:51,592 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:51,593 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:51,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:51 BoogieIcfgContainer [2019-11-28 15:38:51,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:51,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:51,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:51,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:51,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:50" (1/3) ... [2019-11-28 15:38:51,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616216ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:51, skipping insertion in model container [2019-11-28 15:38:51,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:50" (2/3) ... [2019-11-28 15:38:51,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616216ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:51, skipping insertion in model container [2019-11-28 15:38:51,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:51" (3/3) ... [2019-11-28 15:38:51,605 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-28 15:38:51,616 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:51,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:51,638 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:51,669 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:51,669 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:51,670 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:51,671 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:51,671 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:51,671 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:51,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:51,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-28 15:38:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:38:51,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:51,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:51,719 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-28 15:38:51,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:51,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976052978] [2019-11-28 15:38:51,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:51,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976052978] [2019-11-28 15:38:51,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:51,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:51,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317563155] [2019-11-28 15:38:51,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:51,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:52,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,007 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-28 15:38:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:52,401 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-28 15:38:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:52,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:38:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:52,420 INFO L225 Difference]: With dead ends: 322 [2019-11-28 15:38:52,420 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 15:38:52,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 15:38:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-28 15:38:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-28 15:38:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-28 15:38:52,519 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-28 15:38:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:52,520 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-28 15:38:52,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-28 15:38:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:38:52,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:52,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-28 15:38:52,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068651623] [2019-11-28 15:38:52,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:52,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068651623] [2019-11-28 15:38:52,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:52,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:52,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8680957] [2019-11-28 15:38:52,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:52,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,680 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-28 15:38:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:52,902 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-28 15:38:52,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:52,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:38:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:52,906 INFO L225 Difference]: With dead ends: 371 [2019-11-28 15:38:52,906 INFO L226 Difference]: Without dead ends: 211 [2019-11-28 15:38:52,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-28 15:38:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-28 15:38:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 15:38:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-28 15:38:52,923 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-28 15:38:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:52,924 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-28 15:38:52,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-28 15:38:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 15:38:52,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,927 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:52,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-28 15:38:52,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255860297] [2019-11-28 15:38:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255860297] [2019-11-28 15:38:53,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157540918] [2019-11-28 15:38:53,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,007 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-28 15:38:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,215 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-28 15:38:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-28 15:38:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,219 INFO L225 Difference]: With dead ends: 436 [2019-11-28 15:38:53,220 INFO L226 Difference]: Without dead ends: 237 [2019-11-28 15:38:53,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-28 15:38:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-28 15:38:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-28 15:38:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-28 15:38:53,257 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-28 15:38:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-28 15:38:53,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-28 15:38:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:38:53,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,265 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:53,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-28 15:38:53,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159001003] [2019-11-28 15:38:53,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:53,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159001003] [2019-11-28 15:38:53,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897779946] [2019-11-28 15:38:53,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,333 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-28 15:38:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,478 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-28 15:38:53,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:38:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,482 INFO L225 Difference]: With dead ends: 484 [2019-11-28 15:38:53,482 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 15:38:53,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 15:38:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-28 15:38:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 15:38:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-28 15:38:53,500 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-28 15:38:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,500 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-28 15:38:53,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-28 15:38:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:38:53,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,503 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:53,503 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-28 15:38:53,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661914442] [2019-11-28 15:38:53,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:53,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661914442] [2019-11-28 15:38:53,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539826469] [2019-11-28 15:38:53,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,606 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-28 15:38:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,830 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-28 15:38:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:38:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,833 INFO L225 Difference]: With dead ends: 543 [2019-11-28 15:38:53,833 INFO L226 Difference]: Without dead ends: 298 [2019-11-28 15:38:53,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-28 15:38:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-28 15:38:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-28 15:38:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-28 15:38:53,846 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-28 15:38:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,847 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-28 15:38:53,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-28 15:38:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:38:53,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,849 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:53,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-28 15:38:53,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-28 15:38:53,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:53,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-28 15:38:53,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844642601] [2019-11-28 15:38:53,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,914 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-28 15:38:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,045 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-28 15:38:54,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:38:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,048 INFO L225 Difference]: With dead ends: 583 [2019-11-28 15:38:54,048 INFO L226 Difference]: Without dead ends: 296 [2019-11-28 15:38:54,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-28 15:38:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-28 15:38:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-28 15:38:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-28 15:38:54,060 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-28 15:38:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,060 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-28 15:38:54,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-28 15:38:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:38:54,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,062 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-28 15:38:54,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646343177] [2019-11-28 15:38:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:54,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646343177] [2019-11-28 15:38:54,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386295660] [2019-11-28 15:38:54,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,118 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-28 15:38:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,291 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-28 15:38:54,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:38:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,294 INFO L225 Difference]: With dead ends: 585 [2019-11-28 15:38:54,294 INFO L226 Difference]: Without dead ends: 296 [2019-11-28 15:38:54,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-28 15:38:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-28 15:38:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-28 15:38:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-28 15:38:54,306 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-28 15:38:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,308 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-28 15:38:54,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-28 15:38:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 15:38:54,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,309 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,310 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-28 15:38:54,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103437567] [2019-11-28 15:38:54,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:38:54,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103437567] [2019-11-28 15:38:54,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169799249] [2019-11-28 15:38:54,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,382 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-28 15:38:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,494 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-28 15:38:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 15:38:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,497 INFO L225 Difference]: With dead ends: 585 [2019-11-28 15:38:54,498 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 15:38:54,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 15:38:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-28 15:38:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 15:38:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-28 15:38:54,511 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-28 15:38:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,511 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-28 15:38:54,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-28 15:38:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 15:38:54,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,513 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-28 15:38:54,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564624886] [2019-11-28 15:38:54,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:54,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564624886] [2019-11-28 15:38:54,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522394381] [2019-11-28 15:38:54,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,579 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-28 15:38:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,746 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-28 15:38:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-28 15:38:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,749 INFO L225 Difference]: With dead ends: 624 [2019-11-28 15:38:54,749 INFO L226 Difference]: Without dead ends: 331 [2019-11-28 15:38:54,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-28 15:38:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-28 15:38:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-28 15:38:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-28 15:38:54,761 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-28 15:38:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,762 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-28 15:38:54,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-28 15:38:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:38:54,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,763 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-28 15:38:54,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708327708] [2019-11-28 15:38:54,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:54,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708327708] [2019-11-28 15:38:54,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687245141] [2019-11-28 15:38:54,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,803 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-28 15:38:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,950 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-28 15:38:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 15:38:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,953 INFO L225 Difference]: With dead ends: 685 [2019-11-28 15:38:54,954 INFO L226 Difference]: Without dead ends: 363 [2019-11-28 15:38:54,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-28 15:38:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-28 15:38:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-28 15:38:54,968 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-28 15:38:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,969 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-28 15:38:54,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-28 15:38:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:38:54,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,971 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,971 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-28 15:38:54,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585352617] [2019-11-28 15:38:54,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:55,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585352617] [2019-11-28 15:38:55,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:55,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846029245] [2019-11-28 15:38:55,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,005 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-28 15:38:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,142 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-28 15:38:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 15:38:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,145 INFO L225 Difference]: With dead ends: 707 [2019-11-28 15:38:55,146 INFO L226 Difference]: Without dead ends: 358 [2019-11-28 15:38:55,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-28 15:38:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-28 15:38:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-28 15:38:55,176 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-28 15:38:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,176 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-28 15:38:55,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-28 15:38:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:38:55,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,179 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:55,179 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-28 15:38:55,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370229808] [2019-11-28 15:38:55,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:55,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370229808] [2019-11-28 15:38:55,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:55,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177323883] [2019-11-28 15:38:55,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,215 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-28 15:38:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,373 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-28 15:38:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:38:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,375 INFO L225 Difference]: With dead ends: 712 [2019-11-28 15:38:55,375 INFO L226 Difference]: Without dead ends: 363 [2019-11-28 15:38:55,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-28 15:38:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-28 15:38:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-28 15:38:55,391 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-28 15:38:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,391 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-28 15:38:55,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-28 15:38:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:38:55,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,393 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:55,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-28 15:38:55,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876479330] [2019-11-28 15:38:55,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:55,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876479330] [2019-11-28 15:38:55,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:55,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377667803] [2019-11-28 15:38:55,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,432 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-28 15:38:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,565 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-28 15:38:55,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:38:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,568 INFO L225 Difference]: With dead ends: 730 [2019-11-28 15:38:55,568 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 15:38:55,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 15:38:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 15:38:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 15:38:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-28 15:38:55,595 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-28 15:38:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,596 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-28 15:38:55,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-28 15:38:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:38:55,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,598 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:55,598 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-28 15:38:55,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313690362] [2019-11-28 15:38:55,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:55,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313690362] [2019-11-28 15:38:55,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:55,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964285746] [2019-11-28 15:38:55,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,631 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-28 15:38:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,751 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-28 15:38:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-28 15:38:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,754 INFO L225 Difference]: With dead ends: 751 [2019-11-28 15:38:55,754 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 15:38:55,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 15:38:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 15:38:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 15:38:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-28 15:38:55,775 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-28 15:38:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,776 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-28 15:38:55,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-28 15:38:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 15:38:55,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,780 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:55,780 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-28 15:38:55,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337379242] [2019-11-28 15:38:55,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:38:55,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337379242] [2019-11-28 15:38:55,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:55,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96170957] [2019-11-28 15:38:55,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,850 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-28 15:38:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,909 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-28 15:38:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 15:38:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,915 INFO L225 Difference]: With dead ends: 747 [2019-11-28 15:38:55,916 INFO L226 Difference]: Without dead ends: 745 [2019-11-28 15:38:55,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-28 15:38:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-28 15:38:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-28 15:38:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-28 15:38:55,953 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-28 15:38:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,954 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-28 15:38:55,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-28 15:38:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:38:55,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,959 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:55,959 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-28 15:38:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315613330] [2019-11-28 15:38:55,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,972 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:55,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62882042] [2019-11-28 15:38:55,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:56,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:56,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315613330] [2019-11-28 15:38:56,147 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:56,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62882042] [2019-11-28 15:38:56,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:56,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:56,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325718989] [2019-11-28 15:38:56,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:56,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,151 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-28 15:38:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,230 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-28 15:38:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:56,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:38:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,239 INFO L225 Difference]: With dead ends: 1851 [2019-11-28 15:38:56,239 INFO L226 Difference]: Without dead ends: 1113 [2019-11-28 15:38:56,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-28 15:38:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-28 15:38:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-28 15:38:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-28 15:38:56,305 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-28 15:38:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,305 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-28 15:38:56,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-28 15:38:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-28 15:38:56,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,311 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:56,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:56,524 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-28 15:38:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003407698] [2019-11-28 15:38:56,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:56,539 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:56,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768677049] [2019-11-28 15:38:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:56,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:56,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:56,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003407698] [2019-11-28 15:38:56,665 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:56,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768677049] [2019-11-28 15:38:56,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:56,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:56,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001898736] [2019-11-28 15:38:56,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:56,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:56,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,669 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-28 15:38:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,760 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-28 15:38:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:56,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-28 15:38:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,771 INFO L225 Difference]: With dead ends: 2219 [2019-11-28 15:38:56,772 INFO L226 Difference]: Without dead ends: 1481 [2019-11-28 15:38:56,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-28 15:38:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-28 15:38:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-28 15:38:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-28 15:38:56,849 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-28 15:38:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,850 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-28 15:38:56,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-28 15:38:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:38:56,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,857 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:57,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,070 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-28 15:38:57,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:57,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834586216] [2019-11-28 15:38:57,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-28 15:38:57,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834586216] [2019-11-28 15:38:57,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:57,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:57,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718656672] [2019-11-28 15:38:57,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:57,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,169 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-28 15:38:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:57,366 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-28 15:38:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:57,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-28 15:38:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:57,374 INFO L225 Difference]: With dead ends: 3059 [2019-11-28 15:38:57,374 INFO L226 Difference]: Without dead ends: 1585 [2019-11-28 15:38:57,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-28 15:38:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-28 15:38:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-28 15:38:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-28 15:38:57,430 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-28 15:38:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:57,431 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-28 15:38:57,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-28 15:38:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:38:57,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:57,436 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:57,436 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-28 15:38:57,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:57,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59810851] [2019-11-28 15:38:57,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:57,445 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:57,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923122263] [2019-11-28 15:38:57,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:57,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:57,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:38:57,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59810851] [2019-11-28 15:38:57,577 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:57,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923122263] [2019-11-28 15:38:57,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:57,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:57,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122892049] [2019-11-28 15:38:57,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:57,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,580 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-28 15:38:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:57,674 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-28 15:38:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:57,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-28 15:38:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:57,685 INFO L225 Difference]: With dead ends: 3139 [2019-11-28 15:38:57,685 INFO L226 Difference]: Without dead ends: 1964 [2019-11-28 15:38:57,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-28 15:38:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-28 15:38:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-28 15:38:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-28 15:38:57,793 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-28 15:38:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:57,793 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-28 15:38:57,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-28 15:38:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-28 15:38:57,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:57,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:58,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:58,004 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-28 15:38:58,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:58,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873667121] [2019-11-28 15:38:58,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:58,021 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:58,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501139401] [2019-11-28 15:38:58,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:58,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:38:58,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 15:38:58,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873667121] [2019-11-28 15:38:58,168 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:58,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501139401] [2019-11-28 15:38:58,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:58,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:58,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60522121] [2019-11-28 15:38:58,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:58,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:58,176 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-28 15:38:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:58,299 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-28 15:38:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:58,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-28 15:38:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:58,318 INFO L225 Difference]: With dead ends: 5743 [2019-11-28 15:38:58,318 INFO L226 Difference]: Without dead ends: 3786 [2019-11-28 15:38:58,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-28 15:38:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-28 15:38:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-28 15:38:58,461 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-28 15:38:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:58,461 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-28 15:38:58,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-28 15:38:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-28 15:38:58,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:58,472 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:58,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:58,680 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-28 15:38:58,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:58,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184684197] [2019-11-28 15:38:58,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:58,694 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:58,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887638782] [2019-11-28 15:38:58,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:58,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:58,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-28 15:38:58,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184684197] [2019-11-28 15:38:58,831 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:58,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887638782] [2019-11-28 15:38:58,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:58,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:58,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317491248] [2019-11-28 15:38:58,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:58,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:58,834 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-28 15:38:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:59,114 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-28 15:38:59,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:59,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-28 15:38:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:59,133 INFO L225 Difference]: With dead ends: 7651 [2019-11-28 15:38:59,133 INFO L226 Difference]: Without dead ends: 3874 [2019-11-28 15:38:59,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-28 15:38:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-28 15:38:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-28 15:38:59,285 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-28 15:38:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:59,286 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-28 15:38:59,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-28 15:38:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-28 15:38:59,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:59,298 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:59,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:59,503 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-28 15:38:59,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:59,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809385910] [2019-11-28 15:38:59,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-28 15:38:59,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809385910] [2019-11-28 15:38:59,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:59,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:59,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497093575] [2019-11-28 15:38:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:59,600 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-28 15:38:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:59,943 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-28 15:38:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:59,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-28 15:38:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:59,966 INFO L225 Difference]: With dead ends: 7683 [2019-11-28 15:38:59,966 INFO L226 Difference]: Without dead ends: 3906 [2019-11-28 15:38:59,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-28 15:39:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-28 15:39:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:39:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-28 15:39:00,149 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-28 15:39:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:00,149 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-28 15:39:00,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-28 15:39:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-28 15:39:00,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:00,160 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:00,160 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-28 15:39:00,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:00,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516114635] [2019-11-28 15:39:00,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:00,177 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:39:00,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112938131] [2019-11-28 15:39:00,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:00,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:00,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-28 15:39:00,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516114635] [2019-11-28 15:39:00,322 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:39:00,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112938131] [2019-11-28 15:39:00,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:00,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:00,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625026483] [2019-11-28 15:39:00,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:00,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:00,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:00,324 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-28 15:39:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:00,534 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-28 15:39:00,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:00,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-28 15:39:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:00,567 INFO L225 Difference]: With dead ends: 7561 [2019-11-28 15:39:00,567 INFO L226 Difference]: Without dead ends: 3784 [2019-11-28 15:39:00,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-28 15:39:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-28 15:39:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:39:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-28 15:39:00,746 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-28 15:39:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:00,747 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-28 15:39:00,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-28 15:39:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-28 15:39:00,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:00,767 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:00,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:00,972 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-28 15:39:00,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:00,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797668566] [2019-11-28 15:39:00,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:00,991 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:39:00,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291488431] [2019-11-28 15:39:00,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:01,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:39:01,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-28 15:39:01,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797668566] [2019-11-28 15:39:01,304 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:39:01,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291488431] [2019-11-28 15:39:01,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:01,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:01,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420056286] [2019-11-28 15:39:01,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:01,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:01,308 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-28 15:39:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:01,754 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-28 15:39:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:01,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-28 15:39:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:01,764 INFO L225 Difference]: With dead ends: 7951 [2019-11-28 15:39:01,764 INFO L226 Difference]: Without dead ends: 2307 [2019-11-28 15:39:01,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-28 15:39:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-28 15:39:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-28 15:39:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-28 15:39:01,899 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-28 15:39:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:01,900 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-28 15:39:01,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-28 15:39:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-28 15:39:01,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:01,915 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:02,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:02,122 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-28 15:39:02,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:02,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478472531] [2019-11-28 15:39:02,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-28 15:39:02,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478472531] [2019-11-28 15:39:02,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:02,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:02,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88823457] [2019-11-28 15:39:02,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:02,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:02,302 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-28 15:39:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:02,572 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-28 15:39:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:02,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-28 15:39:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:02,581 INFO L225 Difference]: With dead ends: 4829 [2019-11-28 15:39:02,582 INFO L226 Difference]: Without dead ends: 2529 [2019-11-28 15:39:02,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-28 15:39:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-28 15:39:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-28 15:39:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-28 15:39:02,699 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-28 15:39:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:02,700 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-28 15:39:02,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-28 15:39:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-28 15:39:02,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:02,717 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:02,718 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-28 15:39:02,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:02,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914214396] [2019-11-28 15:39:02,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-28 15:39:02,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914214396] [2019-11-28 15:39:02,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:02,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:02,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129492884] [2019-11-28 15:39:02,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:02,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:02,932 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-28 15:39:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:03,134 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-28 15:39:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:03,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-28 15:39:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:03,140 INFO L225 Difference]: With dead ends: 4949 [2019-11-28 15:39:03,140 INFO L226 Difference]: Without dead ends: 2499 [2019-11-28 15:39:03,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-28 15:39:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-28 15:39:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-28 15:39:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-28 15:39:03,248 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-28 15:39:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,249 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-28 15:39:03,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-28 15:39:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-28 15:39:03,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,258 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:03,258 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-28 15:39:03,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:03,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047719333] [2019-11-28 15:39:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-28 15:39:03,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047719333] [2019-11-28 15:39:03,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648497013] [2019-11-28 15:39:03,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:03,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-28 15:39:03,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:39:03,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:39:03,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482552751] [2019-11-28 15:39:03,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:03,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:03,637 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-28 15:39:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:04,031 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-11-28 15:39:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:04,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-28 15:39:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:04,042 INFO L225 Difference]: With dead ends: 7213 [2019-11-28 15:39:04,042 INFO L226 Difference]: Without dead ends: 4617 [2019-11-28 15:39:04,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-11-28 15:39:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-11-28 15:39:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-28 15:39:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-28 15:39:04,138 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-28 15:39:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:04,139 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-28 15:39:04,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-28 15:39:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-28 15:39:04,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:04,153 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:04,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:04,360 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-28 15:39:04,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:04,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898495869] [2019-11-28 15:39:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-28 15:39:04,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898495869] [2019-11-28 15:39:04,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:04,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:04,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803351571] [2019-11-28 15:39:04,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:04,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:04,648 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-28 15:39:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:04,828 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-28 15:39:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:04,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-28 15:39:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:04,834 INFO L225 Difference]: With dead ends: 5073 [2019-11-28 15:39:04,835 INFO L226 Difference]: Without dead ends: 2546 [2019-11-28 15:39:04,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-28 15:39:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-28 15:39:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-28 15:39:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-28 15:39:04,910 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-28 15:39:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:04,910 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-28 15:39:04,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-28 15:39:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-28 15:39:04,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:04,924 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:04,925 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-28 15:39:04,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:04,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485341302] [2019-11-28 15:39:04,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-28 15:39:05,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485341302] [2019-11-28 15:39:05,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:05,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843854854] [2019-11-28 15:39:05,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:05,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:05,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:05,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,265 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-28 15:39:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:05,545 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-28 15:39:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:05,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-28 15:39:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:05,555 INFO L225 Difference]: With dead ends: 5277 [2019-11-28 15:39:05,556 INFO L226 Difference]: Without dead ends: 2750 [2019-11-28 15:39:05,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-28 15:39:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-28 15:39:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-28 15:39:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-28 15:39:05,679 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-28 15:39:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:05,680 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-28 15:39:05,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-28 15:39:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-28 15:39:05,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,709 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:05,710 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-28 15:39:05,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:05,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028714168] [2019-11-28 15:39:05,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-28 15:39:06,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028714168] [2019-11-28 15:39:06,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:06,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:06,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830214156] [2019-11-28 15:39:06,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:06,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:06,257 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-28 15:39:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,550 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-28 15:39:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:06,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-28 15:39:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,561 INFO L225 Difference]: With dead ends: 5697 [2019-11-28 15:39:06,561 INFO L226 Difference]: Without dead ends: 2966 [2019-11-28 15:39:06,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-28 15:39:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-28 15:39:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-28 15:39:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-28 15:39:06,692 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-28 15:39:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,693 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-28 15:39:06,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-28 15:39:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-28 15:39:06,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,721 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:06,721 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-28 15:39:06,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:06,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871103254] [2019-11-28 15:39:06,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:39:07,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871103254] [2019-11-28 15:39:07,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983083548] [2019-11-28 15:39:07,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:07,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:39:07,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:39:07,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:39:07,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441458038] [2019-11-28 15:39:07,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:07,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:07,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:07,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:07,787 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-28 15:39:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:08,001 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-28 15:39:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:08,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-28 15:39:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:08,003 INFO L225 Difference]: With dead ends: 4704 [2019-11-28 15:39:08,003 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:39:08,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:39:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:39:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:39:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:39:08,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-28 15:39:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:08,009 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:39:08,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:39:08,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:39:08,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:08,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:39:08,520 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-28 15:39:08,990 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-28 15:39:09,255 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 15:39:09,397 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-28 15:39:09,644 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:09,877 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-28 15:39:10,056 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:10,227 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-28 15:39:10,402 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-28 15:39:10,598 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-28 15:39:10,815 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-28 15:39:10,977 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:11,213 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:11,385 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 15:39:11,620 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:11,791 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-28 15:39:12,029 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-28 15:39:12,195 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:12,499 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-28 15:39:12,658 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-28 15:39:12,820 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-28 15:39:12,823 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-28 15:39:12,824 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-28 15:39:12,824 INFO L246 CegarLoopResult]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-28 15:39:12,824 INFO L246 CegarLoopResult]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-28 15:39:12,824 INFO L246 CegarLoopResult]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-28 15:39:12,825 INFO L246 CegarLoopResult]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-28 15:39:12,825 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-28 15:39:12,825 INFO L242 CegarLoopResult]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-28 15:39:12,826 INFO L242 CegarLoopResult]: At program point L103(lines 102 625) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-28 15:39:12,826 INFO L246 CegarLoopResult]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-28 15:39:12,827 INFO L246 CegarLoopResult]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,827 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-28 15:39:12,827 INFO L246 CegarLoopResult]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-28 15:39:12,827 INFO L246 CegarLoopResult]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-28 15:39:12,828 INFO L246 CegarLoopResult]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-28 15:39:12,828 INFO L246 CegarLoopResult]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-28 15:39:12,828 INFO L242 CegarLoopResult]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:39:12,828 INFO L242 CegarLoopResult]: At program point L172(lines 168 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,829 INFO L242 CegarLoopResult]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-11-28 15:39:12,829 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-28 15:39:12,829 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-28 15:39:12,829 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-28 15:39:12,829 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-28 15:39:12,830 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-28 15:39:12,831 INFO L242 CegarLoopResult]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:39:12,831 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-28 15:39:12,831 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-28 15:39:12,831 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:12,832 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-28 15:39:12,832 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,832 INFO L249 CegarLoopResult]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-28 15:39:12,832 INFO L246 CegarLoopResult]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-28 15:39:12,832 INFO L246 CegarLoopResult]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-28 15:39:12,833 INFO L246 CegarLoopResult]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-28 15:39:12,833 INFO L246 CegarLoopResult]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-28 15:39:12,833 INFO L246 CegarLoopResult]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-28 15:39:12,833 INFO L249 CegarLoopResult]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-28 15:39:12,833 INFO L246 CegarLoopResult]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-28 15:39:12,833 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-28 15:39:12,834 INFO L242 CegarLoopResult]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,834 INFO L242 CegarLoopResult]: At program point L145(lines 141 612) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:12,834 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L242 CegarLoopResult]: At program point L212(lines 105 624) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-28 15:39:12,835 INFO L246 CegarLoopResult]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-28 15:39:12,836 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-28 15:39:12,837 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-28 15:39:12,837 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-28 15:39:12,837 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-28 15:39:12,837 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-28 15:39:12,838 INFO L242 CegarLoopResult]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,838 INFO L242 CegarLoopResult]: At program point L151(lines 147 610) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:12,838 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:39:12,838 INFO L246 CegarLoopResult]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-28 15:39:12,838 INFO L246 CegarLoopResult]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-28 15:39:12,839 INFO L246 CegarLoopResult]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-28 15:39:12,839 INFO L246 CegarLoopResult]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-28 15:39:12,839 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-28 15:39:12,839 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-28 15:39:12,839 INFO L242 CegarLoopResult]: At program point L121(lines 117 620) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-11-28 15:39:12,840 INFO L242 CegarLoopResult]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-11-28 15:39:12,840 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-28 15:39:12,840 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-28 15:39:12,840 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-28 15:39:12,840 INFO L246 CegarLoopResult]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-28 15:39:12,841 INFO L246 CegarLoopResult]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-28 15:39:12,841 INFO L246 CegarLoopResult]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-28 15:39:12,841 INFO L249 CegarLoopResult]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-28 15:39:12,841 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-28 15:39:12,841 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-28 15:39:12,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:39:12,842 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,842 INFO L242 CegarLoopResult]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-28 15:39:12,842 INFO L242 CegarLoopResult]: At program point L157(lines 153 608) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:12,843 INFO L242 CegarLoopResult]: At program point L124(lines 123 618) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 15:39:12,843 INFO L246 CegarLoopResult]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-28 15:39:12,843 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-28 15:39:12,843 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-28 15:39:12,843 INFO L242 CegarLoopResult]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-28 15:39:12,844 INFO L246 CegarLoopResult]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-28 15:39:12,845 INFO L246 CegarLoopResult]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-28 15:39:12,845 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-28 15:39:12,845 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-28 15:39:12,845 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:39:12,845 INFO L249 CegarLoopResult]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-28 15:39:12,846 INFO L246 CegarLoopResult]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-28 15:39:12,846 INFO L246 CegarLoopResult]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-28 15:39:12,846 INFO L246 CegarLoopResult]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-28 15:39:12,846 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-28 15:39:12,846 INFO L242 CegarLoopResult]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,847 INFO L242 CegarLoopResult]: At program point L163(lines 159 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,847 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,847 INFO L246 CegarLoopResult]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-28 15:39:12,847 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-28 15:39:12,848 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-28 15:39:12,849 INFO L246 CegarLoopResult]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-28 15:39:12,849 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-28 15:39:12,849 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:12,849 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-28 15:39:12,849 INFO L246 CegarLoopResult]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-28 15:39:12,850 INFO L246 CegarLoopResult]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-28 15:39:12,850 INFO L246 CegarLoopResult]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-28 15:39:12,850 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,850 INFO L246 CegarLoopResult]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-28 15:39:12,850 INFO L246 CegarLoopResult]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-28 15:39:12,851 INFO L246 CegarLoopResult]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-28 15:39:12,851 INFO L246 CegarLoopResult]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-28 15:39:12,851 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:12,851 INFO L242 CegarLoopResult]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:12,852 INFO L242 CegarLoopResult]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:12,852 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 15:39:12,852 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-28 15:39:12,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:39:12 BoogieIcfgContainer [2019-11-28 15:39:12,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:39:12,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:39:12,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:39:12,891 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:39:12,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:51" (3/4) ... [2019-11-28 15:39:12,896 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:39:12,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:39:12,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:39:13,022 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:39:13,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:39:13,026 INFO L168 Benchmark]: Toolchain (without parser) took 22858.59 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 942.7 MB). Free memory was 957.7 MB in the beginning and 1.6 GB in the end (delta: -647.3 MB). Peak memory consumption was 295.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,026 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:13,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,027 INFO L168 Benchmark]: Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:13,028 INFO L168 Benchmark]: RCFGBuilder took 786.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,028 INFO L168 Benchmark]: TraceAbstraction took 21294.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 795.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -554.3 MB). Peak memory consumption was 847.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,029 INFO L168 Benchmark]: Witness Printer took 134.17 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:13,031 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 786.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21294.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 795.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -554.3 MB). Peak memory consumption was 847.5 MB. Max. memory is 11.5 GB. * Witness Printer took 134.17 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 16.5s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...