/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:07:00,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:07:00,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:07:00,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:07:00,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:07:00,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:07:00,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:07:00,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:07:00,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:07:00,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:07:00,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:07:00,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:07:00,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:07:00,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:07:00,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:07:00,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:07:00,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:07:00,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:07:00,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:07:00,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:07:00,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:07:00,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:07:00,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:07:00,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:07:00,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:07:00,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:07:00,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:07:00,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:07:00,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:07:00,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:07:00,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:07:00,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:07:00,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:07:00,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:07:00,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:07:00,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:07:00,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:07:00,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:07:00,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:07:00,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:07:00,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:07:00,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:07:00,615 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:07:00,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:07:00,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:07:00,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:07:00,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:07:00,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:07:00,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:07:00,619 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:07:00,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:07:00,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:07:00,619 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:07:00,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:07:00,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:07:00,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:07:00,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:07:00,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:07:00,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:07:00,621 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 05:07:00,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:07:00,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:07:00,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:07:00,912 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:07:00,913 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:07:00,913 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-18 05:07:00,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869536761/b4cf51757ed34273917b1d0f77999560/FLAG6d2556b37 [2020-07-18 05:07:01,477 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:07:01,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-18 05:07:01,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869536761/b4cf51757ed34273917b1d0f77999560/FLAG6d2556b37 [2020-07-18 05:07:01,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869536761/b4cf51757ed34273917b1d0f77999560 [2020-07-18 05:07:01,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:07:01,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:07:01,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:01,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:07:01,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:07:01,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:01" (1/1) ... [2020-07-18 05:07:01,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51541991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:01, skipping insertion in model container [2020-07-18 05:07:01,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:01" (1/1) ... [2020-07-18 05:07:01,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:07:01,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:07:02,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:02,075 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:07:02,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:02,113 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:07:02,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02 WrapperNode [2020-07-18 05:07:02,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:02,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:07:02,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:07:02,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:07:02,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (1/1) ... [2020-07-18 05:07:02,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:07:02,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:07:02,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:07:02,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:07:02,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (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 [2020-07-18 05:07:02,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:07:02,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:07:02,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:07:02,797 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:07:02,797 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 05:07:02,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:02 BoogieIcfgContainer [2020-07-18 05:07:02,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:07:02,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:07:02,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:07:02,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:07:02,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:07:01" (1/3) ... [2020-07-18 05:07:02,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766f139f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:02, skipping insertion in model container [2020-07-18 05:07:02,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:02" (2/3) ... [2020-07-18 05:07:02,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766f139f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:02, skipping insertion in model container [2020-07-18 05:07:02,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:02" (3/3) ... [2020-07-18 05:07:02,810 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-18 05:07:02,818 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:07:02,826 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:07:02,840 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:07:02,862 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:07:02,863 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:07:02,863 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:07:02,863 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:07:02,863 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:07:02,864 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:07:02,864 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:07:02,864 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:07:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-18 05:07:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 05:07:02,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:02,893 INFO L422 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, 1, 1, 1, 1, 1] [2020-07-18 05:07:02,893 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-18 05:07:02,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:02,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652792538] [2020-07-18 05:07:02,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:03,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-18 05:07:03,121 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-18 05:07:03,123 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {81#true} is VALID [2020-07-18 05:07:03,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-18 05:07:03,124 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-18 05:07:03,124 INFO L263 TraceCheckUtils]: 3: Hoare triple {81#true} call #t~ret7 := main(); {81#true} is VALID [2020-07-18 05:07:03,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#true} ~p1~0 := #t~nondet0; {81#true} is VALID [2020-07-18 05:07:03,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#true} havoc #t~nondet0; {81#true} is VALID [2020-07-18 05:07:03,126 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} havoc ~lk1~0; {81#true} is VALID [2020-07-18 05:07:03,126 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,127 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} ~p2~0 := #t~nondet1; {81#true} is VALID [2020-07-18 05:07:03,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {81#true} havoc #t~nondet1; {81#true} is VALID [2020-07-18 05:07:03,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} havoc ~lk2~0; {81#true} is VALID [2020-07-18 05:07:03,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} ~p3~0 := #t~nondet2; {81#true} is VALID [2020-07-18 05:07:03,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {81#true} havoc #t~nondet2; {81#true} is VALID [2020-07-18 05:07:03,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} havoc ~lk3~0; {81#true} is VALID [2020-07-18 05:07:03,130 INFO L280 TraceCheckUtils]: 16: Hoare triple {81#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,130 INFO L280 TraceCheckUtils]: 17: Hoare triple {81#true} ~p4~0 := #t~nondet3; {81#true} is VALID [2020-07-18 05:07:03,130 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} havoc #t~nondet3; {81#true} is VALID [2020-07-18 05:07:03,131 INFO L280 TraceCheckUtils]: 19: Hoare triple {81#true} havoc ~lk4~0; {81#true} is VALID [2020-07-18 05:07:03,131 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,132 INFO L280 TraceCheckUtils]: 21: Hoare triple {81#true} ~p5~0 := #t~nondet4; {81#true} is VALID [2020-07-18 05:07:03,132 INFO L280 TraceCheckUtils]: 22: Hoare triple {81#true} havoc #t~nondet4; {81#true} is VALID [2020-07-18 05:07:03,133 INFO L280 TraceCheckUtils]: 23: Hoare triple {81#true} havoc ~lk5~0; {81#true} is VALID [2020-07-18 05:07:03,133 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,133 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#true} ~p6~0 := #t~nondet5; {81#true} is VALID [2020-07-18 05:07:03,134 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#true} havoc #t~nondet5; {81#true} is VALID [2020-07-18 05:07:03,134 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#true} havoc ~lk6~0; {81#true} is VALID [2020-07-18 05:07:03,134 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#true} havoc ~cond~0; {81#true} is VALID [2020-07-18 05:07:03,135 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#true} assume !false; {81#true} is VALID [2020-07-18 05:07:03,135 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {81#true} is VALID [2020-07-18 05:07:03,136 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#true} ~cond~0 := #t~nondet6; {81#true} is VALID [2020-07-18 05:07:03,136 INFO L280 TraceCheckUtils]: 32: Hoare triple {81#true} havoc #t~nondet6; {81#true} is VALID [2020-07-18 05:07:03,136 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#true} assume !(0 == ~cond~0); {81#true} is VALID [2020-07-18 05:07:03,137 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#true} ~lk1~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,137 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#true} ~lk2~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,138 INFO L280 TraceCheckUtils]: 36: Hoare triple {81#true} ~lk3~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,138 INFO L280 TraceCheckUtils]: 37: Hoare triple {81#true} ~lk4~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,138 INFO L280 TraceCheckUtils]: 38: Hoare triple {81#true} ~lk5~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,139 INFO L280 TraceCheckUtils]: 39: Hoare triple {81#true} ~lk6~0 := 0; {81#true} is VALID [2020-07-18 05:07:03,142 INFO L280 TraceCheckUtils]: 40: Hoare triple {81#true} assume !(0 != ~p1~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,143 INFO L280 TraceCheckUtils]: 41: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,144 INFO L280 TraceCheckUtils]: 42: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,144 INFO L280 TraceCheckUtils]: 43: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,145 INFO L280 TraceCheckUtils]: 44: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,146 INFO L280 TraceCheckUtils]: 45: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:03,147 INFO L280 TraceCheckUtils]: 46: Hoare triple {85#(= 0 main_~p1~0)} assume 0 != ~p1~0; {82#false} is VALID [2020-07-18 05:07:03,147 INFO L280 TraceCheckUtils]: 47: Hoare triple {82#false} assume 1 != ~lk1~0; {82#false} is VALID [2020-07-18 05:07:03,147 INFO L280 TraceCheckUtils]: 48: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-18 05:07:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:03,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652792538] [2020-07-18 05:07:03,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:03,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:03,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930382016] [2020-07-18 05:07:03,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-18 05:07:03,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:03,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:03,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:03,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:03,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:03,279 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-18 05:07:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:03,683 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-18 05:07:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:03,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-18 05:07:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-18 05:07:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-18 05:07:03,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2020-07-18 05:07:04,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:04,021 INFO L225 Difference]: With dead ends: 169 [2020-07-18 05:07:04,022 INFO L226 Difference]: Without dead ends: 112 [2020-07-18 05:07:04,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-18 05:07:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-18 05:07:04,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:04,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-18 05:07:04,147 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-18 05:07:04,148 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-18 05:07:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:04,158 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-18 05:07:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-18 05:07:04,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:04,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:04,161 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-18 05:07:04,161 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-18 05:07:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:04,171 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-18 05:07:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-18 05:07:04,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:04,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:04,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:04,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 05:07:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-18 05:07:04,182 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-18 05:07:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:04,182 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-18 05:07:04,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:04,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2020-07-18 05:07:04,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-18 05:07:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 05:07:04,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:04,354 INFO L422 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, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:04,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:07:04,355 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-18 05:07:04,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:04,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384072899] [2020-07-18 05:07:04,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:04,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-18 05:07:04,437 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-18 05:07:04,438 INFO L263 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2020-07-18 05:07:04,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-18 05:07:04,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-18 05:07:04,439 INFO L263 TraceCheckUtils]: 3: Hoare triple {870#true} call #t~ret7 := main(); {870#true} is VALID [2020-07-18 05:07:04,439 INFO L280 TraceCheckUtils]: 4: Hoare triple {870#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {870#true} ~p1~0 := #t~nondet0; {870#true} is VALID [2020-07-18 05:07:04,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {870#true} havoc #t~nondet0; {870#true} is VALID [2020-07-18 05:07:04,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {870#true} havoc ~lk1~0; {870#true} is VALID [2020-07-18 05:07:04,440 INFO L280 TraceCheckUtils]: 8: Hoare triple {870#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {870#true} ~p2~0 := #t~nondet1; {870#true} is VALID [2020-07-18 05:07:04,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#true} havoc #t~nondet1; {870#true} is VALID [2020-07-18 05:07:04,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {870#true} havoc ~lk2~0; {870#true} is VALID [2020-07-18 05:07:04,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {870#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#true} ~p3~0 := #t~nondet2; {870#true} is VALID [2020-07-18 05:07:04,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#true} havoc #t~nondet2; {870#true} is VALID [2020-07-18 05:07:04,443 INFO L280 TraceCheckUtils]: 15: Hoare triple {870#true} havoc ~lk3~0; {870#true} is VALID [2020-07-18 05:07:04,443 INFO L280 TraceCheckUtils]: 16: Hoare triple {870#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {870#true} ~p4~0 := #t~nondet3; {870#true} is VALID [2020-07-18 05:07:04,444 INFO L280 TraceCheckUtils]: 18: Hoare triple {870#true} havoc #t~nondet3; {870#true} is VALID [2020-07-18 05:07:04,444 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#true} havoc ~lk4~0; {870#true} is VALID [2020-07-18 05:07:04,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {870#true} ~p5~0 := #t~nondet4; {870#true} is VALID [2020-07-18 05:07:04,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {870#true} havoc #t~nondet4; {870#true} is VALID [2020-07-18 05:07:04,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {870#true} havoc ~lk5~0; {870#true} is VALID [2020-07-18 05:07:04,446 INFO L280 TraceCheckUtils]: 24: Hoare triple {870#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,446 INFO L280 TraceCheckUtils]: 25: Hoare triple {870#true} ~p6~0 := #t~nondet5; {870#true} is VALID [2020-07-18 05:07:04,447 INFO L280 TraceCheckUtils]: 26: Hoare triple {870#true} havoc #t~nondet5; {870#true} is VALID [2020-07-18 05:07:04,447 INFO L280 TraceCheckUtils]: 27: Hoare triple {870#true} havoc ~lk6~0; {870#true} is VALID [2020-07-18 05:07:04,447 INFO L280 TraceCheckUtils]: 28: Hoare triple {870#true} havoc ~cond~0; {870#true} is VALID [2020-07-18 05:07:04,448 INFO L280 TraceCheckUtils]: 29: Hoare triple {870#true} assume !false; {870#true} is VALID [2020-07-18 05:07:04,448 INFO L280 TraceCheckUtils]: 30: Hoare triple {870#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {870#true} is VALID [2020-07-18 05:07:04,448 INFO L280 TraceCheckUtils]: 31: Hoare triple {870#true} ~cond~0 := #t~nondet6; {870#true} is VALID [2020-07-18 05:07:04,449 INFO L280 TraceCheckUtils]: 32: Hoare triple {870#true} havoc #t~nondet6; {870#true} is VALID [2020-07-18 05:07:04,449 INFO L280 TraceCheckUtils]: 33: Hoare triple {870#true} assume !(0 == ~cond~0); {870#true} is VALID [2020-07-18 05:07:04,449 INFO L280 TraceCheckUtils]: 34: Hoare triple {870#true} ~lk1~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,450 INFO L280 TraceCheckUtils]: 35: Hoare triple {870#true} ~lk2~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,450 INFO L280 TraceCheckUtils]: 36: Hoare triple {870#true} ~lk3~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,450 INFO L280 TraceCheckUtils]: 37: Hoare triple {870#true} ~lk4~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,451 INFO L280 TraceCheckUtils]: 38: Hoare triple {870#true} ~lk5~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,451 INFO L280 TraceCheckUtils]: 39: Hoare triple {870#true} ~lk6~0 := 0; {870#true} is VALID [2020-07-18 05:07:04,451 INFO L280 TraceCheckUtils]: 40: Hoare triple {870#true} assume 0 != ~p1~0; {870#true} is VALID [2020-07-18 05:07:04,452 INFO L280 TraceCheckUtils]: 41: Hoare triple {870#true} ~lk1~0 := 1; {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,453 INFO L280 TraceCheckUtils]: 42: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,454 INFO L280 TraceCheckUtils]: 43: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,455 INFO L280 TraceCheckUtils]: 44: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,456 INFO L280 TraceCheckUtils]: 45: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,458 INFO L280 TraceCheckUtils]: 46: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,459 INFO L280 TraceCheckUtils]: 47: Hoare triple {874#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:04,460 INFO L280 TraceCheckUtils]: 48: Hoare triple {874#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {871#false} is VALID [2020-07-18 05:07:04,460 INFO L280 TraceCheckUtils]: 49: Hoare triple {871#false} assume !false; {871#false} is VALID [2020-07-18 05:07:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:04,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384072899] [2020-07-18 05:07:04,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:04,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:04,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497823394] [2020-07-18 05:07:04,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 05:07:04,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:04,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:04,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:04,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:04,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:04,531 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-18 05:07:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:04,805 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-18 05:07:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:04,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 05:07:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-18 05:07:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-18 05:07:04,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-18 05:07:04,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:04,951 INFO L225 Difference]: With dead ends: 135 [2020-07-18 05:07:04,952 INFO L226 Difference]: Without dead ends: 133 [2020-07-18 05:07:04,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-18 05:07:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-18 05:07:05,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:05,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 110 states. [2020-07-18 05:07:05,064 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 110 states. [2020-07-18 05:07:05,065 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 110 states. [2020-07-18 05:07:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:05,071 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-18 05:07:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-18 05:07:05,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:05,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:05,073 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 133 states. [2020-07-18 05:07:05,073 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 133 states. [2020-07-18 05:07:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:05,081 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-18 05:07:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-18 05:07:05,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:05,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:05,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:05,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 05:07:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-18 05:07:05,088 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-18 05:07:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:05,088 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-18 05:07:05,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:05,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 141 transitions. [2020-07-18 05:07:05,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-18 05:07:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 05:07:05,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:05,228 INFO L422 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, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:05,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:07:05,228 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-18 05:07:05,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:05,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289366225] [2020-07-18 05:07:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:05,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-18 05:07:05,329 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-18 05:07:05,329 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-18 05:07:05,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-18 05:07:05,329 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-18 05:07:05,330 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret7 := main(); {1633#true} is VALID [2020-07-18 05:07:05,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {1633#true} ~p1~0 := #t~nondet0; {1633#true} is VALID [2020-07-18 05:07:05,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} havoc #t~nondet0; {1633#true} is VALID [2020-07-18 05:07:05,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {1633#true} havoc ~lk1~0; {1633#true} is VALID [2020-07-18 05:07:05,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {1633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,332 INFO L280 TraceCheckUtils]: 9: Hoare triple {1633#true} ~p2~0 := #t~nondet1; {1633#true} is VALID [2020-07-18 05:07:05,333 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#true} havoc #t~nondet1; {1633#true} is VALID [2020-07-18 05:07:05,333 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#true} havoc ~lk2~0; {1633#true} is VALID [2020-07-18 05:07:05,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#true} ~p3~0 := #t~nondet2; {1633#true} is VALID [2020-07-18 05:07:05,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {1633#true} havoc #t~nondet2; {1633#true} is VALID [2020-07-18 05:07:05,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {1633#true} havoc ~lk3~0; {1633#true} is VALID [2020-07-18 05:07:05,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {1633#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,340 INFO L280 TraceCheckUtils]: 17: Hoare triple {1633#true} ~p4~0 := #t~nondet3; {1633#true} is VALID [2020-07-18 05:07:05,341 INFO L280 TraceCheckUtils]: 18: Hoare triple {1633#true} havoc #t~nondet3; {1633#true} is VALID [2020-07-18 05:07:05,341 INFO L280 TraceCheckUtils]: 19: Hoare triple {1633#true} havoc ~lk4~0; {1633#true} is VALID [2020-07-18 05:07:05,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {1633#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,342 INFO L280 TraceCheckUtils]: 21: Hoare triple {1633#true} ~p5~0 := #t~nondet4; {1633#true} is VALID [2020-07-18 05:07:05,342 INFO L280 TraceCheckUtils]: 22: Hoare triple {1633#true} havoc #t~nondet4; {1633#true} is VALID [2020-07-18 05:07:05,342 INFO L280 TraceCheckUtils]: 23: Hoare triple {1633#true} havoc ~lk5~0; {1633#true} is VALID [2020-07-18 05:07:05,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {1633#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,343 INFO L280 TraceCheckUtils]: 25: Hoare triple {1633#true} ~p6~0 := #t~nondet5; {1633#true} is VALID [2020-07-18 05:07:05,343 INFO L280 TraceCheckUtils]: 26: Hoare triple {1633#true} havoc #t~nondet5; {1633#true} is VALID [2020-07-18 05:07:05,346 INFO L280 TraceCheckUtils]: 27: Hoare triple {1633#true} havoc ~lk6~0; {1633#true} is VALID [2020-07-18 05:07:05,347 INFO L280 TraceCheckUtils]: 28: Hoare triple {1633#true} havoc ~cond~0; {1633#true} is VALID [2020-07-18 05:07:05,347 INFO L280 TraceCheckUtils]: 29: Hoare triple {1633#true} assume !false; {1633#true} is VALID [2020-07-18 05:07:05,347 INFO L280 TraceCheckUtils]: 30: Hoare triple {1633#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1633#true} is VALID [2020-07-18 05:07:05,347 INFO L280 TraceCheckUtils]: 31: Hoare triple {1633#true} ~cond~0 := #t~nondet6; {1633#true} is VALID [2020-07-18 05:07:05,348 INFO L280 TraceCheckUtils]: 32: Hoare triple {1633#true} havoc #t~nondet6; {1633#true} is VALID [2020-07-18 05:07:05,348 INFO L280 TraceCheckUtils]: 33: Hoare triple {1633#true} assume !(0 == ~cond~0); {1633#true} is VALID [2020-07-18 05:07:05,348 INFO L280 TraceCheckUtils]: 34: Hoare triple {1633#true} ~lk1~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,348 INFO L280 TraceCheckUtils]: 35: Hoare triple {1633#true} ~lk2~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,360 INFO L280 TraceCheckUtils]: 36: Hoare triple {1633#true} ~lk3~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {1633#true} ~lk4~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,361 INFO L280 TraceCheckUtils]: 38: Hoare triple {1633#true} ~lk5~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,361 INFO L280 TraceCheckUtils]: 39: Hoare triple {1633#true} ~lk6~0 := 0; {1633#true} is VALID [2020-07-18 05:07:05,362 INFO L280 TraceCheckUtils]: 40: Hoare triple {1633#true} assume !(0 != ~p1~0); {1633#true} is VALID [2020-07-18 05:07:05,362 INFO L280 TraceCheckUtils]: 41: Hoare triple {1633#true} assume !(0 != ~p2~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,363 INFO L280 TraceCheckUtils]: 42: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,364 INFO L280 TraceCheckUtils]: 43: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,364 INFO L280 TraceCheckUtils]: 44: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,365 INFO L280 TraceCheckUtils]: 45: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,366 INFO L280 TraceCheckUtils]: 46: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:05,366 INFO L280 TraceCheckUtils]: 47: Hoare triple {1637#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1634#false} is VALID [2020-07-18 05:07:05,367 INFO L280 TraceCheckUtils]: 48: Hoare triple {1634#false} assume 1 != ~lk2~0; {1634#false} is VALID [2020-07-18 05:07:05,367 INFO L280 TraceCheckUtils]: 49: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-18 05:07:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:05,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289366225] [2020-07-18 05:07:05,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:05,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:05,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712379140] [2020-07-18 05:07:05,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 05:07:05,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:05,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:05,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:05,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:05,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:05,415 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-18 05:07:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:05,789 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-18 05:07:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:05,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 05:07:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 05:07:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 05:07:05,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-18 05:07:06,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:06,018 INFO L225 Difference]: With dead ends: 266 [2020-07-18 05:07:06,019 INFO L226 Difference]: Without dead ends: 185 [2020-07-18 05:07:06,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-18 05:07:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-18 05:07:06,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:06,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2020-07-18 05:07:06,232 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2020-07-18 05:07:06,232 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2020-07-18 05:07:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:06,241 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-18 05:07:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-18 05:07:06,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:06,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:06,242 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2020-07-18 05:07:06,242 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2020-07-18 05:07:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:06,249 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-18 05:07:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-18 05:07:06,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:06,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:06,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:06,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-18 05:07:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-18 05:07:06,257 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-18 05:07:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:06,258 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-18 05:07:06,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:06,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 240 transitions. [2020-07-18 05:07:06,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-18 05:07:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 05:07:06,516 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:06,516 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:06,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:07:06,516 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-18 05:07:06,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:06,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942462312] [2020-07-18 05:07:06,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:06,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-18 05:07:06,560 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-18 05:07:06,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2020-07-18 05:07:06,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-18 05:07:06,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-18 05:07:06,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {2908#true} call #t~ret7 := main(); {2908#true} is VALID [2020-07-18 05:07:06,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {2908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} ~p1~0 := #t~nondet0; {2908#true} is VALID [2020-07-18 05:07:06,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {2908#true} havoc #t~nondet0; {2908#true} is VALID [2020-07-18 05:07:06,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {2908#true} havoc ~lk1~0; {2908#true} is VALID [2020-07-18 05:07:06,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {2908#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {2908#true} ~p2~0 := #t~nondet1; {2908#true} is VALID [2020-07-18 05:07:06,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {2908#true} havoc #t~nondet1; {2908#true} is VALID [2020-07-18 05:07:06,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {2908#true} havoc ~lk2~0; {2908#true} is VALID [2020-07-18 05:07:06,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {2908#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,564 INFO L280 TraceCheckUtils]: 13: Hoare triple {2908#true} ~p3~0 := #t~nondet2; {2908#true} is VALID [2020-07-18 05:07:06,564 INFO L280 TraceCheckUtils]: 14: Hoare triple {2908#true} havoc #t~nondet2; {2908#true} is VALID [2020-07-18 05:07:06,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {2908#true} havoc ~lk3~0; {2908#true} is VALID [2020-07-18 05:07:06,565 INFO L280 TraceCheckUtils]: 16: Hoare triple {2908#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,565 INFO L280 TraceCheckUtils]: 17: Hoare triple {2908#true} ~p4~0 := #t~nondet3; {2908#true} is VALID [2020-07-18 05:07:06,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {2908#true} havoc #t~nondet3; {2908#true} is VALID [2020-07-18 05:07:06,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {2908#true} havoc ~lk4~0; {2908#true} is VALID [2020-07-18 05:07:06,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {2908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {2908#true} ~p5~0 := #t~nondet4; {2908#true} is VALID [2020-07-18 05:07:06,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {2908#true} havoc #t~nondet4; {2908#true} is VALID [2020-07-18 05:07:06,566 INFO L280 TraceCheckUtils]: 23: Hoare triple {2908#true} havoc ~lk5~0; {2908#true} is VALID [2020-07-18 05:07:06,566 INFO L280 TraceCheckUtils]: 24: Hoare triple {2908#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,567 INFO L280 TraceCheckUtils]: 25: Hoare triple {2908#true} ~p6~0 := #t~nondet5; {2908#true} is VALID [2020-07-18 05:07:06,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {2908#true} havoc #t~nondet5; {2908#true} is VALID [2020-07-18 05:07:06,567 INFO L280 TraceCheckUtils]: 27: Hoare triple {2908#true} havoc ~lk6~0; {2908#true} is VALID [2020-07-18 05:07:06,567 INFO L280 TraceCheckUtils]: 28: Hoare triple {2908#true} havoc ~cond~0; {2908#true} is VALID [2020-07-18 05:07:06,568 INFO L280 TraceCheckUtils]: 29: Hoare triple {2908#true} assume !false; {2908#true} is VALID [2020-07-18 05:07:06,568 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2908#true} is VALID [2020-07-18 05:07:06,568 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#true} ~cond~0 := #t~nondet6; {2908#true} is VALID [2020-07-18 05:07:06,568 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#true} havoc #t~nondet6; {2908#true} is VALID [2020-07-18 05:07:06,569 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#true} assume !(0 == ~cond~0); {2908#true} is VALID [2020-07-18 05:07:06,569 INFO L280 TraceCheckUtils]: 34: Hoare triple {2908#true} ~lk1~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,569 INFO L280 TraceCheckUtils]: 35: Hoare triple {2908#true} ~lk2~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,569 INFO L280 TraceCheckUtils]: 36: Hoare triple {2908#true} ~lk3~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,570 INFO L280 TraceCheckUtils]: 37: Hoare triple {2908#true} ~lk4~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,570 INFO L280 TraceCheckUtils]: 38: Hoare triple {2908#true} ~lk5~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,570 INFO L280 TraceCheckUtils]: 39: Hoare triple {2908#true} ~lk6~0 := 0; {2908#true} is VALID [2020-07-18 05:07:06,570 INFO L280 TraceCheckUtils]: 40: Hoare triple {2908#true} assume !(0 != ~p1~0); {2908#true} is VALID [2020-07-18 05:07:06,571 INFO L280 TraceCheckUtils]: 41: Hoare triple {2908#true} assume !(0 != ~p2~0); {2908#true} is VALID [2020-07-18 05:07:06,575 INFO L280 TraceCheckUtils]: 42: Hoare triple {2908#true} assume !(0 != ~p3~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,576 INFO L280 TraceCheckUtils]: 43: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,576 INFO L280 TraceCheckUtils]: 44: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,579 INFO L280 TraceCheckUtils]: 45: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,579 INFO L280 TraceCheckUtils]: 46: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,580 INFO L280 TraceCheckUtils]: 47: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:06,583 INFO L280 TraceCheckUtils]: 48: Hoare triple {2912#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2909#false} is VALID [2020-07-18 05:07:06,583 INFO L280 TraceCheckUtils]: 49: Hoare triple {2909#false} assume 1 != ~lk3~0; {2909#false} is VALID [2020-07-18 05:07:06,583 INFO L280 TraceCheckUtils]: 50: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-18 05:07:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:06,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942462312] [2020-07-18 05:07:06,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:06,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:06,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728038881] [2020-07-18 05:07:06,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 05:07:06,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:06,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:06,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:06,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:06,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:06,639 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-18 05:07:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:07,260 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-18 05:07:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:07,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 05:07:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 05:07:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 05:07:07,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-18 05:07:07,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:07,475 INFO L225 Difference]: With dead ends: 479 [2020-07-18 05:07:07,475 INFO L226 Difference]: Without dead ends: 325 [2020-07-18 05:07:07,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-18 05:07:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-18 05:07:07,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:07,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 323 states. [2020-07-18 05:07:07,860 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 323 states. [2020-07-18 05:07:07,860 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 323 states. [2020-07-18 05:07:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:07,874 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-18 05:07:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-18 05:07:07,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:07,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:07,875 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 325 states. [2020-07-18 05:07:07,875 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 325 states. [2020-07-18 05:07:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:07,888 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-18 05:07:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-18 05:07:07,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:07,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:07,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:07,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 05:07:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-18 05:07:07,902 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-18 05:07:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:07,903 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-18 05:07:07,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:07,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 426 transitions. [2020-07-18 05:07:08,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-18 05:07:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 05:07:08,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:08,361 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:08,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:07:08,361 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-18 05:07:08,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:08,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981440763] [2020-07-18 05:07:08,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:08,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-18 05:07:08,405 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-18 05:07:08,405 INFO L263 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2020-07-18 05:07:08,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-18 05:07:08,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-18 05:07:08,406 INFO L263 TraceCheckUtils]: 3: Hoare triple {5169#true} call #t~ret7 := main(); {5169#true} is VALID [2020-07-18 05:07:08,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {5169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {5169#true} ~p1~0 := #t~nondet0; {5169#true} is VALID [2020-07-18 05:07:08,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {5169#true} havoc #t~nondet0; {5169#true} is VALID [2020-07-18 05:07:08,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {5169#true} havoc ~lk1~0; {5169#true} is VALID [2020-07-18 05:07:08,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {5169#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {5169#true} ~p2~0 := #t~nondet1; {5169#true} is VALID [2020-07-18 05:07:08,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {5169#true} havoc #t~nondet1; {5169#true} is VALID [2020-07-18 05:07:08,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {5169#true} havoc ~lk2~0; {5169#true} is VALID [2020-07-18 05:07:08,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {5169#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {5169#true} ~p3~0 := #t~nondet2; {5169#true} is VALID [2020-07-18 05:07:08,408 INFO L280 TraceCheckUtils]: 14: Hoare triple {5169#true} havoc #t~nondet2; {5169#true} is VALID [2020-07-18 05:07:08,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {5169#true} havoc ~lk3~0; {5169#true} is VALID [2020-07-18 05:07:08,409 INFO L280 TraceCheckUtils]: 16: Hoare triple {5169#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {5169#true} ~p4~0 := #t~nondet3; {5169#true} is VALID [2020-07-18 05:07:08,409 INFO L280 TraceCheckUtils]: 18: Hoare triple {5169#true} havoc #t~nondet3; {5169#true} is VALID [2020-07-18 05:07:08,409 INFO L280 TraceCheckUtils]: 19: Hoare triple {5169#true} havoc ~lk4~0; {5169#true} is VALID [2020-07-18 05:07:08,410 INFO L280 TraceCheckUtils]: 20: Hoare triple {5169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,410 INFO L280 TraceCheckUtils]: 21: Hoare triple {5169#true} ~p5~0 := #t~nondet4; {5169#true} is VALID [2020-07-18 05:07:08,410 INFO L280 TraceCheckUtils]: 22: Hoare triple {5169#true} havoc #t~nondet4; {5169#true} is VALID [2020-07-18 05:07:08,410 INFO L280 TraceCheckUtils]: 23: Hoare triple {5169#true} havoc ~lk5~0; {5169#true} is VALID [2020-07-18 05:07:08,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {5169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,411 INFO L280 TraceCheckUtils]: 25: Hoare triple {5169#true} ~p6~0 := #t~nondet5; {5169#true} is VALID [2020-07-18 05:07:08,411 INFO L280 TraceCheckUtils]: 26: Hoare triple {5169#true} havoc #t~nondet5; {5169#true} is VALID [2020-07-18 05:07:08,411 INFO L280 TraceCheckUtils]: 27: Hoare triple {5169#true} havoc ~lk6~0; {5169#true} is VALID [2020-07-18 05:07:08,411 INFO L280 TraceCheckUtils]: 28: Hoare triple {5169#true} havoc ~cond~0; {5169#true} is VALID [2020-07-18 05:07:08,412 INFO L280 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !false; {5169#true} is VALID [2020-07-18 05:07:08,412 INFO L280 TraceCheckUtils]: 30: Hoare triple {5169#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5169#true} is VALID [2020-07-18 05:07:08,412 INFO L280 TraceCheckUtils]: 31: Hoare triple {5169#true} ~cond~0 := #t~nondet6; {5169#true} is VALID [2020-07-18 05:07:08,412 INFO L280 TraceCheckUtils]: 32: Hoare triple {5169#true} havoc #t~nondet6; {5169#true} is VALID [2020-07-18 05:07:08,413 INFO L280 TraceCheckUtils]: 33: Hoare triple {5169#true} assume !(0 == ~cond~0); {5169#true} is VALID [2020-07-18 05:07:08,413 INFO L280 TraceCheckUtils]: 34: Hoare triple {5169#true} ~lk1~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,413 INFO L280 TraceCheckUtils]: 35: Hoare triple {5169#true} ~lk2~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,413 INFO L280 TraceCheckUtils]: 36: Hoare triple {5169#true} ~lk3~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,414 INFO L280 TraceCheckUtils]: 37: Hoare triple {5169#true} ~lk4~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,414 INFO L280 TraceCheckUtils]: 38: Hoare triple {5169#true} ~lk5~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,414 INFO L280 TraceCheckUtils]: 39: Hoare triple {5169#true} ~lk6~0 := 0; {5169#true} is VALID [2020-07-18 05:07:08,414 INFO L280 TraceCheckUtils]: 40: Hoare triple {5169#true} assume !(0 != ~p1~0); {5169#true} is VALID [2020-07-18 05:07:08,414 INFO L280 TraceCheckUtils]: 41: Hoare triple {5169#true} assume 0 != ~p2~0; {5169#true} is VALID [2020-07-18 05:07:08,423 INFO L280 TraceCheckUtils]: 42: Hoare triple {5169#true} ~lk2~0 := 1; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,429 INFO L280 TraceCheckUtils]: 43: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,432 INFO L280 TraceCheckUtils]: 44: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,441 INFO L280 TraceCheckUtils]: 45: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,446 INFO L280 TraceCheckUtils]: 46: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,446 INFO L280 TraceCheckUtils]: 47: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,447 INFO L280 TraceCheckUtils]: 48: Hoare triple {5173#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:08,447 INFO L280 TraceCheckUtils]: 49: Hoare triple {5173#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {5170#false} is VALID [2020-07-18 05:07:08,447 INFO L280 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2020-07-18 05:07:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:08,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981440763] [2020-07-18 05:07:08,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:08,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:08,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411782153] [2020-07-18 05:07:08,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 05:07:08,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:08,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:08,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:08,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:08,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:08,495 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-18 05:07:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:09,143 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-18 05:07:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:09,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 05:07:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-18 05:07:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-18 05:07:09,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-18 05:07:09,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:09,296 INFO L225 Difference]: With dead ends: 399 [2020-07-18 05:07:09,296 INFO L226 Difference]: Without dead ends: 397 [2020-07-18 05:07:09,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-18 05:07:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-18 05:07:09,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:09,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 323 states. [2020-07-18 05:07:09,716 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 323 states. [2020-07-18 05:07:09,716 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 323 states. [2020-07-18 05:07:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:09,734 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-18 05:07:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-18 05:07:09,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:09,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:09,736 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 397 states. [2020-07-18 05:07:09,736 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 397 states. [2020-07-18 05:07:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:09,753 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-18 05:07:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-18 05:07:09,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:09,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:09,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:09,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 05:07:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-18 05:07:09,768 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-18 05:07:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:09,768 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-18 05:07:09,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:09,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 422 transitions. [2020-07-18 05:07:10,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-18 05:07:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 05:07:10,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:10,252 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:10,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:07:10,253 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-18 05:07:10,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:10,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [742841192] [2020-07-18 05:07:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:10,296 INFO L280 TraceCheckUtils]: 0: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-18 05:07:10,296 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-18 05:07:10,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {7414#true} call ULTIMATE.init(); {7414#true} is VALID [2020-07-18 05:07:10,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-18 05:07:10,297 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-18 05:07:10,297 INFO L263 TraceCheckUtils]: 3: Hoare triple {7414#true} call #t~ret7 := main(); {7414#true} is VALID [2020-07-18 05:07:10,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {7414#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,297 INFO L280 TraceCheckUtils]: 5: Hoare triple {7414#true} ~p1~0 := #t~nondet0; {7414#true} is VALID [2020-07-18 05:07:10,298 INFO L280 TraceCheckUtils]: 6: Hoare triple {7414#true} havoc #t~nondet0; {7414#true} is VALID [2020-07-18 05:07:10,298 INFO L280 TraceCheckUtils]: 7: Hoare triple {7414#true} havoc ~lk1~0; {7414#true} is VALID [2020-07-18 05:07:10,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {7414#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {7414#true} ~p2~0 := #t~nondet1; {7414#true} is VALID [2020-07-18 05:07:10,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {7414#true} havoc #t~nondet1; {7414#true} is VALID [2020-07-18 05:07:10,299 INFO L280 TraceCheckUtils]: 11: Hoare triple {7414#true} havoc ~lk2~0; {7414#true} is VALID [2020-07-18 05:07:10,299 INFO L280 TraceCheckUtils]: 12: Hoare triple {7414#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {7414#true} ~p3~0 := #t~nondet2; {7414#true} is VALID [2020-07-18 05:07:10,299 INFO L280 TraceCheckUtils]: 14: Hoare triple {7414#true} havoc #t~nondet2; {7414#true} is VALID [2020-07-18 05:07:10,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {7414#true} havoc ~lk3~0; {7414#true} is VALID [2020-07-18 05:07:10,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {7414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,300 INFO L280 TraceCheckUtils]: 17: Hoare triple {7414#true} ~p4~0 := #t~nondet3; {7414#true} is VALID [2020-07-18 05:07:10,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {7414#true} havoc #t~nondet3; {7414#true} is VALID [2020-07-18 05:07:10,300 INFO L280 TraceCheckUtils]: 19: Hoare triple {7414#true} havoc ~lk4~0; {7414#true} is VALID [2020-07-18 05:07:10,301 INFO L280 TraceCheckUtils]: 20: Hoare triple {7414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {7414#true} ~p5~0 := #t~nondet4; {7414#true} is VALID [2020-07-18 05:07:10,301 INFO L280 TraceCheckUtils]: 22: Hoare triple {7414#true} havoc #t~nondet4; {7414#true} is VALID [2020-07-18 05:07:10,301 INFO L280 TraceCheckUtils]: 23: Hoare triple {7414#true} havoc ~lk5~0; {7414#true} is VALID [2020-07-18 05:07:10,302 INFO L280 TraceCheckUtils]: 24: Hoare triple {7414#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,302 INFO L280 TraceCheckUtils]: 25: Hoare triple {7414#true} ~p6~0 := #t~nondet5; {7414#true} is VALID [2020-07-18 05:07:10,302 INFO L280 TraceCheckUtils]: 26: Hoare triple {7414#true} havoc #t~nondet5; {7414#true} is VALID [2020-07-18 05:07:10,302 INFO L280 TraceCheckUtils]: 27: Hoare triple {7414#true} havoc ~lk6~0; {7414#true} is VALID [2020-07-18 05:07:10,302 INFO L280 TraceCheckUtils]: 28: Hoare triple {7414#true} havoc ~cond~0; {7414#true} is VALID [2020-07-18 05:07:10,303 INFO L280 TraceCheckUtils]: 29: Hoare triple {7414#true} assume !false; {7414#true} is VALID [2020-07-18 05:07:10,303 INFO L280 TraceCheckUtils]: 30: Hoare triple {7414#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7414#true} is VALID [2020-07-18 05:07:10,303 INFO L280 TraceCheckUtils]: 31: Hoare triple {7414#true} ~cond~0 := #t~nondet6; {7414#true} is VALID [2020-07-18 05:07:10,303 INFO L280 TraceCheckUtils]: 32: Hoare triple {7414#true} havoc #t~nondet6; {7414#true} is VALID [2020-07-18 05:07:10,303 INFO L280 TraceCheckUtils]: 33: Hoare triple {7414#true} assume !(0 == ~cond~0); {7414#true} is VALID [2020-07-18 05:07:10,304 INFO L280 TraceCheckUtils]: 34: Hoare triple {7414#true} ~lk1~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,304 INFO L280 TraceCheckUtils]: 35: Hoare triple {7414#true} ~lk2~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,304 INFO L280 TraceCheckUtils]: 36: Hoare triple {7414#true} ~lk3~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,304 INFO L280 TraceCheckUtils]: 37: Hoare triple {7414#true} ~lk4~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,304 INFO L280 TraceCheckUtils]: 38: Hoare triple {7414#true} ~lk5~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,305 INFO L280 TraceCheckUtils]: 39: Hoare triple {7414#true} ~lk6~0 := 0; {7414#true} is VALID [2020-07-18 05:07:10,305 INFO L280 TraceCheckUtils]: 40: Hoare triple {7414#true} assume !(0 != ~p1~0); {7414#true} is VALID [2020-07-18 05:07:10,305 INFO L280 TraceCheckUtils]: 41: Hoare triple {7414#true} assume !(0 != ~p2~0); {7414#true} is VALID [2020-07-18 05:07:10,305 INFO L280 TraceCheckUtils]: 42: Hoare triple {7414#true} assume 0 != ~p3~0; {7414#true} is VALID [2020-07-18 05:07:10,306 INFO L280 TraceCheckUtils]: 43: Hoare triple {7414#true} ~lk3~0 := 1; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,307 INFO L280 TraceCheckUtils]: 44: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,308 INFO L280 TraceCheckUtils]: 45: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,308 INFO L280 TraceCheckUtils]: 46: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,309 INFO L280 TraceCheckUtils]: 47: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,309 INFO L280 TraceCheckUtils]: 48: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,310 INFO L280 TraceCheckUtils]: 49: Hoare triple {7418#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:10,310 INFO L280 TraceCheckUtils]: 50: Hoare triple {7418#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7415#false} is VALID [2020-07-18 05:07:10,311 INFO L280 TraceCheckUtils]: 51: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2020-07-18 05:07:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:10,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [742841192] [2020-07-18 05:07:10,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:10,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44934545] [2020-07-18 05:07:10,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 05:07:10,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:10,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:10,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:10,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:10,364 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-18 05:07:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,051 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-18 05:07:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:11,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 05:07:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-18 05:07:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-18 05:07:11,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-18 05:07:11,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:11,195 INFO L225 Difference]: With dead ends: 395 [2020-07-18 05:07:11,196 INFO L226 Difference]: Without dead ends: 393 [2020-07-18 05:07:11,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-18 05:07:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-18 05:07:11,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:11,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand 323 states. [2020-07-18 05:07:11,649 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand 323 states. [2020-07-18 05:07:11,649 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 323 states. [2020-07-18 05:07:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,663 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-18 05:07:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-18 05:07:11,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:11,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:11,664 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 393 states. [2020-07-18 05:07:11,665 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 393 states. [2020-07-18 05:07:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,677 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-18 05:07:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-18 05:07:11,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:11,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:11,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:11,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 05:07:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-18 05:07:11,689 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-18 05:07:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:11,689 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-18 05:07:11,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:11,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 418 transitions. [2020-07-18 05:07:12,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-18 05:07:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 05:07:12,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:12,133 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:12,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:07:12,133 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-18 05:07:12,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:12,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857894084] [2020-07-18 05:07:12,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:12,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-18 05:07:12,178 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-18 05:07:12,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {9643#true} call ULTIMATE.init(); {9643#true} is VALID [2020-07-18 05:07:12,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-18 05:07:12,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-18 05:07:12,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {9643#true} call #t~ret7 := main(); {9643#true} is VALID [2020-07-18 05:07:12,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {9643#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {9643#true} ~p1~0 := #t~nondet0; {9643#true} is VALID [2020-07-18 05:07:12,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {9643#true} havoc #t~nondet0; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {9643#true} havoc ~lk1~0; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {9643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {9643#true} ~p2~0 := #t~nondet1; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {9643#true} havoc #t~nondet1; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 11: Hoare triple {9643#true} havoc ~lk2~0; {9643#true} is VALID [2020-07-18 05:07:12,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {9643#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,181 INFO L280 TraceCheckUtils]: 13: Hoare triple {9643#true} ~p3~0 := #t~nondet2; {9643#true} is VALID [2020-07-18 05:07:12,181 INFO L280 TraceCheckUtils]: 14: Hoare triple {9643#true} havoc #t~nondet2; {9643#true} is VALID [2020-07-18 05:07:12,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {9643#true} havoc ~lk3~0; {9643#true} is VALID [2020-07-18 05:07:12,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {9643#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {9643#true} ~p4~0 := #t~nondet3; {9643#true} is VALID [2020-07-18 05:07:12,182 INFO L280 TraceCheckUtils]: 18: Hoare triple {9643#true} havoc #t~nondet3; {9643#true} is VALID [2020-07-18 05:07:12,182 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#true} havoc ~lk4~0; {9643#true} is VALID [2020-07-18 05:07:12,182 INFO L280 TraceCheckUtils]: 20: Hoare triple {9643#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {9643#true} ~p5~0 := #t~nondet4; {9643#true} is VALID [2020-07-18 05:07:12,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {9643#true} havoc #t~nondet4; {9643#true} is VALID [2020-07-18 05:07:12,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {9643#true} havoc ~lk5~0; {9643#true} is VALID [2020-07-18 05:07:12,183 INFO L280 TraceCheckUtils]: 24: Hoare triple {9643#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,183 INFO L280 TraceCheckUtils]: 25: Hoare triple {9643#true} ~p6~0 := #t~nondet5; {9643#true} is VALID [2020-07-18 05:07:12,183 INFO L280 TraceCheckUtils]: 26: Hoare triple {9643#true} havoc #t~nondet5; {9643#true} is VALID [2020-07-18 05:07:12,183 INFO L280 TraceCheckUtils]: 27: Hoare triple {9643#true} havoc ~lk6~0; {9643#true} is VALID [2020-07-18 05:07:12,184 INFO L280 TraceCheckUtils]: 28: Hoare triple {9643#true} havoc ~cond~0; {9643#true} is VALID [2020-07-18 05:07:12,184 INFO L280 TraceCheckUtils]: 29: Hoare triple {9643#true} assume !false; {9643#true} is VALID [2020-07-18 05:07:12,184 INFO L280 TraceCheckUtils]: 30: Hoare triple {9643#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9643#true} is VALID [2020-07-18 05:07:12,184 INFO L280 TraceCheckUtils]: 31: Hoare triple {9643#true} ~cond~0 := #t~nondet6; {9643#true} is VALID [2020-07-18 05:07:12,184 INFO L280 TraceCheckUtils]: 32: Hoare triple {9643#true} havoc #t~nondet6; {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 33: Hoare triple {9643#true} assume !(0 == ~cond~0); {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 34: Hoare triple {9643#true} ~lk1~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 35: Hoare triple {9643#true} ~lk2~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 36: Hoare triple {9643#true} ~lk3~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 37: Hoare triple {9643#true} ~lk4~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,185 INFO L280 TraceCheckUtils]: 38: Hoare triple {9643#true} ~lk5~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,186 INFO L280 TraceCheckUtils]: 39: Hoare triple {9643#true} ~lk6~0 := 0; {9643#true} is VALID [2020-07-18 05:07:12,186 INFO L280 TraceCheckUtils]: 40: Hoare triple {9643#true} assume !(0 != ~p1~0); {9643#true} is VALID [2020-07-18 05:07:12,186 INFO L280 TraceCheckUtils]: 41: Hoare triple {9643#true} assume !(0 != ~p2~0); {9643#true} is VALID [2020-07-18 05:07:12,186 INFO L280 TraceCheckUtils]: 42: Hoare triple {9643#true} assume !(0 != ~p3~0); {9643#true} is VALID [2020-07-18 05:07:12,187 INFO L280 TraceCheckUtils]: 43: Hoare triple {9643#true} assume !(0 != ~p4~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,187 INFO L280 TraceCheckUtils]: 44: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,188 INFO L280 TraceCheckUtils]: 45: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,188 INFO L280 TraceCheckUtils]: 46: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,189 INFO L280 TraceCheckUtils]: 47: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,190 INFO L280 TraceCheckUtils]: 48: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:12,190 INFO L280 TraceCheckUtils]: 49: Hoare triple {9647#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9644#false} is VALID [2020-07-18 05:07:12,190 INFO L280 TraceCheckUtils]: 50: Hoare triple {9644#false} assume 1 != ~lk4~0; {9644#false} is VALID [2020-07-18 05:07:12,191 INFO L280 TraceCheckUtils]: 51: Hoare triple {9644#false} assume !false; {9644#false} is VALID [2020-07-18 05:07:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:12,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857894084] [2020-07-18 05:07:12,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:12,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:12,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703857914] [2020-07-18 05:07:12,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 05:07:12,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:12,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:12,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:12,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:12,236 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-18 05:07:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:13,483 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-18 05:07:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:13,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 05:07:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-18 05:07:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-18 05:07:13,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2020-07-18 05:07:13,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:13,689 INFO L225 Difference]: With dead ends: 887 [2020-07-18 05:07:13,690 INFO L226 Difference]: Without dead ends: 593 [2020-07-18 05:07:13,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-18 05:07:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-18 05:07:14,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:14,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand 591 states. [2020-07-18 05:07:14,665 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand 591 states. [2020-07-18 05:07:14,665 INFO L87 Difference]: Start difference. First operand 593 states. Second operand 591 states. [2020-07-18 05:07:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:14,689 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-18 05:07:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-18 05:07:14,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:14,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:14,691 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 593 states. [2020-07-18 05:07:14,691 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 593 states. [2020-07-18 05:07:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:14,715 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-18 05:07:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-18 05:07:14,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:14,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:14,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:14,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-18 05:07:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-18 05:07:14,740 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-18 05:07:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:14,741 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-18 05:07:14,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:14,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 758 transitions. [2020-07-18 05:07:15,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-18 05:07:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 05:07:15,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:15,621 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:15,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:07:15,621 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-18 05:07:15,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:15,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650135772] [2020-07-18 05:07:15,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:15,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-18 05:07:15,660 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {13792#true} call ULTIMATE.init(); {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L263 TraceCheckUtils]: 3: Hoare triple {13792#true} call #t~ret7 := main(); {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {13792#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L280 TraceCheckUtils]: 5: Hoare triple {13792#true} ~p1~0 := #t~nondet0; {13792#true} is VALID [2020-07-18 05:07:15,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {13792#true} havoc #t~nondet0; {13792#true} is VALID [2020-07-18 05:07:15,662 INFO L280 TraceCheckUtils]: 7: Hoare triple {13792#true} havoc ~lk1~0; {13792#true} is VALID [2020-07-18 05:07:15,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {13792#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {13792#true} ~p2~0 := #t~nondet1; {13792#true} is VALID [2020-07-18 05:07:15,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {13792#true} havoc #t~nondet1; {13792#true} is VALID [2020-07-18 05:07:15,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {13792#true} havoc ~lk2~0; {13792#true} is VALID [2020-07-18 05:07:15,663 INFO L280 TraceCheckUtils]: 12: Hoare triple {13792#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,663 INFO L280 TraceCheckUtils]: 13: Hoare triple {13792#true} ~p3~0 := #t~nondet2; {13792#true} is VALID [2020-07-18 05:07:15,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {13792#true} havoc #t~nondet2; {13792#true} is VALID [2020-07-18 05:07:15,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {13792#true} havoc ~lk3~0; {13792#true} is VALID [2020-07-18 05:07:15,663 INFO L280 TraceCheckUtils]: 16: Hoare triple {13792#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,664 INFO L280 TraceCheckUtils]: 17: Hoare triple {13792#true} ~p4~0 := #t~nondet3; {13792#true} is VALID [2020-07-18 05:07:15,664 INFO L280 TraceCheckUtils]: 18: Hoare triple {13792#true} havoc #t~nondet3; {13792#true} is VALID [2020-07-18 05:07:15,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {13792#true} havoc ~lk4~0; {13792#true} is VALID [2020-07-18 05:07:15,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {13792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {13792#true} ~p5~0 := #t~nondet4; {13792#true} is VALID [2020-07-18 05:07:15,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {13792#true} havoc #t~nondet4; {13792#true} is VALID [2020-07-18 05:07:15,665 INFO L280 TraceCheckUtils]: 23: Hoare triple {13792#true} havoc ~lk5~0; {13792#true} is VALID [2020-07-18 05:07:15,665 INFO L280 TraceCheckUtils]: 24: Hoare triple {13792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,665 INFO L280 TraceCheckUtils]: 25: Hoare triple {13792#true} ~p6~0 := #t~nondet5; {13792#true} is VALID [2020-07-18 05:07:15,665 INFO L280 TraceCheckUtils]: 26: Hoare triple {13792#true} havoc #t~nondet5; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 27: Hoare triple {13792#true} havoc ~lk6~0; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 28: Hoare triple {13792#true} havoc ~cond~0; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 29: Hoare triple {13792#true} assume !false; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 30: Hoare triple {13792#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {13792#true} ~cond~0 := #t~nondet6; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 32: Hoare triple {13792#true} havoc #t~nondet6; {13792#true} is VALID [2020-07-18 05:07:15,666 INFO L280 TraceCheckUtils]: 33: Hoare triple {13792#true} assume !(0 == ~cond~0); {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 34: Hoare triple {13792#true} ~lk1~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {13792#true} ~lk2~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 36: Hoare triple {13792#true} ~lk3~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 37: Hoare triple {13792#true} ~lk4~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 38: Hoare triple {13792#true} ~lk5~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 39: Hoare triple {13792#true} ~lk6~0 := 0; {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 40: Hoare triple {13792#true} assume !(0 != ~p1~0); {13792#true} is VALID [2020-07-18 05:07:15,667 INFO L280 TraceCheckUtils]: 41: Hoare triple {13792#true} assume !(0 != ~p2~0); {13792#true} is VALID [2020-07-18 05:07:15,668 INFO L280 TraceCheckUtils]: 42: Hoare triple {13792#true} assume !(0 != ~p3~0); {13792#true} is VALID [2020-07-18 05:07:15,668 INFO L280 TraceCheckUtils]: 43: Hoare triple {13792#true} assume 0 != ~p4~0; {13792#true} is VALID [2020-07-18 05:07:15,668 INFO L280 TraceCheckUtils]: 44: Hoare triple {13792#true} ~lk4~0 := 1; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,669 INFO L280 TraceCheckUtils]: 45: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,669 INFO L280 TraceCheckUtils]: 46: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,670 INFO L280 TraceCheckUtils]: 47: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,670 INFO L280 TraceCheckUtils]: 48: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,671 INFO L280 TraceCheckUtils]: 49: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,671 INFO L280 TraceCheckUtils]: 50: Hoare triple {13796#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:15,672 INFO L280 TraceCheckUtils]: 51: Hoare triple {13796#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {13793#false} is VALID [2020-07-18 05:07:15,672 INFO L280 TraceCheckUtils]: 52: Hoare triple {13793#false} assume !false; {13793#false} is VALID [2020-07-18 05:07:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:15,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650135772] [2020-07-18 05:07:15,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:15,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:15,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982209799] [2020-07-18 05:07:15,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 05:07:15,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:15,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:15,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:15,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:15,737 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-18 05:07:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,285 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-18 05:07:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:17,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 05:07:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 05:07:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 05:07:17,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-18 05:07:17,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:17,431 INFO L225 Difference]: With dead ends: 715 [2020-07-18 05:07:17,431 INFO L226 Difference]: Without dead ends: 713 [2020-07-18 05:07:17,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-18 05:07:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-18 05:07:18,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:18,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand 591 states. [2020-07-18 05:07:18,480 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand 591 states. [2020-07-18 05:07:18,480 INFO L87 Difference]: Start difference. First operand 713 states. Second operand 591 states. [2020-07-18 05:07:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:18,513 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-18 05:07:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-18 05:07:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:18,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:18,516 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 713 states. [2020-07-18 05:07:18,516 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 713 states. [2020-07-18 05:07:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:18,549 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-18 05:07:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-18 05:07:18,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:18,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:18,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:18,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-18 05:07:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-18 05:07:18,577 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-18 05:07:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:18,577 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-18 05:07:18,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:18,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 750 transitions. [2020-07-18 05:07:19,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-18 05:07:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 05:07:19,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:19,472 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:19,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:07:19,472 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-18 05:07:19,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:19,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493621632] [2020-07-18 05:07:19,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:19,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-18 05:07:19,508 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-18 05:07:19,508 INFO L263 TraceCheckUtils]: 0: Hoare triple {17837#true} call ULTIMATE.init(); {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L263 TraceCheckUtils]: 3: Hoare triple {17837#true} call #t~ret7 := main(); {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {17837#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {17837#true} ~p1~0 := #t~nondet0; {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {17837#true} havoc #t~nondet0; {17837#true} is VALID [2020-07-18 05:07:19,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {17837#true} havoc ~lk1~0; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 8: Hoare triple {17837#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {17837#true} ~p2~0 := #t~nondet1; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {17837#true} havoc #t~nondet1; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {17837#true} havoc ~lk2~0; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {17837#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {17837#true} ~p3~0 := #t~nondet2; {17837#true} is VALID [2020-07-18 05:07:19,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {17837#true} havoc #t~nondet2; {17837#true} is VALID [2020-07-18 05:07:19,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {17837#true} havoc ~lk3~0; {17837#true} is VALID [2020-07-18 05:07:19,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {17837#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {17837#true} ~p4~0 := #t~nondet3; {17837#true} is VALID [2020-07-18 05:07:19,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {17837#true} havoc #t~nondet3; {17837#true} is VALID [2020-07-18 05:07:19,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {17837#true} havoc ~lk4~0; {17837#true} is VALID [2020-07-18 05:07:19,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {17837#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {17837#true} ~p5~0 := #t~nondet4; {17837#true} is VALID [2020-07-18 05:07:19,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {17837#true} havoc #t~nondet4; {17837#true} is VALID [2020-07-18 05:07:19,512 INFO L280 TraceCheckUtils]: 23: Hoare triple {17837#true} havoc ~lk5~0; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {17837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {17837#true} ~p6~0 := #t~nondet5; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {17837#true} havoc #t~nondet5; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 27: Hoare triple {17837#true} havoc ~lk6~0; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 28: Hoare triple {17837#true} havoc ~cond~0; {17837#true} is VALID [2020-07-18 05:07:19,513 INFO L280 TraceCheckUtils]: 29: Hoare triple {17837#true} assume !false; {17837#true} is VALID [2020-07-18 05:07:19,514 INFO L280 TraceCheckUtils]: 30: Hoare triple {17837#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17837#true} is VALID [2020-07-18 05:07:19,514 INFO L280 TraceCheckUtils]: 31: Hoare triple {17837#true} ~cond~0 := #t~nondet6; {17837#true} is VALID [2020-07-18 05:07:19,514 INFO L280 TraceCheckUtils]: 32: Hoare triple {17837#true} havoc #t~nondet6; {17837#true} is VALID [2020-07-18 05:07:19,514 INFO L280 TraceCheckUtils]: 33: Hoare triple {17837#true} assume !(0 == ~cond~0); {17837#true} is VALID [2020-07-18 05:07:19,514 INFO L280 TraceCheckUtils]: 34: Hoare triple {17837#true} ~lk1~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,515 INFO L280 TraceCheckUtils]: 35: Hoare triple {17837#true} ~lk2~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,515 INFO L280 TraceCheckUtils]: 36: Hoare triple {17837#true} ~lk3~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,515 INFO L280 TraceCheckUtils]: 37: Hoare triple {17837#true} ~lk4~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,515 INFO L280 TraceCheckUtils]: 38: Hoare triple {17837#true} ~lk5~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,515 INFO L280 TraceCheckUtils]: 39: Hoare triple {17837#true} ~lk6~0 := 0; {17837#true} is VALID [2020-07-18 05:07:19,516 INFO L280 TraceCheckUtils]: 40: Hoare triple {17837#true} assume !(0 != ~p1~0); {17837#true} is VALID [2020-07-18 05:07:19,516 INFO L280 TraceCheckUtils]: 41: Hoare triple {17837#true} assume !(0 != ~p2~0); {17837#true} is VALID [2020-07-18 05:07:19,516 INFO L280 TraceCheckUtils]: 42: Hoare triple {17837#true} assume !(0 != ~p3~0); {17837#true} is VALID [2020-07-18 05:07:19,516 INFO L280 TraceCheckUtils]: 43: Hoare triple {17837#true} assume !(0 != ~p4~0); {17837#true} is VALID [2020-07-18 05:07:19,517 INFO L280 TraceCheckUtils]: 44: Hoare triple {17837#true} assume !(0 != ~p5~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,517 INFO L280 TraceCheckUtils]: 45: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,518 INFO L280 TraceCheckUtils]: 46: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,518 INFO L280 TraceCheckUtils]: 47: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,519 INFO L280 TraceCheckUtils]: 48: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,519 INFO L280 TraceCheckUtils]: 49: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:19,520 INFO L280 TraceCheckUtils]: 50: Hoare triple {17841#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17838#false} is VALID [2020-07-18 05:07:19,520 INFO L280 TraceCheckUtils]: 51: Hoare triple {17838#false} assume 1 != ~lk5~0; {17838#false} is VALID [2020-07-18 05:07:19,520 INFO L280 TraceCheckUtils]: 52: Hoare triple {17838#false} assume !false; {17838#false} is VALID [2020-07-18 05:07:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:19,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493621632] [2020-07-18 05:07:19,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:19,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:19,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742518306] [2020-07-18 05:07:19,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 05:07:19,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:19,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:19,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:19,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:19,571 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-18 05:07:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:22,186 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-18 05:07:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:22,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 05:07:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-18 05:07:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-18 05:07:22,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2020-07-18 05:07:22,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:22,415 INFO L225 Difference]: With dead ends: 1667 [2020-07-18 05:07:22,415 INFO L226 Difference]: Without dead ends: 1105 [2020-07-18 05:07:22,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-18 05:07:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-18 05:07:24,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:24,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1105 states. Second operand 1103 states. [2020-07-18 05:07:24,661 INFO L74 IsIncluded]: Start isIncluded. First operand 1105 states. Second operand 1103 states. [2020-07-18 05:07:24,661 INFO L87 Difference]: Start difference. First operand 1105 states. Second operand 1103 states. [2020-07-18 05:07:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:24,704 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-18 05:07:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-18 05:07:24,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:24,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:24,707 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1105 states. [2020-07-18 05:07:24,707 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1105 states. [2020-07-18 05:07:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:24,770 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-18 05:07:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-18 05:07:24,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:24,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:24,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:24,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 05:07:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-18 05:07:24,836 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-18 05:07:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:24,836 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-18 05:07:24,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:24,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1374 transitions. [2020-07-18 05:07:26,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1374 edges. 1374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-18 05:07:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 05:07:26,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:26,560 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:26,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:07:26,561 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-18 05:07:26,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:26,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922074243] [2020-07-18 05:07:26,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-18 05:07:26,645 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-18 05:07:26,645 INFO L263 TraceCheckUtils]: 0: Hoare triple {25594#true} call ULTIMATE.init(); {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L263 TraceCheckUtils]: 3: Hoare triple {25594#true} call #t~ret7 := main(); {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {25594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {25594#true} ~p1~0 := #t~nondet0; {25594#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {25594#true} havoc #t~nondet0; {25594#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {25594#true} havoc ~lk1~0; {25594#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {25594#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {25594#true} ~p2~0 := #t~nondet1; {25594#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {25594#true} havoc #t~nondet1; {25594#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 11: Hoare triple {25594#true} havoc ~lk2~0; {25594#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {25594#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {25594#true} ~p3~0 := #t~nondet2; {25594#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {25594#true} havoc #t~nondet2; {25594#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {25594#true} havoc ~lk3~0; {25594#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {25594#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {25594#true} ~p4~0 := #t~nondet3; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {25594#true} havoc #t~nondet3; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {25594#true} havoc ~lk4~0; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {25594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 21: Hoare triple {25594#true} ~p5~0 := #t~nondet4; {25594#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {25594#true} havoc #t~nondet4; {25594#true} is VALID [2020-07-18 05:07:26,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {25594#true} havoc ~lk5~0; {25594#true} is VALID [2020-07-18 05:07:26,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {25594#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {25594#true} ~p6~0 := #t~nondet5; {25594#true} is VALID [2020-07-18 05:07:26,650 INFO L280 TraceCheckUtils]: 26: Hoare triple {25594#true} havoc #t~nondet5; {25594#true} is VALID [2020-07-18 05:07:26,650 INFO L280 TraceCheckUtils]: 27: Hoare triple {25594#true} havoc ~lk6~0; {25594#true} is VALID [2020-07-18 05:07:26,651 INFO L280 TraceCheckUtils]: 28: Hoare triple {25594#true} havoc ~cond~0; {25594#true} is VALID [2020-07-18 05:07:26,651 INFO L280 TraceCheckUtils]: 29: Hoare triple {25594#true} assume !false; {25594#true} is VALID [2020-07-18 05:07:26,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {25594#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {25594#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 31: Hoare triple {25594#true} ~cond~0 := #t~nondet6; {25594#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 32: Hoare triple {25594#true} havoc #t~nondet6; {25594#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {25594#true} assume !(0 == ~cond~0); {25594#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 34: Hoare triple {25594#true} ~lk1~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {25594#true} ~lk2~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 36: Hoare triple {25594#true} ~lk3~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 37: Hoare triple {25594#true} ~lk4~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 38: Hoare triple {25594#true} ~lk5~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 39: Hoare triple {25594#true} ~lk6~0 := 0; {25594#true} is VALID [2020-07-18 05:07:26,662 INFO L280 TraceCheckUtils]: 40: Hoare triple {25594#true} assume !(0 != ~p1~0); {25594#true} is VALID [2020-07-18 05:07:26,662 INFO L280 TraceCheckUtils]: 41: Hoare triple {25594#true} assume !(0 != ~p2~0); {25594#true} is VALID [2020-07-18 05:07:26,662 INFO L280 TraceCheckUtils]: 42: Hoare triple {25594#true} assume !(0 != ~p3~0); {25594#true} is VALID [2020-07-18 05:07:26,662 INFO L280 TraceCheckUtils]: 43: Hoare triple {25594#true} assume !(0 != ~p4~0); {25594#true} is VALID [2020-07-18 05:07:26,665 INFO L280 TraceCheckUtils]: 44: Hoare triple {25594#true} assume 0 != ~p5~0; {25594#true} is VALID [2020-07-18 05:07:26,672 INFO L280 TraceCheckUtils]: 45: Hoare triple {25594#true} ~lk5~0 := 1; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,673 INFO L280 TraceCheckUtils]: 46: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,674 INFO L280 TraceCheckUtils]: 47: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,674 INFO L280 TraceCheckUtils]: 48: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,675 INFO L280 TraceCheckUtils]: 49: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,675 INFO L280 TraceCheckUtils]: 50: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,676 INFO L280 TraceCheckUtils]: 51: Hoare triple {25598#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:26,676 INFO L280 TraceCheckUtils]: 52: Hoare triple {25598#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {25595#false} is VALID [2020-07-18 05:07:26,677 INFO L280 TraceCheckUtils]: 53: Hoare triple {25595#false} assume !false; {25595#false} is VALID [2020-07-18 05:07:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:26,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922074243] [2020-07-18 05:07:26,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:26,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:26,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77705491] [2020-07-18 05:07:26,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 05:07:26,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:26,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:26,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:26,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:26,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:26,739 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-18 05:07:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:29,725 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-18 05:07:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:29,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 05:07:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-18 05:07:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-18 05:07:29,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-18 05:07:29,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:29,905 INFO L225 Difference]: With dead ends: 1315 [2020-07-18 05:07:29,905 INFO L226 Difference]: Without dead ends: 1313 [2020-07-18 05:07:29,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-18 05:07:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-18 05:07:32,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:32,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand 1103 states. [2020-07-18 05:07:32,297 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand 1103 states. [2020-07-18 05:07:32,297 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand 1103 states. [2020-07-18 05:07:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:32,352 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-18 05:07:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-18 05:07:32,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:32,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:32,355 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1313 states. [2020-07-18 05:07:32,355 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1313 states. [2020-07-18 05:07:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:32,434 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-18 05:07:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-18 05:07:32,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:32,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:32,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:32,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 05:07:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-18 05:07:32,474 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-18 05:07:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:32,474 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-18 05:07:32,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:32,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1358 transitions. [2020-07-18 05:07:34,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1358 edges. 1358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-18 05:07:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 05:07:34,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:34,164 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:34,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:07:34,165 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-18 05:07:34,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:34,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387255806] [2020-07-18 05:07:34,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:34,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-18 05:07:34,198 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-18 05:07:34,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2020-07-18 05:07:34,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-18 05:07:34,199 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-18 05:07:34,199 INFO L263 TraceCheckUtils]: 3: Hoare triple {33063#true} call #t~ret7 := main(); {33063#true} is VALID [2020-07-18 05:07:34,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {33063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {33063#true} ~p1~0 := #t~nondet0; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {33063#true} havoc #t~nondet0; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {33063#true} havoc ~lk1~0; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {33063#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {33063#true} ~p2~0 := #t~nondet1; {33063#true} is VALID [2020-07-18 05:07:34,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {33063#true} havoc #t~nondet1; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {33063#true} havoc ~lk2~0; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {33063#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {33063#true} ~p3~0 := #t~nondet2; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {33063#true} havoc #t~nondet2; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {33063#true} havoc ~lk3~0; {33063#true} is VALID [2020-07-18 05:07:34,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {33063#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {33063#true} ~p4~0 := #t~nondet3; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {33063#true} havoc #t~nondet3; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 19: Hoare triple {33063#true} havoc ~lk4~0; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 20: Hoare triple {33063#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 21: Hoare triple {33063#true} ~p5~0 := #t~nondet4; {33063#true} is VALID [2020-07-18 05:07:34,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {33063#true} havoc #t~nondet4; {33063#true} is VALID [2020-07-18 05:07:34,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {33063#true} havoc ~lk5~0; {33063#true} is VALID [2020-07-18 05:07:34,203 INFO L280 TraceCheckUtils]: 24: Hoare triple {33063#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,203 INFO L280 TraceCheckUtils]: 25: Hoare triple {33063#true} ~p6~0 := #t~nondet5; {33063#true} is VALID [2020-07-18 05:07:34,203 INFO L280 TraceCheckUtils]: 26: Hoare triple {33063#true} havoc #t~nondet5; {33063#true} is VALID [2020-07-18 05:07:34,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {33063#true} havoc ~lk6~0; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 28: Hoare triple {33063#true} havoc ~cond~0; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 29: Hoare triple {33063#true} assume !false; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 30: Hoare triple {33063#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 31: Hoare triple {33063#true} ~cond~0 := #t~nondet6; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 32: Hoare triple {33063#true} havoc #t~nondet6; {33063#true} is VALID [2020-07-18 05:07:34,204 INFO L280 TraceCheckUtils]: 33: Hoare triple {33063#true} assume !(0 == ~cond~0); {33063#true} is VALID [2020-07-18 05:07:34,205 INFO L280 TraceCheckUtils]: 34: Hoare triple {33063#true} ~lk1~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,205 INFO L280 TraceCheckUtils]: 35: Hoare triple {33063#true} ~lk2~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,205 INFO L280 TraceCheckUtils]: 36: Hoare triple {33063#true} ~lk3~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,205 INFO L280 TraceCheckUtils]: 37: Hoare triple {33063#true} ~lk4~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,205 INFO L280 TraceCheckUtils]: 38: Hoare triple {33063#true} ~lk5~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 39: Hoare triple {33063#true} ~lk6~0 := 0; {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 40: Hoare triple {33063#true} assume !(0 != ~p1~0); {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 41: Hoare triple {33063#true} assume !(0 != ~p2~0); {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 42: Hoare triple {33063#true} assume !(0 != ~p3~0); {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 43: Hoare triple {33063#true} assume !(0 != ~p4~0); {33063#true} is VALID [2020-07-18 05:07:34,206 INFO L280 TraceCheckUtils]: 44: Hoare triple {33063#true} assume !(0 != ~p5~0); {33063#true} is VALID [2020-07-18 05:07:34,207 INFO L280 TraceCheckUtils]: 45: Hoare triple {33063#true} assume !(0 != ~p6~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,207 INFO L280 TraceCheckUtils]: 46: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,208 INFO L280 TraceCheckUtils]: 47: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,208 INFO L280 TraceCheckUtils]: 48: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,209 INFO L280 TraceCheckUtils]: 49: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,209 INFO L280 TraceCheckUtils]: 50: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:34,209 INFO L280 TraceCheckUtils]: 51: Hoare triple {33067#(= 0 main_~p6~0)} assume 0 != ~p6~0; {33064#false} is VALID [2020-07-18 05:07:34,210 INFO L280 TraceCheckUtils]: 52: Hoare triple {33064#false} assume 1 != ~lk6~0; {33064#false} is VALID [2020-07-18 05:07:34,210 INFO L280 TraceCheckUtils]: 53: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2020-07-18 05:07:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:34,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387255806] [2020-07-18 05:07:34,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:34,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:34,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741100500] [2020-07-18 05:07:34,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 05:07:34,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:34,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:34,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:34,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:34,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:34,262 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-18 05:07:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:39,822 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-18 05:07:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:39,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 05:07:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-18 05:07:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-18 05:07:39,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-18 05:07:39,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:40,040 INFO L225 Difference]: With dead ends: 3153 [2020-07-18 05:07:40,040 INFO L226 Difference]: Without dead ends: 1103 [2020-07-18 05:07:40,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-18 05:07:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-18 05:07:42,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:42,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1103 states. Second operand 1103 states. [2020-07-18 05:07:42,370 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-18 05:07:42,371 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-18 05:07:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:42,414 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 05:07:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 05:07:42,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:42,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:42,416 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-18 05:07:42,416 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-18 05:07:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:42,472 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 05:07:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 05:07:42,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:42,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:42,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:42,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 05:07:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-18 05:07:42,521 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-18 05:07:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:42,521 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-18 05:07:42,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:42,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1294 transitions. [2020-07-18 05:07:44,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1294 edges. 1294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 05:07:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 05:07:44,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:44,150 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:07:44,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 05:07:44,150 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-18 05:07:44,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:44,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899217117] [2020-07-18 05:07:44,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:44,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-18 05:07:44,215 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-18 05:07:44,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2020-07-18 05:07:44,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-18 05:07:44,216 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-18 05:07:44,216 INFO L263 TraceCheckUtils]: 3: Hoare triple {43788#true} call #t~ret7 := main(); {43788#true} is VALID [2020-07-18 05:07:44,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {43788#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {43788#true} ~p1~0 := #t~nondet0; {43788#true} is VALID [2020-07-18 05:07:44,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {43788#true} havoc #t~nondet0; {43788#true} is VALID [2020-07-18 05:07:44,217 INFO L280 TraceCheckUtils]: 7: Hoare triple {43788#true} havoc ~lk1~0; {43788#true} is VALID [2020-07-18 05:07:44,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {43788#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {43788#true} ~p2~0 := #t~nondet1; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {43788#true} havoc #t~nondet1; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {43788#true} havoc ~lk2~0; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {43788#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {43788#true} ~p3~0 := #t~nondet2; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {43788#true} havoc #t~nondet2; {43788#true} is VALID [2020-07-18 05:07:44,218 INFO L280 TraceCheckUtils]: 15: Hoare triple {43788#true} havoc ~lk3~0; {43788#true} is VALID [2020-07-18 05:07:44,219 INFO L280 TraceCheckUtils]: 16: Hoare triple {43788#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,219 INFO L280 TraceCheckUtils]: 17: Hoare triple {43788#true} ~p4~0 := #t~nondet3; {43788#true} is VALID [2020-07-18 05:07:44,219 INFO L280 TraceCheckUtils]: 18: Hoare triple {43788#true} havoc #t~nondet3; {43788#true} is VALID [2020-07-18 05:07:44,219 INFO L280 TraceCheckUtils]: 19: Hoare triple {43788#true} havoc ~lk4~0; {43788#true} is VALID [2020-07-18 05:07:44,219 INFO L280 TraceCheckUtils]: 20: Hoare triple {43788#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,220 INFO L280 TraceCheckUtils]: 21: Hoare triple {43788#true} ~p5~0 := #t~nondet4; {43788#true} is VALID [2020-07-18 05:07:44,220 INFO L280 TraceCheckUtils]: 22: Hoare triple {43788#true} havoc #t~nondet4; {43788#true} is VALID [2020-07-18 05:07:44,220 INFO L280 TraceCheckUtils]: 23: Hoare triple {43788#true} havoc ~lk5~0; {43788#true} is VALID [2020-07-18 05:07:44,220 INFO L280 TraceCheckUtils]: 24: Hoare triple {43788#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,221 INFO L280 TraceCheckUtils]: 25: Hoare triple {43788#true} ~p6~0 := #t~nondet5; {43788#true} is VALID [2020-07-18 05:07:44,221 INFO L280 TraceCheckUtils]: 26: Hoare triple {43788#true} havoc #t~nondet5; {43788#true} is VALID [2020-07-18 05:07:44,221 INFO L280 TraceCheckUtils]: 27: Hoare triple {43788#true} havoc ~lk6~0; {43788#true} is VALID [2020-07-18 05:07:44,221 INFO L280 TraceCheckUtils]: 28: Hoare triple {43788#true} havoc ~cond~0; {43788#true} is VALID [2020-07-18 05:07:44,221 INFO L280 TraceCheckUtils]: 29: Hoare triple {43788#true} assume !false; {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 30: Hoare triple {43788#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 31: Hoare triple {43788#true} ~cond~0 := #t~nondet6; {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 32: Hoare triple {43788#true} havoc #t~nondet6; {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 33: Hoare triple {43788#true} assume !(0 == ~cond~0); {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 34: Hoare triple {43788#true} ~lk1~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,222 INFO L280 TraceCheckUtils]: 35: Hoare triple {43788#true} ~lk2~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 36: Hoare triple {43788#true} ~lk3~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 37: Hoare triple {43788#true} ~lk4~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 38: Hoare triple {43788#true} ~lk5~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 39: Hoare triple {43788#true} ~lk6~0 := 0; {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 40: Hoare triple {43788#true} assume !(0 != ~p1~0); {43788#true} is VALID [2020-07-18 05:07:44,223 INFO L280 TraceCheckUtils]: 41: Hoare triple {43788#true} assume !(0 != ~p2~0); {43788#true} is VALID [2020-07-18 05:07:44,224 INFO L280 TraceCheckUtils]: 42: Hoare triple {43788#true} assume !(0 != ~p3~0); {43788#true} is VALID [2020-07-18 05:07:44,224 INFO L280 TraceCheckUtils]: 43: Hoare triple {43788#true} assume !(0 != ~p4~0); {43788#true} is VALID [2020-07-18 05:07:44,224 INFO L280 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 != ~p5~0); {43788#true} is VALID [2020-07-18 05:07:44,225 INFO L280 TraceCheckUtils]: 45: Hoare triple {43788#true} assume 0 != ~p6~0; {43788#true} is VALID [2020-07-18 05:07:44,226 INFO L280 TraceCheckUtils]: 46: Hoare triple {43788#true} ~lk6~0 := 1; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,226 INFO L280 TraceCheckUtils]: 47: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,227 INFO L280 TraceCheckUtils]: 48: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,227 INFO L280 TraceCheckUtils]: 49: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,228 INFO L280 TraceCheckUtils]: 50: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,228 INFO L280 TraceCheckUtils]: 51: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,229 INFO L280 TraceCheckUtils]: 52: Hoare triple {43792#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:07:44,230 INFO L280 TraceCheckUtils]: 53: Hoare triple {43792#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {43789#false} is VALID [2020-07-18 05:07:44,230 INFO L280 TraceCheckUtils]: 54: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2020-07-18 05:07:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:44,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899217117] [2020-07-18 05:07:44,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:44,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:44,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783563830] [2020-07-18 05:07:44,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 05:07:44,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:44,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:44,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:44,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:44,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:44,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:44,283 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-18 05:07:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:46,901 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 05:07:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:46,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 05:07:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-18 05:07:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-18 05:07:46,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-18 05:07:46,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:46,979 INFO L225 Difference]: With dead ends: 1103 [2020-07-18 05:07:46,979 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:07:46,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:07:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:07:46,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:46,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:46,983 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:46,983 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:46,984 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:07:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:46,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:46,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:46,984 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:46,984 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:46,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:07:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:46,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:46,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:46,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:46,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:07:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:07:46,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-18 05:07:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:46,986 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:07:46,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:46,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:07:46,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:46,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:46,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 05:07:46,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:07:47,111 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 15 [2020-07-18 05:07:47,483 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:07:47,701 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-07-18 05:07:48,254 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:48,633 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:07:48,999 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:07:49,955 WARN L193 SmtUtils]: Spent 879.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:07:50,076 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:50,333 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:50,718 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:07:51,058 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:07:51,213 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:07:51,485 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:07:51,851 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,008 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:07:52,009 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-18 05:07:52,009 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-18 05:07:52,009 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 05:07:52,009 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-18 05:07:52,009 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-18 05:07:52,010 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-18 05:07:52,010 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 05:07:52,010 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-18 05:07:52,010 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-18 05:07:52,011 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-18 05:07:52,011 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 05:07:52,011 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 05:07:52,011 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 05:07:52,011 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-18 05:07:52,011 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-18 05:07:52,012 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 05:07:52,012 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-18 05:07:52,012 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 05:07:52,012 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 05:07:52,012 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 05:07:52,012 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 05:07:52,013 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse7) (and .cse8 .cse0 .cse6 .cse1 .cse2) (and .cse8 .cse5 .cse0 .cse7 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse0 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse0 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse2))) [2020-07-18 05:07:52,013 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-18 05:07:52,013 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 05:07:52,013 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-18 05:07:52,013 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:07:52,013 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-18 05:07:52,013 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-18 05:07:52,013 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 05:07:52,014 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-18 05:07:52,014 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-18 05:07:52,014 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 05:07:52,014 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 05:07:52,014 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 05:07:52,015 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-18 05:07:52,016 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-18 05:07:52,016 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-18 05:07:52,016 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 05:07:52,016 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-18 05:07:52,016 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-18 05:07:52,017 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-18 05:07:52,017 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-18 05:07:52,017 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 05:07:52,017 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-18 05:07:52,018 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-18 05:07:52,018 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-18 05:07:52,018 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 05:07:52,019 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 05:07:52,019 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-18 05:07:52,019 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 05:07:52,019 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 05:07:52,019 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 05:07:52,019 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 05:07:52,020 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 05:07:52,020 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 05:07:52,020 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-18 05:07:52,020 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 05:07:52,020 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-18 05:07:52,021 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-18 05:07:52,021 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:07:52,021 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 05:07:52,021 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 05:07:52,022 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 05:07:52,022 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 05:07:52,082 INFO L163 areAnnotationChecker]: CFG has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:07:52,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:07:52 BoogieIcfgContainer [2020-07-18 05:07:52,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:07:52,096 INFO L168 Benchmark]: Toolchain (without parser) took 50270.99 ms. Allocated memory was 137.4 MB in the beginning and 569.4 MB in the end (delta: 432.0 MB). Free memory was 102.8 MB in the beginning and 514.9 MB in the end (delta: -412.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,097 INFO L168 Benchmark]: CDTParser took 1.05 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.60 ms. Allocated memory is still 137.4 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,098 INFO L168 Benchmark]: Boogie Preprocessor took 120.16 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 92.1 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,098 INFO L168 Benchmark]: RCFGBuilder took 566.76 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 150.2 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,099 INFO L168 Benchmark]: TraceAbstraction took 49290.22 ms. Allocated memory was 201.9 MB in the beginning and 569.4 MB in the end (delta: 367.5 MB). Free memory was 150.2 MB in the beginning and 514.9 MB in the end (delta: -364.6 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:52,101 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.60 ms. Allocated memory is still 137.4 MB. Free memory was 102.6 MB in the beginning and 92.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.16 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 92.1 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 566.76 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 150.2 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49290.22 ms. Allocated memory was 201.9 MB in the beginning and 569.4 MB in the end (delta: 367.5 MB). Free memory was 150.2 MB in the beginning and 514.9 MB in the end (delta: -364.6 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 39212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...