/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:47,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:47,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:47,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:47,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:47,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:47,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:47,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:47,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:47,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:47,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:47,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:47,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:47,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:47,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:47,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:47,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:47,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:47,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:47,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:47,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:47,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:47,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:47,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:47,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:47,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:47,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:47,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:47,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:47,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:47,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:47,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:47,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:47,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:47,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:47,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:47,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:47,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:47,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:47,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:47,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:47,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:03:47,475 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:47,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:47,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:47,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:47,477 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:47,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:47,477 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:47,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:47,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:47,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:47,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:47,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:47,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:47,479 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:47,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:47,479 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:47,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:47,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:47,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:47,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:47,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:47,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:47,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:47,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:47,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:47,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:47,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:47,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:47,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:47,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:47,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:47,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:47,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:47,788 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:47,788 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:47,789 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-07-10 15:03:47,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0010aa6/274824828f554cf8ac6a07e0505739ad/FLAG0824fd7ce [2020-07-10 15:03:48,359 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:48,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-10 15:03:48,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0010aa6/274824828f554cf8ac6a07e0505739ad/FLAG0824fd7ce [2020-07-10 15:03:48,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0010aa6/274824828f554cf8ac6a07e0505739ad [2020-07-10 15:03:48,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:48,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:48,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:48,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:48,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:48,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:48" (1/1) ... [2020-07-10 15:03:48,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4851ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:48, skipping insertion in model container [2020-07-10 15:03:48,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:48" (1/1) ... [2020-07-10 15:03:48,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:48,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:48,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:48,943 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:48,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:48,999 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:49,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49 WrapperNode [2020-07-10 15:03:49,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:49,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:49,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:49,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:49,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (1/1) ... [2020-07-10 15:03:49,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:49,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:49,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:49,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:49,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (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-10 15:03:49,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:49,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:49,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:49,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:49,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:49,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:49,487 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:49,487 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:49,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:49 BoogieIcfgContainer [2020-07-10 15:03:49,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:49,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:49,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:49,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:49,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:48" (1/3) ... [2020-07-10 15:03:49,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1f799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:49, skipping insertion in model container [2020-07-10 15:03:49,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:49" (2/3) ... [2020-07-10 15:03:49,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1f799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:49, skipping insertion in model container [2020-07-10 15:03:49,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:49" (3/3) ... [2020-07-10 15:03:49,502 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-10 15:03:49,514 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:49,523 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:49,540 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:49,579 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:49,579 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:49,580 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:49,580 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:49,580 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:49,580 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:49,580 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:49,582 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 15:03:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:03:49,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:49,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:49,633 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2020-07-10 15:03:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:49,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496033425] [2020-07-10 15:03:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:49,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:03:49,856 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2020-07-10 15:03:49,858 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-10 15:03:49,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:03:49,858 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2020-07-10 15:03:49,859 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2020-07-10 15:03:49,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {32#true} is VALID [2020-07-10 15:03:49,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2020-07-10 15:03:49,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {32#true} is VALID [2020-07-10 15:03:49,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} assume 0 != ~p1~0;~lk1~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,873 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {36#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:49,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {33#false} is VALID [2020-07-10 15:03:49,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 15:03:49,877 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-10 15:03:49,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496033425] [2020-07-10 15:03:49,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:49,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:49,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885811583] [2020-07-10 15:03:49,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:03:49,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:49,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:49,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:49,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:49,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:49,940 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-10 15:03:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,111 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2020-07-10 15:03:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:50,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:03:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:03:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:03:50,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-10 15:03:50,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:50,301 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:03:50,301 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:03:50,305 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-10 15:03:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:03:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2020-07-10 15:03:50,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:50,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2020-07-10 15:03:50,353 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2020-07-10 15:03:50,353 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2020-07-10 15:03:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,360 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-10 15:03:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-10 15:03:50,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,362 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2020-07-10 15:03:50,362 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2020-07-10 15:03:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,369 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-10 15:03:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-10 15:03:50,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:50,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:03:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2020-07-10 15:03:50,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2020-07-10 15:03:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:50,380 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-07-10 15:03:50,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2020-07-10 15:03:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:03:50,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:50,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:50,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:50,382 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2020-07-10 15:03:50,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:50,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78154759] [2020-07-10 15:03:50,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:03:50,505 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {228#true} {228#true} #112#return; {228#true} is VALID [2020-07-10 15:03:50,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2020-07-10 15:03:50,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:03:50,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #112#return; {228#true} is VALID [2020-07-10 15:03:50,506 INFO L263 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2020-07-10 15:03:50,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {228#true} is VALID [2020-07-10 15:03:50,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {228#true} is VALID [2020-07-10 15:03:50,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {228#true} is VALID [2020-07-10 15:03:50,510 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#true} assume !(0 != ~p1~0); {232#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:50,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:50,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:50,515 INFO L280 TraceCheckUtils]: 10: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:50,516 INFO L280 TraceCheckUtils]: 11: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:50,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p1~0; {229#false} is VALID [2020-07-10 15:03:50,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {229#false} assume 1 != ~lk1~0; {229#false} is VALID [2020-07-10 15:03:50,518 INFO L280 TraceCheckUtils]: 14: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-10 15:03:50,521 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-10 15:03:50,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78154759] [2020-07-10 15:03:50,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:50,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:50,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518106276] [2020-07-10 15:03:50,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:03:50,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:50,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:50,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:50,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:50,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:50,554 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2020-07-10 15:03:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,669 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2020-07-10 15:03:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:50,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:03:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-10 15:03:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-10 15:03:50,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2020-07-10 15:03:50,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:50,804 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:03:50,804 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:03:50,806 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-10 15:03:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:03:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-10 15:03:50,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:50,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-10 15:03:50,816 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-10 15:03:50,816 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-10 15:03:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,820 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2020-07-10 15:03:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-10 15:03:50,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,822 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-10 15:03:50,822 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-10 15:03:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,826 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2020-07-10 15:03:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-10 15:03:50,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:50,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:03:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-07-10 15:03:50,831 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2020-07-10 15:03:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:50,831 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-07-10 15:03:50,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-07-10 15:03:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:03:50,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:50,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:50,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:50,833 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2020-07-10 15:03:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:50,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806516814] [2020-07-10 15:03:50,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {443#true} assume true; {443#true} is VALID [2020-07-10 15:03:50,878 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {443#true} {443#true} #112#return; {443#true} is VALID [2020-07-10 15:03:50,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {443#true} call ULTIMATE.init(); {443#true} is VALID [2020-07-10 15:03:50,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {443#true} assume true; {443#true} is VALID [2020-07-10 15:03:50,879 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} #112#return; {443#true} is VALID [2020-07-10 15:03:50,880 INFO L263 TraceCheckUtils]: 3: Hoare triple {443#true} call #t~ret6 := main(); {443#true} is VALID [2020-07-10 15:03:50,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {443#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {443#true} is VALID [2020-07-10 15:03:50,880 INFO L280 TraceCheckUtils]: 5: Hoare triple {443#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {443#true} is VALID [2020-07-10 15:03:50,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {443#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {443#true} is VALID [2020-07-10 15:03:50,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {443#true} assume 0 != ~p1~0;~lk1~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:50,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:50,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:50,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:50,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:50,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {447#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {444#false} is VALID [2020-07-10 15:03:50,886 INFO L280 TraceCheckUtils]: 13: Hoare triple {444#false} assume 0 != ~p2~0; {444#false} is VALID [2020-07-10 15:03:50,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {444#false} assume 1 != ~lk2~0; {444#false} is VALID [2020-07-10 15:03:50,887 INFO L280 TraceCheckUtils]: 15: Hoare triple {444#false} assume !false; {444#false} is VALID [2020-07-10 15:03:50,887 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-10 15:03:50,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806516814] [2020-07-10 15:03:50,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:50,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:50,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84422765] [2020-07-10 15:03:50,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:50,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:50,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:50,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:50,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:50,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:50,909 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2020-07-10 15:03:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,995 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-07-10 15:03:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:50,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-07-10 15:03:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-07-10 15:03:51,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2020-07-10 15:03:51,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,110 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:03:51,110 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 15:03:51,111 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-10 15:03:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 15:03:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2020-07-10 15:03:51,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:51,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2020-07-10 15:03:51,123 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2020-07-10 15:03:51,123 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2020-07-10 15:03:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,126 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-10 15:03:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-10 15:03:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,128 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2020-07-10 15:03:51,128 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2020-07-10 15:03:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,131 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-10 15:03:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-10 15:03:51,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:51,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:03:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-07-10 15:03:51,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2020-07-10 15:03:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:51,142 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-07-10 15:03:51,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-07-10 15:03:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:03:51,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:51,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:51,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:51,144 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2020-07-10 15:03:51,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:51,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830540636] [2020-07-10 15:03:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-10 15:03:51,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {665#true} {665#true} #112#return; {665#true} is VALID [2020-07-10 15:03:51,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-10 15:03:51,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-10 15:03:51,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #112#return; {665#true} is VALID [2020-07-10 15:03:51,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret6 := main(); {665#true} is VALID [2020-07-10 15:03:51,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {665#true} is VALID [2020-07-10 15:03:51,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {665#true} is VALID [2020-07-10 15:03:51,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {665#true} is VALID [2020-07-10 15:03:51,190 INFO L280 TraceCheckUtils]: 7: Hoare triple {665#true} assume !(0 != ~p1~0); {665#true} is VALID [2020-07-10 15:03:51,191 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} assume 0 != ~p2~0;~lk2~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {669#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {669#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:51,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {669#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {666#false} is VALID [2020-07-10 15:03:51,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-10 15:03:51,198 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-10 15:03:51,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830540636] [2020-07-10 15:03:51,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539304003] [2020-07-10 15:03:51,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:51,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:51,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:51,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:51,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:51,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:51,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:51,222 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2020-07-10 15:03:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,307 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2020-07-10 15:03:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:51,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-10 15:03:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-10 15:03:51,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2020-07-10 15:03:51,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,401 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:03:51,401 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 15:03:51,402 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-10 15:03:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 15:03:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2020-07-10 15:03:51,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:51,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 56 states. [2020-07-10 15:03:51,416 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 56 states. [2020-07-10 15:03:51,417 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 56 states. [2020-07-10 15:03:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,421 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2020-07-10 15:03:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2020-07-10 15:03:51,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,423 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 74 states. [2020-07-10 15:03:51,423 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 74 states. [2020-07-10 15:03:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,429 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2020-07-10 15:03:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2020-07-10 15:03:51,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:51,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:03:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2020-07-10 15:03:51,434 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2020-07-10 15:03:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:51,435 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2020-07-10 15:03:51,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2020-07-10 15:03:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:03:51,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:51,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:51,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:51,437 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2020-07-10 15:03:51,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:51,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723978351] [2020-07-10 15:03:51,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:03:51,484 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {972#true} {972#true} #112#return; {972#true} is VALID [2020-07-10 15:03:51,484 INFO L263 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2020-07-10 15:03:51,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:03:51,485 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #112#return; {972#true} is VALID [2020-07-10 15:03:51,485 INFO L263 TraceCheckUtils]: 3: Hoare triple {972#true} call #t~ret6 := main(); {972#true} is VALID [2020-07-10 15:03:51,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {972#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {972#true} is VALID [2020-07-10 15:03:51,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {972#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {972#true} is VALID [2020-07-10 15:03:51,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {972#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {972#true} is VALID [2020-07-10 15:03:51,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {972#true} assume !(0 != ~p1~0); {972#true} is VALID [2020-07-10 15:03:51,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 != ~p2~0); {976#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:51,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:51,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:51,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:51,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {976#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {976#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:51,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p2~0; {973#false} is VALID [2020-07-10 15:03:51,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#false} assume 1 != ~lk2~0; {973#false} is VALID [2020-07-10 15:03:51,505 INFO L280 TraceCheckUtils]: 15: Hoare triple {973#false} assume !false; {973#false} is VALID [2020-07-10 15:03:51,505 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-10 15:03:51,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723978351] [2020-07-10 15:03:51,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:51,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:51,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102356852] [2020-07-10 15:03:51,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:51,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:51,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:51,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:51,535 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2020-07-10 15:03:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,644 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2020-07-10 15:03:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:51,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:03:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:03:51,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-10 15:03:51,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,757 INFO L225 Difference]: With dead ends: 124 [2020-07-10 15:03:51,758 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 15:03:51,759 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-10 15:03:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 15:03:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2020-07-10 15:03:51,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:51,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:51,781 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:51,782 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,787 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2020-07-10 15:03:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2020-07-10 15:03:51,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,788 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2020-07-10 15:03:51,788 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2020-07-10 15:03:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,795 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2020-07-10 15:03:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2020-07-10 15:03:51,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:51,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 15:03:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2020-07-10 15:03:51,800 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2020-07-10 15:03:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:51,800 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2020-07-10 15:03:51,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2020-07-10 15:03:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:51,801 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:51,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:51,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:51,801 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2020-07-10 15:03:51,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:51,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466167276] [2020-07-10 15:03:51,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {1353#true} assume true; {1353#true} is VALID [2020-07-10 15:03:51,836 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1353#true} {1353#true} #112#return; {1353#true} is VALID [2020-07-10 15:03:51,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {1353#true} call ULTIMATE.init(); {1353#true} is VALID [2020-07-10 15:03:51,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {1353#true} assume true; {1353#true} is VALID [2020-07-10 15:03:51,837 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1353#true} {1353#true} #112#return; {1353#true} is VALID [2020-07-10 15:03:51,837 INFO L263 TraceCheckUtils]: 3: Hoare triple {1353#true} call #t~ret6 := main(); {1353#true} is VALID [2020-07-10 15:03:51,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {1353#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {1353#true} is VALID [2020-07-10 15:03:51,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {1353#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1353#true} is VALID [2020-07-10 15:03:51,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {1353#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1353#true} is VALID [2020-07-10 15:03:51,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {1353#true} assume !(0 != ~p1~0); {1353#true} is VALID [2020-07-10 15:03:51,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {1353#true} assume 0 != ~p2~0;~lk2~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:51,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:51,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:51,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:51,842 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:51,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1354#false} is VALID [2020-07-10 15:03:51,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {1354#false} assume 0 != ~p3~0; {1354#false} is VALID [2020-07-10 15:03:51,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {1354#false} assume 1 != ~lk3~0; {1354#false} is VALID [2020-07-10 15:03:51,843 INFO L280 TraceCheckUtils]: 16: Hoare triple {1354#false} assume !false; {1354#false} is VALID [2020-07-10 15:03:51,844 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-10 15:03:51,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466167276] [2020-07-10 15:03:51,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:51,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:51,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45885274] [2020-07-10 15:03:51,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:51,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:51,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:51,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:51,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:51,864 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2020-07-10 15:03:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,956 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2020-07-10 15:03:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:51,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:03:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:03:51,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-10 15:03:52,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,059 INFO L225 Difference]: With dead ends: 111 [2020-07-10 15:03:52,059 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 15:03:52,060 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-10 15:03:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 15:03:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-10 15:03:52,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:52,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:52,076 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:52,076 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,080 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2020-07-10 15:03:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2020-07-10 15:03:52,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,081 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-10 15:03:52,081 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-10 15:03:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,085 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2020-07-10 15:03:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2020-07-10 15:03:52,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:52,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 15:03:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2020-07-10 15:03:52,090 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2020-07-10 15:03:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:52,091 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2020-07-10 15:03:52,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2020-07-10 15:03:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:52,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:52,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:52,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:03:52,092 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:52,092 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2020-07-10 15:03:52,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:52,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114104469] [2020-07-10 15:03:52,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {1727#true} assume true; {1727#true} is VALID [2020-07-10 15:03:52,132 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1727#true} {1727#true} #112#return; {1727#true} is VALID [2020-07-10 15:03:52,133 INFO L263 TraceCheckUtils]: 0: Hoare triple {1727#true} call ULTIMATE.init(); {1727#true} is VALID [2020-07-10 15:03:52,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {1727#true} assume true; {1727#true} is VALID [2020-07-10 15:03:52,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1727#true} {1727#true} #112#return; {1727#true} is VALID [2020-07-10 15:03:52,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {1727#true} call #t~ret6 := main(); {1727#true} is VALID [2020-07-10 15:03:52,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {1727#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {1727#true} is VALID [2020-07-10 15:03:52,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {1727#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1727#true} is VALID [2020-07-10 15:03:52,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {1727#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1727#true} is VALID [2020-07-10 15:03:52,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {1727#true} assume !(0 != ~p1~0); {1727#true} is VALID [2020-07-10 15:03:52,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {1727#true} assume !(0 != ~p2~0); {1727#true} is VALID [2020-07-10 15:03:52,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {1727#true} assume 0 != ~p3~0;~lk3~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {1731#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {1731#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:52,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {1731#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {1728#false} is VALID [2020-07-10 15:03:52,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#false} assume !false; {1728#false} is VALID [2020-07-10 15:03:52,157 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-10 15:03:52,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114104469] [2020-07-10 15:03:52,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:52,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:52,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724573440] [2020-07-10 15:03:52,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:52,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:52,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:52,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:52,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:52,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:52,177 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2020-07-10 15:03:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,288 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2020-07-10 15:03:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:52,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-10 15:03:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-10 15:03:52,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2020-07-10 15:03:52,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,353 INFO L225 Difference]: With dead ends: 132 [2020-07-10 15:03:52,353 INFO L226 Difference]: Without dead ends: 130 [2020-07-10 15:03:52,354 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-10 15:03:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-10 15:03:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2020-07-10 15:03:52,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:52,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 104 states. [2020-07-10 15:03:52,372 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 104 states. [2020-07-10 15:03:52,373 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 104 states. [2020-07-10 15:03:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,379 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2020-07-10 15:03:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2020-07-10 15:03:52,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,380 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 130 states. [2020-07-10 15:03:52,380 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 130 states. [2020-07-10 15:03:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,386 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2020-07-10 15:03:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2020-07-10 15:03:52,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:52,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-10 15:03:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2020-07-10 15:03:52,392 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2020-07-10 15:03:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:52,392 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2020-07-10 15:03:52,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2020-07-10 15:03:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:52,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:52,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:52,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:03:52,394 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2020-07-10 15:03:52,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:52,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025937492] [2020-07-10 15:03:52,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 15:03:52,426 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2256#true} {2256#true} #112#return; {2256#true} is VALID [2020-07-10 15:03:52,426 INFO L263 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2020-07-10 15:03:52,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 15:03:52,427 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2256#true} {2256#true} #112#return; {2256#true} is VALID [2020-07-10 15:03:52,427 INFO L263 TraceCheckUtils]: 3: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2020-07-10 15:03:52,427 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {2256#true} is VALID [2020-07-10 15:03:52,428 INFO L280 TraceCheckUtils]: 5: Hoare triple {2256#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2020-07-10 15:03:52,428 INFO L280 TraceCheckUtils]: 6: Hoare triple {2256#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2256#true} is VALID [2020-07-10 15:03:52,428 INFO L280 TraceCheckUtils]: 7: Hoare triple {2256#true} assume !(0 != ~p1~0); {2256#true} is VALID [2020-07-10 15:03:52,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 != ~p2~0); {2256#true} is VALID [2020-07-10 15:03:52,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {2256#true} assume !(0 != ~p3~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:52,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2260#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:52,431 INFO L280 TraceCheckUtils]: 11: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2260#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:52,431 INFO L280 TraceCheckUtils]: 12: Hoare triple {2260#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:52,432 INFO L280 TraceCheckUtils]: 13: Hoare triple {2260#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:52,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2257#false} is VALID [2020-07-10 15:03:52,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#false} assume 1 != ~lk3~0; {2257#false} is VALID [2020-07-10 15:03:52,433 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2020-07-10 15:03:52,434 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-10 15:03:52,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025937492] [2020-07-10 15:03:52,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:52,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:52,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474897107] [2020-07-10 15:03:52,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:52,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:52,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:52,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:52,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:52,473 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2020-07-10 15:03:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,587 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2020-07-10 15:03:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:52,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-10 15:03:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-10 15:03:52,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2020-07-10 15:03:52,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,684 INFO L225 Difference]: With dead ends: 232 [2020-07-10 15:03:52,685 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 15:03:52,686 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-10 15:03:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 15:03:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-10 15:03:52,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:52,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:52,716 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:52,716 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,722 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2020-07-10 15:03:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2020-07-10 15:03:52,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,723 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:52,723 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,728 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2020-07-10 15:03:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2020-07-10 15:03:52,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:52,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-10 15:03:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2020-07-10 15:03:52,734 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2020-07-10 15:03:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:52,734 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2020-07-10 15:03:52,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2020-07-10 15:03:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:52,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:52,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:52,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:03:52,736 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2020-07-10 15:03:52,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:52,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165106698] [2020-07-10 15:03:52,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:52,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {2941#true} assume true; {2941#true} is VALID [2020-07-10 15:03:52,763 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2941#true} {2941#true} #112#return; {2941#true} is VALID [2020-07-10 15:03:52,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {2941#true} call ULTIMATE.init(); {2941#true} is VALID [2020-07-10 15:03:52,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {2941#true} assume true; {2941#true} is VALID [2020-07-10 15:03:52,764 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2941#true} {2941#true} #112#return; {2941#true} is VALID [2020-07-10 15:03:52,764 INFO L263 TraceCheckUtils]: 3: Hoare triple {2941#true} call #t~ret6 := main(); {2941#true} is VALID [2020-07-10 15:03:52,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {2941#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {2941#true} is VALID [2020-07-10 15:03:52,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {2941#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2941#true} is VALID [2020-07-10 15:03:52,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {2941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2941#true} is VALID [2020-07-10 15:03:52,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {2941#true} assume !(0 != ~p1~0); {2941#true} is VALID [2020-07-10 15:03:52,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {2941#true} assume !(0 != ~p2~0); {2941#true} is VALID [2020-07-10 15:03:52,766 INFO L280 TraceCheckUtils]: 9: Hoare triple {2941#true} assume 0 != ~p3~0;~lk3~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:52,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {2945#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:52,767 INFO L280 TraceCheckUtils]: 11: Hoare triple {2945#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:52,767 INFO L280 TraceCheckUtils]: 12: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:52,768 INFO L280 TraceCheckUtils]: 13: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:52,769 INFO L280 TraceCheckUtils]: 14: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {2942#false} is VALID [2020-07-10 15:03:52,769 INFO L280 TraceCheckUtils]: 15: Hoare triple {2942#false} assume 0 != ~p4~0; {2942#false} is VALID [2020-07-10 15:03:52,769 INFO L280 TraceCheckUtils]: 16: Hoare triple {2942#false} assume 1 != ~lk4~0; {2942#false} is VALID [2020-07-10 15:03:52,769 INFO L280 TraceCheckUtils]: 17: Hoare triple {2942#false} assume !false; {2942#false} is VALID [2020-07-10 15:03:52,770 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-10 15:03:52,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165106698] [2020-07-10 15:03:52,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:52,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:52,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119935755] [2020-07-10 15:03:52,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:52,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:52,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:52,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:52,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:52,790 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2020-07-10 15:03:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,901 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2020-07-10 15:03:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:52,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:03:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:03:52,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-10 15:03:52,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:52,999 INFO L225 Difference]: With dead ends: 204 [2020-07-10 15:03:52,999 INFO L226 Difference]: Without dead ends: 142 [2020-07-10 15:03:53,000 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-10 15:03:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-10 15:03:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2020-07-10 15:03:53,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:53,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2020-07-10 15:03:53,028 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2020-07-10 15:03:53,028 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2020-07-10 15:03:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,034 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2020-07-10 15:03:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2020-07-10 15:03:53,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,035 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2020-07-10 15:03:53,035 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2020-07-10 15:03:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,039 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2020-07-10 15:03:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2020-07-10 15:03:53,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:53,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-10 15:03:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2020-07-10 15:03:53,043 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2020-07-10 15:03:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:53,044 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2020-07-10 15:03:53,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2020-07-10 15:03:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:53,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:53,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:53,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:03:53,045 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2020-07-10 15:03:53,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:53,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326045363] [2020-07-10 15:03:53,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {3610#true} assume true; {3610#true} is VALID [2020-07-10 15:03:53,097 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3610#true} {3610#true} #112#return; {3610#true} is VALID [2020-07-10 15:03:53,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2020-07-10 15:03:53,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {3610#true} assume true; {3610#true} is VALID [2020-07-10 15:03:53,097 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3610#true} {3610#true} #112#return; {3610#true} is VALID [2020-07-10 15:03:53,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {3610#true} call #t~ret6 := main(); {3610#true} is VALID [2020-07-10 15:03:53,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {3610#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {3610#true} is VALID [2020-07-10 15:03:53,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {3610#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {3610#true} is VALID [2020-07-10 15:03:53,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {3610#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3610#true} is VALID [2020-07-10 15:03:53,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {3610#true} assume !(0 != ~p1~0); {3610#true} is VALID [2020-07-10 15:03:53,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {3610#true} assume !(0 != ~p2~0); {3610#true} is VALID [2020-07-10 15:03:53,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {3610#true} assume !(0 != ~p3~0); {3610#true} is VALID [2020-07-10 15:03:53,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {3610#true} assume 0 != ~p4~0;~lk4~0 := 1; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {3614#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,102 INFO L280 TraceCheckUtils]: 14: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {3614#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:53,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {3614#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {3611#false} is VALID [2020-07-10 15:03:53,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2020-07-10 15:03:53,104 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-10 15:03:53,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326045363] [2020-07-10 15:03:53,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:53,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:53,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266697988] [2020-07-10 15:03:53,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:53,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:53,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:53,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:53,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:53,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:53,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:53,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:53,123 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2020-07-10 15:03:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,257 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2020-07-10 15:03:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:53,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-10 15:03:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-10 15:03:53,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-10 15:03:53,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:53,333 INFO L225 Difference]: With dead ends: 236 [2020-07-10 15:03:53,333 INFO L226 Difference]: Without dead ends: 234 [2020-07-10 15:03:53,334 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-10 15:03:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-10 15:03:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2020-07-10 15:03:53,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:53,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 200 states. [2020-07-10 15:03:53,368 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 200 states. [2020-07-10 15:03:53,368 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 200 states. [2020-07-10 15:03:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,383 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2020-07-10 15:03:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2020-07-10 15:03:53,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,384 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 234 states. [2020-07-10 15:03:53,384 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 234 states. [2020-07-10 15:03:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,392 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2020-07-10 15:03:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2020-07-10 15:03:53,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:53,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-10 15:03:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2020-07-10 15:03:53,397 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2020-07-10 15:03:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:53,398 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2020-07-10 15:03:53,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2020-07-10 15:03:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:53,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:53,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:53,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:03:53,399 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2020-07-10 15:03:53,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:53,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103214094] [2020-07-10 15:03:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {4559#true} assume true; {4559#true} is VALID [2020-07-10 15:03:53,464 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4559#true} {4559#true} #112#return; {4559#true} is VALID [2020-07-10 15:03:53,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {4559#true} call ULTIMATE.init(); {4559#true} is VALID [2020-07-10 15:03:53,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {4559#true} assume true; {4559#true} is VALID [2020-07-10 15:03:53,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4559#true} {4559#true} #112#return; {4559#true} is VALID [2020-07-10 15:03:53,465 INFO L263 TraceCheckUtils]: 3: Hoare triple {4559#true} call #t~ret6 := main(); {4559#true} is VALID [2020-07-10 15:03:53,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {4559#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {4559#true} is VALID [2020-07-10 15:03:53,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {4559#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {4559#true} is VALID [2020-07-10 15:03:53,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {4559#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4559#true} is VALID [2020-07-10 15:03:53,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {4559#true} assume !(0 != ~p1~0); {4559#true} is VALID [2020-07-10 15:03:53,466 INFO L280 TraceCheckUtils]: 8: Hoare triple {4559#true} assume !(0 != ~p2~0); {4559#true} is VALID [2020-07-10 15:03:53,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {4559#true} assume !(0 != ~p3~0); {4559#true} is VALID [2020-07-10 15:03:53,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {4559#true} assume !(0 != ~p4~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:53,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {4563#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4563#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:53,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:53,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:53,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:53,480 INFO L280 TraceCheckUtils]: 15: Hoare triple {4563#(= 0 main_~p4~0)} assume 0 != ~p4~0; {4560#false} is VALID [2020-07-10 15:03:53,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {4560#false} assume 1 != ~lk4~0; {4560#false} is VALID [2020-07-10 15:03:53,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {4560#false} assume !false; {4560#false} is VALID [2020-07-10 15:03:53,481 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-10 15:03:53,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103214094] [2020-07-10 15:03:53,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:53,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:53,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131690871] [2020-07-10 15:03:53,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:53,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:53,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:53,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:53,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:53,503 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2020-07-10 15:03:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,639 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2020-07-10 15:03:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:53,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-10 15:03:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-10 15:03:53,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2020-07-10 15:03:53,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:53,741 INFO L225 Difference]: With dead ends: 444 [2020-07-10 15:03:53,742 INFO L226 Difference]: Without dead ends: 258 [2020-07-10 15:03:53,743 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-10 15:03:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-10 15:03:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-10 15:03:53,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:53,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:53,812 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:53,812 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,824 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2020-07-10 15:03:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2020-07-10 15:03:53,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,826 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2020-07-10 15:03:53,826 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2020-07-10 15:03:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:53,834 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2020-07-10 15:03:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2020-07-10 15:03:53,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:53,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:53,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:53,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-10 15:03:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2020-07-10 15:03:53,842 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2020-07-10 15:03:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:53,842 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2020-07-10 15:03:53,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2020-07-10 15:03:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:53,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:53,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:53,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:03:53,844 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2020-07-10 15:03:53,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:53,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200196813] [2020-07-10 15:03:53,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {5836#true} assume true; {5836#true} is VALID [2020-07-10 15:03:53,893 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5836#true} {5836#true} #112#return; {5836#true} is VALID [2020-07-10 15:03:53,893 INFO L263 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2020-07-10 15:03:53,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {5836#true} assume true; {5836#true} is VALID [2020-07-10 15:03:53,894 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5836#true} {5836#true} #112#return; {5836#true} is VALID [2020-07-10 15:03:53,894 INFO L263 TraceCheckUtils]: 3: Hoare triple {5836#true} call #t~ret6 := main(); {5836#true} is VALID [2020-07-10 15:03:53,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {5836#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {5836#true} is VALID [2020-07-10 15:03:53,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {5836#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {5836#true} is VALID [2020-07-10 15:03:53,895 INFO L280 TraceCheckUtils]: 6: Hoare triple {5836#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {5836#true} is VALID [2020-07-10 15:03:53,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {5836#true} assume !(0 != ~p1~0); {5836#true} is VALID [2020-07-10 15:03:53,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {5836#true} assume !(0 != ~p2~0); {5836#true} is VALID [2020-07-10 15:03:53,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {5836#true} assume !(0 != ~p3~0); {5836#true} is VALID [2020-07-10 15:03:53,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {5836#true} assume 0 != ~p4~0;~lk4~0 := 1; {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:53,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {5840#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:53,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:53,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:53,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:53,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {5837#false} is VALID [2020-07-10 15:03:53,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {5837#false} assume 0 != ~p5~0; {5837#false} is VALID [2020-07-10 15:03:53,900 INFO L280 TraceCheckUtils]: 17: Hoare triple {5837#false} assume 1 != ~lk5~0; {5837#false} is VALID [2020-07-10 15:03:53,900 INFO L280 TraceCheckUtils]: 18: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2020-07-10 15:03:53,901 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-10 15:03:53,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200196813] [2020-07-10 15:03:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:53,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:53,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086771382] [2020-07-10 15:03:53,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:53,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:53,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:53,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:53,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:53,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:53,921 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2020-07-10 15:03:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,046 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2020-07-10 15:03:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:54,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:03:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:03:54,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-10 15:03:54,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:54,132 INFO L225 Difference]: With dead ends: 384 [2020-07-10 15:03:54,132 INFO L226 Difference]: Without dead ends: 266 [2020-07-10 15:03:54,133 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-10 15:03:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-07-10 15:03:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2020-07-10 15:03:54,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:54,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 264 states. [2020-07-10 15:03:54,201 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 264 states. [2020-07-10 15:03:54,201 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 264 states. [2020-07-10 15:03:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,208 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2020-07-10 15:03:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2020-07-10 15:03:54,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:54,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:54,210 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 266 states. [2020-07-10 15:03:54,210 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 266 states. [2020-07-10 15:03:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,217 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2020-07-10 15:03:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2020-07-10 15:03:54,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:54,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:54,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:54,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-07-10 15:03:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2020-07-10 15:03:54,226 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2020-07-10 15:03:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:54,227 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2020-07-10 15:03:54,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2020-07-10 15:03:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:54,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:54,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] [2020-07-10 15:03:54,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:03:54,228 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2020-07-10 15:03:54,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:54,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656305944] [2020-07-10 15:03:54,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:54,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {7077#true} assume true; {7077#true} is VALID [2020-07-10 15:03:54,260 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7077#true} {7077#true} #112#return; {7077#true} is VALID [2020-07-10 15:03:54,260 INFO L263 TraceCheckUtils]: 0: Hoare triple {7077#true} call ULTIMATE.init(); {7077#true} is VALID [2020-07-10 15:03:54,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {7077#true} assume true; {7077#true} is VALID [2020-07-10 15:03:54,261 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7077#true} {7077#true} #112#return; {7077#true} is VALID [2020-07-10 15:03:54,261 INFO L263 TraceCheckUtils]: 3: Hoare triple {7077#true} call #t~ret6 := main(); {7077#true} is VALID [2020-07-10 15:03:54,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {7077#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {7077#true} is VALID [2020-07-10 15:03:54,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {7077#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {7077#true} is VALID [2020-07-10 15:03:54,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {7077#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {7077#true} is VALID [2020-07-10 15:03:54,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {7077#true} assume !(0 != ~p1~0); {7077#true} is VALID [2020-07-10 15:03:54,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {7077#true} assume !(0 != ~p2~0); {7077#true} is VALID [2020-07-10 15:03:54,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {7077#true} assume !(0 != ~p3~0); {7077#true} is VALID [2020-07-10 15:03:54,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {7077#true} assume !(0 != ~p4~0); {7077#true} is VALID [2020-07-10 15:03:54,264 INFO L280 TraceCheckUtils]: 11: Hoare triple {7077#true} assume 0 != ~p5~0;~lk5~0 := 1; {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,267 INFO L280 TraceCheckUtils]: 16: Hoare triple {7081#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {7081#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:54,268 INFO L280 TraceCheckUtils]: 17: Hoare triple {7081#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {7078#false} is VALID [2020-07-10 15:03:54,268 INFO L280 TraceCheckUtils]: 18: Hoare triple {7078#false} assume !false; {7078#false} is VALID [2020-07-10 15:03:54,269 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-10 15:03:54,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656305944] [2020-07-10 15:03:54,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:54,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:54,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174334528] [2020-07-10 15:03:54,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:54,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:54,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:54,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:54,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:54,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:54,293 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2020-07-10 15:03:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,488 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2020-07-10 15:03:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:54,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2020-07-10 15:03:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2020-07-10 15:03:54,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2020-07-10 15:03:54,542 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-10 15:03:54,558 INFO L225 Difference]: With dead ends: 426 [2020-07-10 15:03:54,559 INFO L226 Difference]: Without dead ends: 424 [2020-07-10 15:03:54,559 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-10 15:03:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-07-10 15:03:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2020-07-10 15:03:54,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:54,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand 392 states. [2020-07-10 15:03:54,630 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 392 states. [2020-07-10 15:03:54,630 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 392 states. [2020-07-10 15:03:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,644 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2020-07-10 15:03:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2020-07-10 15:03:54,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:54,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:54,646 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 424 states. [2020-07-10 15:03:54,646 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 424 states. [2020-07-10 15:03:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,660 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2020-07-10 15:03:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2020-07-10 15:03:54,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:54,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:54,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:54,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-07-10 15:03:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2020-07-10 15:03:54,674 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2020-07-10 15:03:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:54,674 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2020-07-10 15:03:54,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2020-07-10 15:03:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:54,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:54,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:54,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:03:54,676 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2020-07-10 15:03:54,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:54,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317209435] [2020-07-10 15:03:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:54,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {8811#true} assume true; {8811#true} is VALID [2020-07-10 15:03:54,698 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8811#true} {8811#true} #112#return; {8811#true} is VALID [2020-07-10 15:03:54,699 INFO L263 TraceCheckUtils]: 0: Hoare triple {8811#true} call ULTIMATE.init(); {8811#true} is VALID [2020-07-10 15:03:54,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {8811#true} assume true; {8811#true} is VALID [2020-07-10 15:03:54,699 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8811#true} {8811#true} #112#return; {8811#true} is VALID [2020-07-10 15:03:54,699 INFO L263 TraceCheckUtils]: 3: Hoare triple {8811#true} call #t~ret6 := main(); {8811#true} is VALID [2020-07-10 15:03:54,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {8811#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {8811#true} is VALID [2020-07-10 15:03:54,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {8811#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {8811#true} is VALID [2020-07-10 15:03:54,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {8811#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8811#true} is VALID [2020-07-10 15:03:54,700 INFO L280 TraceCheckUtils]: 7: Hoare triple {8811#true} assume !(0 != ~p1~0); {8811#true} is VALID [2020-07-10 15:03:54,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {8811#true} assume !(0 != ~p2~0); {8811#true} is VALID [2020-07-10 15:03:54,701 INFO L280 TraceCheckUtils]: 9: Hoare triple {8811#true} assume !(0 != ~p3~0); {8811#true} is VALID [2020-07-10 15:03:54,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {8811#true} assume !(0 != ~p4~0); {8811#true} is VALID [2020-07-10 15:03:54,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {8811#true} assume !(0 != ~p5~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:54,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:54,703 INFO L280 TraceCheckUtils]: 13: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:54,703 INFO L280 TraceCheckUtils]: 14: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:54,704 INFO L280 TraceCheckUtils]: 15: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:54,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {8815#(= 0 main_~p5~0)} assume 0 != ~p5~0; {8812#false} is VALID [2020-07-10 15:03:54,705 INFO L280 TraceCheckUtils]: 17: Hoare triple {8812#false} assume 1 != ~lk5~0; {8812#false} is VALID [2020-07-10 15:03:54,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {8812#false} assume !false; {8812#false} is VALID [2020-07-10 15:03:54,706 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-10 15:03:54,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317209435] [2020-07-10 15:03:54,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:54,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:54,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575634247] [2020-07-10 15:03:54,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:54,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:54,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:54,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:54,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:54,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:54,725 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2020-07-10 15:03:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,957 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2020-07-10 15:03:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:54,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:03:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:03:54,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-10 15:03:55,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:55,035 INFO L225 Difference]: With dead ends: 856 [2020-07-10 15:03:55,035 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:03:55,037 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-10 15:03:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:03:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:03:55,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:55,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:55,038 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:55,038 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:55,038 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:55,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:55,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:55,039 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:55,039 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:55,040 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:55,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:55,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:55,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:55,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:03:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:03:55,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-10 15:03:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:55,041 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:03:55,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:55,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:55,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:03:55,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:03:55,080 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:03:55,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:55,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:55,081 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:03:55,081 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:03:55,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:03:55,081 INFO L268 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2020-07-10 15:03:55,081 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-10 15:03:55,081 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,082 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L268 CegarLoopResult]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,083 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-10 15:03:55,084 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-10 15:03:55,084 INFO L268 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2020-07-10 15:03:55,084 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-10 15:03:55,084 INFO L268 CegarLoopResult]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2020-07-10 15:03:55,089 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:55,089 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:55,089 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:55,089 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:03:55,090 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:55,091 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:03:55,092 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:03:55,093 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:03:55,094 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-10 15:03:55,094 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-10 15:03:55,094 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:03:55,094 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:03:55,094 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:03:55,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:03:55 BoogieIcfgContainer [2020-07-10 15:03:55,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:03:55,106 INFO L168 Benchmark]: Toolchain (without parser) took 6397.63 ms. Allocated memory was 135.3 MB in the beginning and 303.6 MB in the end (delta: 168.3 MB). Free memory was 100.0 MB in the beginning and 134.6 MB in the end (delta: -34.7 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,107 INFO L168 Benchmark]: CDTParser took 1.58 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.74 ms. Allocated memory is still 135.3 MB. Free memory was 99.8 MB in the beginning and 89.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,108 INFO L168 Benchmark]: Boogie Preprocessor took 111.58 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.6 MB in the beginning and 177.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,109 INFO L168 Benchmark]: RCFGBuilder took 379.19 ms. Allocated memory is still 199.2 MB. Free memory was 177.3 MB in the beginning and 155.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,109 INFO L168 Benchmark]: TraceAbstraction took 5609.58 ms. Allocated memory was 199.2 MB in the beginning and 303.6 MB in the end (delta: 104.3 MB). Free memory was 155.8 MB in the beginning and 134.6 MB in the end (delta: 21.1 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:55,112 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.58 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.74 ms. Allocated memory is still 135.3 MB. Free memory was 99.8 MB in the beginning and 89.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.58 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.6 MB in the beginning and 177.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 379.19 ms. Allocated memory is still 199.2 MB. Free memory was 177.3 MB in the beginning and 155.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5609.58 ms. Allocated memory was 199.2 MB in the beginning and 303.6 MB in the end (delta: 104.3 MB). Free memory was 155.8 MB in the beginning and 134.6 MB in the end (delta: 21.1 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...