/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:04:04,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:04:04,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:04:04,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:04:04,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:04:04,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:04:04,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:04:04,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:04:04,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:04:04,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:04:04,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:04:04,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:04:04,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:04:04,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:04:04,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:04:04,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:04:04,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:04:04,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:04:04,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:04:04,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:04:04,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:04:04,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:04:04,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:04:04,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:04:04,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:04:04,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:04:04,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:04:04,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:04:04,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:04:04,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:04:04,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:04:04,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:04:04,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:04:04,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:04:04,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:04:04,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:04:04,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:04:04,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:04:04,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:04:04,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:04:04,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:04:04,759 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:04:04,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:04:04,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:04:04,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:04:04,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:04:04,799 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:04:04,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:04:04,799 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:04:04,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:04:04,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:04:04,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:04:04,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:04:04,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:04:04,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:04:04,800 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:04:04,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:04:04,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:04:04,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:04:04,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:04:04,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:04:04,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:04:04,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:04:04,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:04:04,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:04:04,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:04:04,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:04:04,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:04:04,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:04:04,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:04:04,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:04:04,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:04:05,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:04:05,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:04:05,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:04:05,086 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:04:05,087 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:04:05,088 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-10 15:04:05,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63e05652/e51d66e01de44bbda5e0864fb840469c/FLAG6a5ca5d2b [2020-07-10 15:04:05,646 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:04:05,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-10 15:04:05,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63e05652/e51d66e01de44bbda5e0864fb840469c/FLAG6a5ca5d2b [2020-07-10 15:04:05,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63e05652/e51d66e01de44bbda5e0864fb840469c [2020-07-10 15:04:05,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:04:05,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:04:05,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:05,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:04:06,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:04:06,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:05" (1/1) ... [2020-07-10 15:04:06,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d47265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06, skipping insertion in model container [2020-07-10 15:04:06,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:05" (1/1) ... [2020-07-10 15:04:06,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:04:06,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:04:06,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:06,358 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:04:06,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:06,402 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:04:06,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06 WrapperNode [2020-07-10 15:04:06,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:06,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:04:06,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:04:06,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:04:06,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (1/1) ... [2020-07-10 15:04:06,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:04:06,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:04:06,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:04:06,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:04:06,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (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:04:06,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:04:06,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:04:06,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:04:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:04:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:04:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:04:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:04:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:04:07,124 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:04:07,124 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:04:07,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:07 BoogieIcfgContainer [2020-07-10 15:04:07,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:04:07,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:04:07,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:04:07,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:04:07,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:04:05" (1/3) ... [2020-07-10 15:04:07,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a4a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:07, skipping insertion in model container [2020-07-10 15:04:07,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:06" (2/3) ... [2020-07-10 15:04:07,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a4a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:07, skipping insertion in model container [2020-07-10 15:04:07,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:07" (3/3) ... [2020-07-10 15:04:07,136 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-10 15:04:07,145 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:04:07,153 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:04:07,167 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:04:07,190 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:04:07,190 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:04:07,191 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:04:07,191 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:04:07,191 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:04:07,191 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:04:07,192 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:04:07,192 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:04:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-10 15:04:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:04:07,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:07,220 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:04:07,221 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:07,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2020-07-10 15:04:07,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:07,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035040087] [2020-07-10 15:04:07,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:07,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:04:07,483 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-10 15:04:07,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-10 15:04:07,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:04:07,487 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-10 15:04:07,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret9 := main(); {41#true} is VALID [2020-07-10 15:04:07,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {41#true} is VALID [2020-07-10 15:04:07,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {41#true} is VALID [2020-07-10 15:04:07,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {41#true} is VALID [2020-07-10 15:04:07,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} assume 0 != ~p1~0;~lk1~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,499 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,501 INFO L280 TraceCheckUtils]: 12: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,503 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {45#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:04:07,509 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {42#false} is VALID [2020-07-10 15:04:07,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-10 15:04:07,513 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:04:07,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035040087] [2020-07-10 15:04:07,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:07,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41246520] [2020-07-10 15:04:07,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:04:07,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:07,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:07,569 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:04:07,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:07,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:07,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:07,582 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-10 15:04:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:07,769 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2020-07-10 15:04:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:07,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:04:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:04:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:04:07,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-10 15:04:07,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:08,009 INFO L225 Difference]: With dead ends: 75 [2020-07-10 15:04:08,009 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:04:08,013 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:04:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:04:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-10 15:04:08,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:08,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-10 15:04:08,059 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-10 15:04:08,059 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-10 15:04:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,068 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-10 15:04:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-10 15:04:08,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,069 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-10 15:04:08,070 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-10 15:04:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,077 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-10 15:04:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-10 15:04:08,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:08,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:04:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-07-10 15:04:08,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2020-07-10 15:04:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:08,086 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-07-10 15:04:08,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-07-10 15:04:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:04:08,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:08,087 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:04:08,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:04:08,088 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2020-07-10 15:04:08,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:08,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857418657] [2020-07-10 15:04:08,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:08,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-10 15:04:08,153 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-10 15:04:08,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2020-07-10 15:04:08,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-10 15:04:08,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-10 15:04:08,154 INFO L263 TraceCheckUtils]: 3: Hoare triple {303#true} call #t~ret9 := main(); {303#true} is VALID [2020-07-10 15:04:08,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {303#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {303#true} is VALID [2020-07-10 15:04:08,155 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {303#true} is VALID [2020-07-10 15:04:08,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {303#true} is VALID [2020-07-10 15:04:08,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#true} assume !(0 != ~p1~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,161 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,162 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {307#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-10 15:04:08,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p1~0; {304#false} is VALID [2020-07-10 15:04:08,164 INFO L280 TraceCheckUtils]: 16: Hoare triple {304#false} assume 1 != ~lk1~0; {304#false} is VALID [2020-07-10 15:04:08,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {304#false} assume !false; {304#false} is VALID [2020-07-10 15:04:08,166 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:04:08,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857418657] [2020-07-10 15:04:08,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:08,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:08,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817927867] [2020-07-10 15:04:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:04:08,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:08,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:08,195 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:04:08,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:08,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:08,196 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2020-07-10 15:04:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,320 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-07-10 15:04:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:08,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:04:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 15:04:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 15:04:08,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-10 15:04:08,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:08,517 INFO L225 Difference]: With dead ends: 97 [2020-07-10 15:04:08,517 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:04:08,518 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:04:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:04:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-07-10 15:04:08,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:08,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2020-07-10 15:04:08,530 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2020-07-10 15:04:08,530 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2020-07-10 15:04:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,534 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-10 15:04:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-10 15:04:08,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,536 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2020-07-10 15:04:08,536 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2020-07-10 15:04:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,540 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-10 15:04:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-10 15:04:08,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:08,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:04:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2020-07-10 15:04:08,546 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2020-07-10 15:04:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:08,546 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2020-07-10 15:04:08,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2020-07-10 15:04:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:04:08,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:08,548 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:04:08,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:04:08,548 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:08,549 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2020-07-10 15:04:08,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:08,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103374531] [2020-07-10 15:04:08,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:08,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 15:04:08,608 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-10 15:04:08,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2020-07-10 15:04:08,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 15:04:08,609 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-10 15:04:08,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {602#true} call #t~ret9 := main(); {602#true} is VALID [2020-07-10 15:04:08,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {602#true} is VALID [2020-07-10 15:04:08,610 INFO L280 TraceCheckUtils]: 5: Hoare triple {602#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {602#true} is VALID [2020-07-10 15:04:08,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {602#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {602#true} is VALID [2020-07-10 15:04:08,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {602#true} assume 0 != ~p1~0;~lk1~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {606#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:04:08,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {603#false} is VALID [2020-07-10 15:04:08,621 INFO L280 TraceCheckUtils]: 16: Hoare triple {603#false} assume 0 != ~p2~0; {603#false} is VALID [2020-07-10 15:04:08,621 INFO L280 TraceCheckUtils]: 17: Hoare triple {603#false} assume 1 != ~lk2~0; {603#false} is VALID [2020-07-10 15:04:08,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {603#false} assume !false; {603#false} is VALID [2020-07-10 15:04:08,622 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:04:08,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103374531] [2020-07-10 15:04:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:08,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478050469] [2020-07-10 15:04:08,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:08,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:08,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:08,649 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:04:08,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:08,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:08,651 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2020-07-10 15:04:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,782 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2020-07-10 15:04:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:08,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:04:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:04:08,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-10 15:04:08,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:08,977 INFO L225 Difference]: With dead ends: 90 [2020-07-10 15:04:08,977 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 15:04:08,978 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:04:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 15:04:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-10 15:04:08,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:08,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-10 15:04:08,990 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-10 15:04:08,991 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-10 15:04:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,994 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-10 15:04:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-10 15:04:08,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,996 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-10 15:04:08,996 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-10 15:04:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,000 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-10 15:04:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-10 15:04:09,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:09,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 15:04:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2020-07-10 15:04:09,005 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2020-07-10 15:04:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:09,006 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2020-07-10 15:04:09,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2020-07-10 15:04:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:04:09,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:09,007 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:04:09,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:04:09,007 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2020-07-10 15:04:09,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645317034] [2020-07-10 15:04:09,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-10 15:04:09,060 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-10 15:04:09,060 INFO L263 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2020-07-10 15:04:09,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-10 15:04:09,061 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-10 15:04:09,061 INFO L263 TraceCheckUtils]: 3: Hoare triple {905#true} call #t~ret9 := main(); {905#true} is VALID [2020-07-10 15:04:09,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {905#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {905#true} is VALID [2020-07-10 15:04:09,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {905#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {905#true} is VALID [2020-07-10 15:04:09,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {905#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {905#true} is VALID [2020-07-10 15:04:09,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {905#true} assume !(0 != ~p1~0); {905#true} is VALID [2020-07-10 15:04:09,063 INFO L280 TraceCheckUtils]: 8: Hoare triple {905#true} assume 0 != ~p2~0;~lk2~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,064 INFO L280 TraceCheckUtils]: 9: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,065 INFO L280 TraceCheckUtils]: 10: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,066 INFO L280 TraceCheckUtils]: 11: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,066 INFO L280 TraceCheckUtils]: 12: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,067 INFO L280 TraceCheckUtils]: 13: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,068 INFO L280 TraceCheckUtils]: 14: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,068 INFO L280 TraceCheckUtils]: 15: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {909#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:04:09,070 INFO L280 TraceCheckUtils]: 17: Hoare triple {909#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {906#false} is VALID [2020-07-10 15:04:09,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {906#false} assume !false; {906#false} is VALID [2020-07-10 15:04:09,071 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:04:09,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645317034] [2020-07-10 15:04:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139581820] [2020-07-10 15:04:09,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:09,092 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:04:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:09,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:09,094 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2020-07-10 15:04:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,190 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2020-07-10 15:04:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:09,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:09,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-10 15:04:09,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:09,308 INFO L225 Difference]: With dead ends: 112 [2020-07-10 15:04:09,309 INFO L226 Difference]: Without dead ends: 110 [2020-07-10 15:04:09,309 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:04:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-10 15:04:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2020-07-10 15:04:09,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:09,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 80 states. [2020-07-10 15:04:09,323 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 80 states. [2020-07-10 15:04:09,323 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 80 states. [2020-07-10 15:04:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,329 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-10 15:04:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-10 15:04:09,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,330 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 110 states. [2020-07-10 15:04:09,330 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 110 states. [2020-07-10 15:04:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,336 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-10 15:04:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-10 15:04:09,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:09,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 15:04:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2020-07-10 15:04:09,342 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2020-07-10 15:04:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:09,343 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2020-07-10 15:04:09,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2020-07-10 15:04:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:04:09,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:09,344 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:04:09,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:04:09,344 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2020-07-10 15:04:09,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903524542] [2020-07-10 15:04:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-10 15:04:09,391 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-10 15:04:09,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2020-07-10 15:04:09,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-10 15:04:09,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-10 15:04:09,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {1344#true} call #t~ret9 := main(); {1344#true} is VALID [2020-07-10 15:04:09,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {1344#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1344#true} is VALID [2020-07-10 15:04:09,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {1344#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1344#true} is VALID [2020-07-10 15:04:09,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {1344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1344#true} is VALID [2020-07-10 15:04:09,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {1344#true} assume !(0 != ~p1~0); {1344#true} is VALID [2020-07-10 15:04:09,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {1344#true} assume !(0 != ~p2~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,403 INFO L280 TraceCheckUtils]: 10: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,408 INFO L280 TraceCheckUtils]: 15: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-10 15:04:09,408 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1345#false} is VALID [2020-07-10 15:04:09,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {1345#false} assume 1 != ~lk2~0; {1345#false} is VALID [2020-07-10 15:04:09,409 INFO L280 TraceCheckUtils]: 18: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2020-07-10 15:04:09,410 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:04:09,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903524542] [2020-07-10 15:04:09,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018907265] [2020-07-10 15:04:09,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:09,432 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:04:09,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:09,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:09,433 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2020-07-10 15:04:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,547 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2020-07-10 15:04:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:09,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:04:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-10 15:04:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-10 15:04:09,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2020-07-10 15:04:09,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:09,740 INFO L225 Difference]: With dead ends: 184 [2020-07-10 15:04:09,740 INFO L226 Difference]: Without dead ends: 112 [2020-07-10 15:04:09,741 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:04:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-10 15:04:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-10 15:04:09,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:09,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-10 15:04:09,761 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-10 15:04:09,762 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-10 15:04:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,767 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-10 15:04:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-10 15:04:09,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,768 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-10 15:04:09,769 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-10 15:04:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,775 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-10 15:04:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-10 15:04:09,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:09,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-10 15:04:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2020-07-10 15:04:09,781 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2020-07-10 15:04:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:09,781 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2020-07-10 15:04:09,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2020-07-10 15:04:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:09,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:09,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:09,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:04:09,783 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2020-07-10 15:04:09,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459855761] [2020-07-10 15:04:09,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-10 15:04:09,820 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-10 15:04:09,821 INFO L263 TraceCheckUtils]: 0: Hoare triple {1893#true} call ULTIMATE.init(); {1893#true} is VALID [2020-07-10 15:04:09,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-10 15:04:09,821 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-10 15:04:09,821 INFO L263 TraceCheckUtils]: 3: Hoare triple {1893#true} call #t~ret9 := main(); {1893#true} is VALID [2020-07-10 15:04:09,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {1893#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1893#true} is VALID [2020-07-10 15:04:09,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {1893#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1893#true} is VALID [2020-07-10 15:04:09,822 INFO L280 TraceCheckUtils]: 6: Hoare triple {1893#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1893#true} is VALID [2020-07-10 15:04:09,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {1893#true} assume !(0 != ~p1~0); {1893#true} is VALID [2020-07-10 15:04:09,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {1893#true} assume 0 != ~p2~0;~lk2~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,825 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,826 INFO L280 TraceCheckUtils]: 11: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,826 INFO L280 TraceCheckUtils]: 12: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,828 INFO L280 TraceCheckUtils]: 14: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,828 INFO L280 TraceCheckUtils]: 15: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:04:09,829 INFO L280 TraceCheckUtils]: 16: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1894#false} is VALID [2020-07-10 15:04:09,830 INFO L280 TraceCheckUtils]: 17: Hoare triple {1894#false} assume 0 != ~p3~0; {1894#false} is VALID [2020-07-10 15:04:09,830 INFO L280 TraceCheckUtils]: 18: Hoare triple {1894#false} assume 1 != ~lk3~0; {1894#false} is VALID [2020-07-10 15:04:09,830 INFO L280 TraceCheckUtils]: 19: Hoare triple {1894#false} assume !false; {1894#false} is VALID [2020-07-10 15:04:09,831 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:04:09,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459855761] [2020-07-10 15:04:09,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118550020] [2020-07-10 15:04:09,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:09,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:09,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:09,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:09,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:09,856 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2020-07-10 15:04:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,978 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2020-07-10 15:04:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:09,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 15:04:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 15:04:09,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-10 15:04:10,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,115 INFO L225 Difference]: With dead ends: 165 [2020-07-10 15:04:10,115 INFO L226 Difference]: Without dead ends: 114 [2020-07-10 15:04:10,116 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:04:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-10 15:04:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-07-10 15:04:10,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:10,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2020-07-10 15:04:10,140 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2020-07-10 15:04:10,140 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2020-07-10 15:04:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,145 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-10 15:04:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-10 15:04:10,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,146 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2020-07-10 15:04:10,146 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2020-07-10 15:04:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,151 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-10 15:04:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-10 15:04:10,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:10,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-10 15:04:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2020-07-10 15:04:10,156 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2020-07-10 15:04:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:10,156 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2020-07-10 15:04:10,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2020-07-10 15:04:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:10,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:10,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:10,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:04:10,158 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2020-07-10 15:04:10,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:10,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028019903] [2020-07-10 15:04:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-10 15:04:10,196 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-10 15:04:10,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2020-07-10 15:04:10,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-10 15:04:10,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-10 15:04:10,197 INFO L263 TraceCheckUtils]: 3: Hoare triple {2429#true} call #t~ret9 := main(); {2429#true} is VALID [2020-07-10 15:04:10,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {2429#true} is VALID [2020-07-10 15:04:10,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {2429#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {2429#true} is VALID [2020-07-10 15:04:10,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {2429#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2429#true} is VALID [2020-07-10 15:04:10,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {2429#true} assume !(0 != ~p1~0); {2429#true} is VALID [2020-07-10 15:04:10,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {2429#true} assume !(0 != ~p2~0); {2429#true} is VALID [2020-07-10 15:04:10,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {2429#true} assume 0 != ~p3~0;~lk3~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,202 INFO L280 TraceCheckUtils]: 14: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,203 INFO L280 TraceCheckUtils]: 15: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,203 INFO L280 TraceCheckUtils]: 16: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,204 INFO L280 TraceCheckUtils]: 17: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:04:10,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {2433#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2430#false} is VALID [2020-07-10 15:04:10,205 INFO L280 TraceCheckUtils]: 19: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2020-07-10 15:04:10,206 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:04:10,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028019903] [2020-07-10 15:04:10,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:10,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:10,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073927456] [2020-07-10 15:04:10,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:10,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:10,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:10,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:10,227 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2020-07-10 15:04:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,349 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2020-07-10 15:04:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:10,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:10,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-10 15:04:10,461 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:04:10,465 INFO L225 Difference]: With dead ends: 204 [2020-07-10 15:04:10,465 INFO L226 Difference]: Without dead ends: 202 [2020-07-10 15:04:10,466 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:04:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-10 15:04:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2020-07-10 15:04:10,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:10,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 152 states. [2020-07-10 15:04:10,484 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 152 states. [2020-07-10 15:04:10,484 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 152 states. [2020-07-10 15:04:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,492 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-10 15:04:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-10 15:04:10,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,493 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 202 states. [2020-07-10 15:04:10,494 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 202 states. [2020-07-10 15:04:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,502 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-10 15:04:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-10 15:04:10,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:10,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-10 15:04:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2020-07-10 15:04:10,509 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2020-07-10 15:04:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:10,509 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2020-07-10 15:04:10,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2020-07-10 15:04:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:10,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:10,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:10,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:04:10,511 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2020-07-10 15:04:10,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:10,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783764415] [2020-07-10 15:04:10,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:10,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-10 15:04:10,540 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-10 15:04:10,540 INFO L263 TraceCheckUtils]: 0: Hoare triple {3222#true} call ULTIMATE.init(); {3222#true} is VALID [2020-07-10 15:04:10,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-10 15:04:10,541 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-10 15:04:10,541 INFO L263 TraceCheckUtils]: 3: Hoare triple {3222#true} call #t~ret9 := main(); {3222#true} is VALID [2020-07-10 15:04:10,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {3222#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {3222#true} is VALID [2020-07-10 15:04:10,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {3222#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {3222#true} is VALID [2020-07-10 15:04:10,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {3222#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {3222#true} is VALID [2020-07-10 15:04:10,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {3222#true} assume !(0 != ~p1~0); {3222#true} is VALID [2020-07-10 15:04:10,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {3222#true} assume !(0 != ~p2~0); {3222#true} is VALID [2020-07-10 15:04:10,543 INFO L280 TraceCheckUtils]: 9: Hoare triple {3222#true} assume !(0 != ~p3~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-10 15:04:10,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3223#false} is VALID [2020-07-10 15:04:10,547 INFO L280 TraceCheckUtils]: 18: Hoare triple {3223#false} assume 1 != ~lk3~0; {3223#false} is VALID [2020-07-10 15:04:10,548 INFO L280 TraceCheckUtils]: 19: Hoare triple {3223#false} assume !false; {3223#false} is VALID [2020-07-10 15:04:10,548 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:04:10,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783764415] [2020-07-10 15:04:10,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:10,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:10,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956518920] [2020-07-10 15:04:10,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:10,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:10,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:10,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:10,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:10,590 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2020-07-10 15:04:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,757 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2020-07-10 15:04:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:10,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-10 15:04:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-10 15:04:10,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2020-07-10 15:04:10,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:10,912 INFO L225 Difference]: With dead ends: 352 [2020-07-10 15:04:10,913 INFO L226 Difference]: Without dead ends: 210 [2020-07-10 15:04:10,914 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:04:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-10 15:04:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-07-10 15:04:10,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:10,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2020-07-10 15:04:10,952 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2020-07-10 15:04:10,953 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2020-07-10 15:04:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,968 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-10 15:04:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-10 15:04:10,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,971 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2020-07-10 15:04:10,971 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2020-07-10 15:04:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:10,979 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-10 15:04:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-10 15:04:10,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:10,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:10,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:10,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-10 15:04:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2020-07-10 15:04:10,988 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2020-07-10 15:04:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:10,991 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2020-07-10 15:04:10,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2020-07-10 15:04:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:10,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:10,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:10,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:04:10,997 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2020-07-10 15:04:10,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:10,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748380614] [2020-07-10 15:04:10,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-10 15:04:11,069 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-10 15:04:11,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {4243#true} call ULTIMATE.init(); {4243#true} is VALID [2020-07-10 15:04:11,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-10 15:04:11,070 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-10 15:04:11,070 INFO L263 TraceCheckUtils]: 3: Hoare triple {4243#true} call #t~ret9 := main(); {4243#true} is VALID [2020-07-10 15:04:11,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {4243#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {4243#true} is VALID [2020-07-10 15:04:11,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {4243#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {4243#true} is VALID [2020-07-10 15:04:11,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {4243#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4243#true} is VALID [2020-07-10 15:04:11,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {4243#true} assume !(0 != ~p1~0); {4243#true} is VALID [2020-07-10 15:04:11,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {4243#true} assume !(0 != ~p2~0); {4243#true} is VALID [2020-07-10 15:04:11,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {4243#true} assume 0 != ~p3~0;~lk3~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,074 INFO L280 TraceCheckUtils]: 13: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:04:11,076 INFO L280 TraceCheckUtils]: 17: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {4244#false} is VALID [2020-07-10 15:04:11,077 INFO L280 TraceCheckUtils]: 18: Hoare triple {4244#false} assume 0 != ~p4~0; {4244#false} is VALID [2020-07-10 15:04:11,077 INFO L280 TraceCheckUtils]: 19: Hoare triple {4244#false} assume 1 != ~lk4~0; {4244#false} is VALID [2020-07-10 15:04:11,077 INFO L280 TraceCheckUtils]: 20: Hoare triple {4244#false} assume !false; {4244#false} is VALID [2020-07-10 15:04:11,078 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:04:11,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748380614] [2020-07-10 15:04:11,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:11,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:11,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995887304] [2020-07-10 15:04:11,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:11,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,106 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2020-07-10 15:04:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,264 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-07-10 15:04:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:11,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-10 15:04:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-10 15:04:11,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2020-07-10 15:04:11,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,452 INFO L225 Difference]: With dead ends: 312 [2020-07-10 15:04:11,452 INFO L226 Difference]: Without dead ends: 214 [2020-07-10 15:04:11,453 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:04:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-10 15:04:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-07-10 15:04:11,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:11,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2020-07-10 15:04:11,482 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2020-07-10 15:04:11,483 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2020-07-10 15:04:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,488 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-10 15:04:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-10 15:04:11,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,490 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2020-07-10 15:04:11,490 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2020-07-10 15:04:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,495 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-10 15:04:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-10 15:04:11,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:11,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-07-10 15:04:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2020-07-10 15:04:11,502 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2020-07-10 15:04:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:11,503 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2020-07-10 15:04:11,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2020-07-10 15:04:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:11,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:11,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:11,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:04:11,504 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2020-07-10 15:04:11,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:11,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518539074] [2020-07-10 15:04:11,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-10 15:04:11,531 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-10 15:04:11,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2020-07-10 15:04:11,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-10 15:04:11,532 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-10 15:04:11,532 INFO L263 TraceCheckUtils]: 3: Hoare triple {5236#true} call #t~ret9 := main(); {5236#true} is VALID [2020-07-10 15:04:11,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {5236#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {5236#true} is VALID [2020-07-10 15:04:11,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {5236#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {5236#true} is VALID [2020-07-10 15:04:11,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {5236#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5236#true} is VALID [2020-07-10 15:04:11,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {5236#true} assume !(0 != ~p1~0); {5236#true} is VALID [2020-07-10 15:04:11,533 INFO L280 TraceCheckUtils]: 8: Hoare triple {5236#true} assume !(0 != ~p2~0); {5236#true} is VALID [2020-07-10 15:04:11,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {5236#true} assume !(0 != ~p3~0); {5236#true} is VALID [2020-07-10 15:04:11,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {5236#true} assume 0 != ~p4~0;~lk4~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,538 INFO L280 TraceCheckUtils]: 17: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:04:11,539 INFO L280 TraceCheckUtils]: 19: Hoare triple {5240#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {5237#false} is VALID [2020-07-10 15:04:11,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2020-07-10 15:04:11,540 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:04:11,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518539074] [2020-07-10 15:04:11,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:11,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:11,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883897648] [2020-07-10 15:04:11,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:11,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,563 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2020-07-10 15:04:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,705 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2020-07-10 15:04:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:11,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 15:04:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 15:04:11,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-10 15:04:11,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,817 INFO L225 Difference]: With dead ends: 380 [2020-07-10 15:04:11,817 INFO L226 Difference]: Without dead ends: 378 [2020-07-10 15:04:11,818 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:04:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-07-10 15:04:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2020-07-10 15:04:11,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:11,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 296 states. [2020-07-10 15:04:11,862 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 296 states. [2020-07-10 15:04:11,863 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 296 states. [2020-07-10 15:04:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,874 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-10 15:04:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-10 15:04:11,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,875 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 378 states. [2020-07-10 15:04:11,875 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 378 states. [2020-07-10 15:04:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:11,887 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-10 15:04:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-10 15:04:11,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:11,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:11,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:11,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-10 15:04:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2020-07-10 15:04:11,898 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2020-07-10 15:04:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:11,898 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2020-07-10 15:04:11,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2020-07-10 15:04:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:11,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:11,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:11,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:04:11,900 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2020-07-10 15:04:11,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:11,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377634804] [2020-07-10 15:04:11,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:11,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-10 15:04:11,931 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-10 15:04:11,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {6713#true} call ULTIMATE.init(); {6713#true} is VALID [2020-07-10 15:04:11,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-10 15:04:11,931 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-10 15:04:11,932 INFO L263 TraceCheckUtils]: 3: Hoare triple {6713#true} call #t~ret9 := main(); {6713#true} is VALID [2020-07-10 15:04:11,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {6713#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {6713#true} is VALID [2020-07-10 15:04:11,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {6713#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {6713#true} is VALID [2020-07-10 15:04:11,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {6713#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {6713#true} is VALID [2020-07-10 15:04:11,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {6713#true} assume !(0 != ~p1~0); {6713#true} is VALID [2020-07-10 15:04:11,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {6713#true} assume !(0 != ~p2~0); {6713#true} is VALID [2020-07-10 15:04:11,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {6713#true} assume !(0 != ~p3~0); {6713#true} is VALID [2020-07-10 15:04:11,934 INFO L280 TraceCheckUtils]: 10: Hoare triple {6713#true} assume !(0 != ~p4~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,938 INFO L280 TraceCheckUtils]: 16: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,938 INFO L280 TraceCheckUtils]: 17: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-10 15:04:11,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p4~0; {6714#false} is VALID [2020-07-10 15:04:11,939 INFO L280 TraceCheckUtils]: 19: Hoare triple {6714#false} assume 1 != ~lk4~0; {6714#false} is VALID [2020-07-10 15:04:11,939 INFO L280 TraceCheckUtils]: 20: Hoare triple {6714#false} assume !false; {6714#false} is VALID [2020-07-10 15:04:11,940 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:04:11,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377634804] [2020-07-10 15:04:11,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:11,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:11,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821451466] [2020-07-10 15:04:11,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:11,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:11,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:11,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:11,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:11,963 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2020-07-10 15:04:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,151 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2020-07-10 15:04:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:12,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-10 15:04:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-10 15:04:12,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2020-07-10 15:04:12,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:12,322 INFO L225 Difference]: With dead ends: 684 [2020-07-10 15:04:12,322 INFO L226 Difference]: Without dead ends: 402 [2020-07-10 15:04:12,323 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:04:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-07-10 15:04:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2020-07-10 15:04:12,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:12,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 400 states. [2020-07-10 15:04:12,387 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 400 states. [2020-07-10 15:04:12,387 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 400 states. [2020-07-10 15:04:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,406 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-10 15:04:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-10 15:04:12,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,408 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand 402 states. [2020-07-10 15:04:12,408 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 402 states. [2020-07-10 15:04:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,422 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-10 15:04:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-10 15:04:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:12,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-07-10 15:04:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2020-07-10 15:04:12,436 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2020-07-10 15:04:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:12,436 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2020-07-10 15:04:12,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2020-07-10 15:04:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:12,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:12,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:12,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:04:12,441 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2020-07-10 15:04:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:12,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339980089] [2020-07-10 15:04:12,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:12,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-10 15:04:12,498 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-10 15:04:12,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8662#true} is VALID [2020-07-10 15:04:12,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-10 15:04:12,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-10 15:04:12,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {8662#true} call #t~ret9 := main(); {8662#true} is VALID [2020-07-10 15:04:12,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {8662#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {8662#true} is VALID [2020-07-10 15:04:12,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {8662#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {8662#true} is VALID [2020-07-10 15:04:12,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {8662#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {8662#true} is VALID [2020-07-10 15:04:12,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {8662#true} assume !(0 != ~p1~0); {8662#true} is VALID [2020-07-10 15:04:12,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {8662#true} assume !(0 != ~p2~0); {8662#true} is VALID [2020-07-10 15:04:12,501 INFO L280 TraceCheckUtils]: 9: Hoare triple {8662#true} assume !(0 != ~p3~0); {8662#true} is VALID [2020-07-10 15:04:12,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {8662#true} assume 0 != ~p4~0;~lk4~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,511 INFO L280 TraceCheckUtils]: 11: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,516 INFO L280 TraceCheckUtils]: 14: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,520 INFO L280 TraceCheckUtils]: 15: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:12,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {8663#false} is VALID [2020-07-10 15:04:12,523 INFO L280 TraceCheckUtils]: 19: Hoare triple {8663#false} assume 0 != ~p5~0; {8663#false} is VALID [2020-07-10 15:04:12,523 INFO L280 TraceCheckUtils]: 20: Hoare triple {8663#false} assume 1 != ~lk5~0; {8663#false} is VALID [2020-07-10 15:04:12,524 INFO L280 TraceCheckUtils]: 21: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2020-07-10 15:04:12,524 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:04:12,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339980089] [2020-07-10 15:04:12,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:12,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:12,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138638257] [2020-07-10 15:04:12,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:12,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:12,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:12,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:12,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:12,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:12,546 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2020-07-10 15:04:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,707 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2020-07-10 15:04:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:12,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-10 15:04:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-10 15:04:12,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2020-07-10 15:04:12,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:12,852 INFO L225 Difference]: With dead ends: 600 [2020-07-10 15:04:12,852 INFO L226 Difference]: Without dead ends: 410 [2020-07-10 15:04:12,853 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:04:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-07-10 15:04:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2020-07-10 15:04:12,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:12,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 408 states. [2020-07-10 15:04:12,925 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 408 states. [2020-07-10 15:04:12,925 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 408 states. [2020-07-10 15:04:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,940 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-10 15:04:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-10 15:04:12,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,941 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand 410 states. [2020-07-10 15:04:12,941 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 410 states. [2020-07-10 15:04:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:12,954 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-10 15:04:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-10 15:04:12,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:12,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:12,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:12,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-07-10 15:04:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2020-07-10 15:04:12,968 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2020-07-10 15:04:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:12,968 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2020-07-10 15:04:12,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2020-07-10 15:04:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:12,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:12,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:12,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:04:12,971 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2020-07-10 15:04:12,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:12,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957536113] [2020-07-10 15:04:12,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-10 15:04:13,015 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-10 15:04:13,015 INFO L263 TraceCheckUtils]: 0: Hoare triple {10551#true} call ULTIMATE.init(); {10551#true} is VALID [2020-07-10 15:04:13,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-10 15:04:13,016 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-10 15:04:13,016 INFO L263 TraceCheckUtils]: 3: Hoare triple {10551#true} call #t~ret9 := main(); {10551#true} is VALID [2020-07-10 15:04:13,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {10551#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {10551#true} is VALID [2020-07-10 15:04:13,016 INFO L280 TraceCheckUtils]: 5: Hoare triple {10551#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {10551#true} is VALID [2020-07-10 15:04:13,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {10551#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {10551#true} is VALID [2020-07-10 15:04:13,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {10551#true} assume !(0 != ~p1~0); {10551#true} is VALID [2020-07-10 15:04:13,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {10551#true} assume !(0 != ~p2~0); {10551#true} is VALID [2020-07-10 15:04:13,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {10551#true} assume !(0 != ~p3~0); {10551#true} is VALID [2020-07-10 15:04:13,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {10551#true} assume !(0 != ~p4~0); {10551#true} is VALID [2020-07-10 15:04:13,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {10551#true} assume 0 != ~p5~0;~lk5~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,020 INFO L280 TraceCheckUtils]: 15: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,022 INFO L280 TraceCheckUtils]: 19: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:13,023 INFO L280 TraceCheckUtils]: 20: Hoare triple {10555#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {10552#false} is VALID [2020-07-10 15:04:13,023 INFO L280 TraceCheckUtils]: 21: Hoare triple {10552#false} assume !false; {10552#false} is VALID [2020-07-10 15:04:13,024 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:04:13,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957536113] [2020-07-10 15:04:13,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:13,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:13,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945694755] [2020-07-10 15:04:13,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:13,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:13,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:13,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:13,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:13,047 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2020-07-10 15:04:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,275 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2020-07-10 15:04:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:13,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:04:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:04:13,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-10 15:04:13,374 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:04:13,407 INFO L225 Difference]: With dead ends: 716 [2020-07-10 15:04:13,408 INFO L226 Difference]: Without dead ends: 714 [2020-07-10 15:04:13,408 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:04:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-07-10 15:04:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2020-07-10 15:04:13,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:13,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 584 states. [2020-07-10 15:04:13,483 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 584 states. [2020-07-10 15:04:13,483 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 584 states. [2020-07-10 15:04:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,519 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-10 15:04:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-10 15:04:13,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,525 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 714 states. [2020-07-10 15:04:13,525 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 714 states. [2020-07-10 15:04:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,559 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-10 15:04:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-10 15:04:13,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:13,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:13,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:13,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-10 15:04:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2020-07-10 15:04:13,592 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2020-07-10 15:04:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:13,593 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2020-07-10 15:04:13,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2020-07-10 15:04:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:04:13,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:13,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:13,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:04:13,596 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2020-07-10 15:04:13,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:13,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23143286] [2020-07-10 15:04:13,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:13,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-10 15:04:13,635 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-10 15:04:13,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {13348#true} call ULTIMATE.init(); {13348#true} is VALID [2020-07-10 15:04:13,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-10 15:04:13,635 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-10 15:04:13,636 INFO L263 TraceCheckUtils]: 3: Hoare triple {13348#true} call #t~ret9 := main(); {13348#true} is VALID [2020-07-10 15:04:13,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {13348#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {13348#true} is VALID [2020-07-10 15:04:13,636 INFO L280 TraceCheckUtils]: 5: Hoare triple {13348#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {13348#true} is VALID [2020-07-10 15:04:13,636 INFO L280 TraceCheckUtils]: 6: Hoare triple {13348#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {13348#true} is VALID [2020-07-10 15:04:13,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {13348#true} assume !(0 != ~p1~0); {13348#true} is VALID [2020-07-10 15:04:13,637 INFO L280 TraceCheckUtils]: 8: Hoare triple {13348#true} assume !(0 != ~p2~0); {13348#true} is VALID [2020-07-10 15:04:13,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {13348#true} assume !(0 != ~p3~0); {13348#true} is VALID [2020-07-10 15:04:13,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {13348#true} assume !(0 != ~p4~0); {13348#true} is VALID [2020-07-10 15:04:13,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {13348#true} assume !(0 != ~p5~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,638 INFO L280 TraceCheckUtils]: 12: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,640 INFO L280 TraceCheckUtils]: 14: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,641 INFO L280 TraceCheckUtils]: 16: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,641 INFO L280 TraceCheckUtils]: 17: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:13,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p5~0; {13349#false} is VALID [2020-07-10 15:04:13,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {13349#false} assume 1 != ~lk5~0; {13349#false} is VALID [2020-07-10 15:04:13,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {13349#false} assume !false; {13349#false} is VALID [2020-07-10 15:04:13,645 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:04:13,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23143286] [2020-07-10 15:04:13,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:13,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:13,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804276416] [2020-07-10 15:04:13,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:13,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:13,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:13,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:13,666 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2020-07-10 15:04:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:13,988 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2020-07-10 15:04:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:13,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:04:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-10 15:04:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-10 15:04:13,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-10 15:04:14,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:14,159 INFO L225 Difference]: With dead ends: 1340 [2020-07-10 15:04:14,160 INFO L226 Difference]: Without dead ends: 778 [2020-07-10 15:04:14,162 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:04:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-07-10 15:04:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2020-07-10 15:04:14,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:14,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand 776 states. [2020-07-10 15:04:14,306 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand 776 states. [2020-07-10 15:04:14,306 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 776 states. [2020-07-10 15:04:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,347 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-10 15:04:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-10 15:04:14,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,349 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 778 states. [2020-07-10 15:04:14,350 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 778 states. [2020-07-10 15:04:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,404 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-10 15:04:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-10 15:04:14,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:14,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-10 15:04:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2020-07-10 15:04:14,441 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2020-07-10 15:04:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:14,441 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2020-07-10 15:04:14,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2020-07-10 15:04:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:14,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:14,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:14,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:04:14,443 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2020-07-10 15:04:14,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:14,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279372429] [2020-07-10 15:04:14,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:14,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-10 15:04:14,484 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-10 15:04:14,485 INFO L263 TraceCheckUtils]: 0: Hoare triple {17121#true} call ULTIMATE.init(); {17121#true} is VALID [2020-07-10 15:04:14,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-10 15:04:14,485 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-10 15:04:14,486 INFO L263 TraceCheckUtils]: 3: Hoare triple {17121#true} call #t~ret9 := main(); {17121#true} is VALID [2020-07-10 15:04:14,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {17121#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {17121#true} is VALID [2020-07-10 15:04:14,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {17121#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {17121#true} is VALID [2020-07-10 15:04:14,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {17121#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {17121#true} is VALID [2020-07-10 15:04:14,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {17121#true} assume !(0 != ~p1~0); {17121#true} is VALID [2020-07-10 15:04:14,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {17121#true} assume !(0 != ~p2~0); {17121#true} is VALID [2020-07-10 15:04:14,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {17121#true} assume !(0 != ~p3~0); {17121#true} is VALID [2020-07-10 15:04:14,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {17121#true} assume !(0 != ~p4~0); {17121#true} is VALID [2020-07-10 15:04:14,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {17121#true} assume 0 != ~p5~0;~lk5~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:14,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {17122#false} is VALID [2020-07-10 15:04:14,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {17122#false} assume 0 != ~p6~0; {17122#false} is VALID [2020-07-10 15:04:14,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {17122#false} assume 1 != ~lk6~0; {17122#false} is VALID [2020-07-10 15:04:14,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {17122#false} assume !false; {17122#false} is VALID [2020-07-10 15:04:14,495 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:04:14,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279372429] [2020-07-10 15:04:14,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:14,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:14,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356994884] [2020-07-10 15:04:14,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:14,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:14,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:14,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:14,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:14,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:14,527 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2020-07-10 15:04:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,853 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2020-07-10 15:04:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:14,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:04:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:04:14,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-10 15:04:14,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:15,029 INFO L225 Difference]: With dead ends: 1164 [2020-07-10 15:04:15,029 INFO L226 Difference]: Without dead ends: 794 [2020-07-10 15:04:15,032 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:04:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-10 15:04:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2020-07-10 15:04:15,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:15,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand 792 states. [2020-07-10 15:04:15,194 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand 792 states. [2020-07-10 15:04:15,194 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 792 states. [2020-07-10 15:04:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,233 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-10 15:04:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-10 15:04:15,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:15,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:15,235 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand 794 states. [2020-07-10 15:04:15,236 INFO L87 Difference]: Start difference. First operand 792 states. Second operand 794 states. [2020-07-10 15:04:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,275 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-10 15:04:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-10 15:04:15,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:15,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:15,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:15,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-07-10 15:04:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2020-07-10 15:04:15,319 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2020-07-10 15:04:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:15,319 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2020-07-10 15:04:15,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2020-07-10 15:04:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:15,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:15,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:15,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:04:15,322 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2020-07-10 15:04:15,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:15,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109493712] [2020-07-10 15:04:15,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:15,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-10 15:04:15,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-10 15:04:15,367 INFO L263 TraceCheckUtils]: 0: Hoare triple {20766#true} call ULTIMATE.init(); {20766#true} is VALID [2020-07-10 15:04:15,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-10 15:04:15,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-10 15:04:15,367 INFO L263 TraceCheckUtils]: 3: Hoare triple {20766#true} call #t~ret9 := main(); {20766#true} is VALID [2020-07-10 15:04:15,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {20766#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {20766#true} is VALID [2020-07-10 15:04:15,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {20766#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {20766#true} is VALID [2020-07-10 15:04:15,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {20766#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {20766#true} is VALID [2020-07-10 15:04:15,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {20766#true} assume !(0 != ~p1~0); {20766#true} is VALID [2020-07-10 15:04:15,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {20766#true} assume !(0 != ~p2~0); {20766#true} is VALID [2020-07-10 15:04:15,369 INFO L280 TraceCheckUtils]: 9: Hoare triple {20766#true} assume !(0 != ~p3~0); {20766#true} is VALID [2020-07-10 15:04:15,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {20766#true} assume !(0 != ~p4~0); {20766#true} is VALID [2020-07-10 15:04:15,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {20766#true} assume !(0 != ~p5~0); {20766#true} is VALID [2020-07-10 15:04:15,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {20766#true} assume 0 != ~p6~0;~lk6~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,373 INFO L280 TraceCheckUtils]: 16: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,374 INFO L280 TraceCheckUtils]: 17: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,374 INFO L280 TraceCheckUtils]: 18: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,375 INFO L280 TraceCheckUtils]: 19: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:15,376 INFO L280 TraceCheckUtils]: 21: Hoare triple {20770#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {20767#false} is VALID [2020-07-10 15:04:15,376 INFO L280 TraceCheckUtils]: 22: Hoare triple {20767#false} assume !false; {20767#false} is VALID [2020-07-10 15:04:15,377 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:04:15,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109493712] [2020-07-10 15:04:15,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:15,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:15,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872562932] [2020-07-10 15:04:15,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:15,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:15,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:15,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:15,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:15,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:15,407 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2020-07-10 15:04:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:15,915 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2020-07-10 15:04:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-10 15:04:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-10 15:04:15,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-10 15:04:16,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:16,069 INFO L225 Difference]: With dead ends: 1356 [2020-07-10 15:04:16,069 INFO L226 Difference]: Without dead ends: 1354 [2020-07-10 15:04:16,070 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:04:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-07-10 15:04:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2020-07-10 15:04:16,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:16,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1160 states. [2020-07-10 15:04:16,258 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1160 states. [2020-07-10 15:04:16,258 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1160 states. [2020-07-10 15:04:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,321 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-10 15:04:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-10 15:04:16,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,330 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1354 states. [2020-07-10 15:04:16,330 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1354 states. [2020-07-10 15:04:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,417 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-10 15:04:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-10 15:04:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:16,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2020-07-10 15:04:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2020-07-10 15:04:16,468 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2020-07-10 15:04:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:16,469 INFO L479 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2020-07-10 15:04:16,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2020-07-10 15:04:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:04:16,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:16,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:16,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:04:16,471 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2020-07-10 15:04:16,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:16,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600771316] [2020-07-10 15:04:16,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:16,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-10 15:04:16,504 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-10 15:04:16,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {26107#true} call ULTIMATE.init(); {26107#true} is VALID [2020-07-10 15:04:16,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-10 15:04:16,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-10 15:04:16,505 INFO L263 TraceCheckUtils]: 3: Hoare triple {26107#true} call #t~ret9 := main(); {26107#true} is VALID [2020-07-10 15:04:16,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {26107#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {26107#true} is VALID [2020-07-10 15:04:16,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {26107#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {26107#true} is VALID [2020-07-10 15:04:16,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {26107#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {26107#true} is VALID [2020-07-10 15:04:16,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {26107#true} assume !(0 != ~p1~0); {26107#true} is VALID [2020-07-10 15:04:16,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {26107#true} assume !(0 != ~p2~0); {26107#true} is VALID [2020-07-10 15:04:16,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {26107#true} assume !(0 != ~p3~0); {26107#true} is VALID [2020-07-10 15:04:16,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {26107#true} assume !(0 != ~p4~0); {26107#true} is VALID [2020-07-10 15:04:16,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {26107#true} assume !(0 != ~p5~0); {26107#true} is VALID [2020-07-10 15:04:16,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {26107#true} assume !(0 != ~p6~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,508 INFO L280 TraceCheckUtils]: 13: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,509 INFO L280 TraceCheckUtils]: 14: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:16,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p6~0; {26108#false} is VALID [2020-07-10 15:04:16,515 INFO L280 TraceCheckUtils]: 21: Hoare triple {26108#false} assume 1 != ~lk6~0; {26108#false} is VALID [2020-07-10 15:04:16,516 INFO L280 TraceCheckUtils]: 22: Hoare triple {26108#false} assume !false; {26108#false} is VALID [2020-07-10 15:04:16,516 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:04:16,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600771316] [2020-07-10 15:04:16,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:16,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:16,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182127049] [2020-07-10 15:04:16,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:16,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:16,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:16,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:16,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:16,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:16,541 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2020-07-10 15:04:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:17,454 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2020-07-10 15:04:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:17,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:04:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-10 15:04:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-10 15:04:17,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2020-07-10 15:04:17,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:17,761 INFO L225 Difference]: With dead ends: 2636 [2020-07-10 15:04:17,761 INFO L226 Difference]: Without dead ends: 1514 [2020-07-10 15:04:17,765 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:04:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-07-10 15:04:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2020-07-10 15:04:18,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:18,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand 1512 states. [2020-07-10 15:04:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand 1512 states. [2020-07-10 15:04:18,247 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand 1512 states. [2020-07-10 15:04:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:18,403 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-10 15:04:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-10 15:04:18,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:18,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:18,407 INFO L74 IsIncluded]: Start isIncluded. First operand 1512 states. Second operand 1514 states. [2020-07-10 15:04:18,407 INFO L87 Difference]: Start difference. First operand 1512 states. Second operand 1514 states. [2020-07-10 15:04:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:18,531 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-10 15:04:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-10 15:04:18,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:18,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:18,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:18,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2020-07-10 15:04:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2020-07-10 15:04:18,659 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2020-07-10 15:04:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:18,659 INFO L479 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2020-07-10 15:04:18,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2020-07-10 15:04:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:18,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:18,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:18,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:04:18,663 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2020-07-10 15:04:18,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:18,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032097490] [2020-07-10 15:04:18,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:18,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-10 15:04:18,689 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-10 15:04:18,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {33464#true} call ULTIMATE.init(); {33464#true} is VALID [2020-07-10 15:04:18,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-10 15:04:18,690 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-10 15:04:18,690 INFO L263 TraceCheckUtils]: 3: Hoare triple {33464#true} call #t~ret9 := main(); {33464#true} is VALID [2020-07-10 15:04:18,690 INFO L280 TraceCheckUtils]: 4: Hoare triple {33464#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {33464#true} is VALID [2020-07-10 15:04:18,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {33464#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {33464#true} is VALID [2020-07-10 15:04:18,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {33464#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {33464#true} is VALID [2020-07-10 15:04:18,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {33464#true} assume !(0 != ~p1~0); {33464#true} is VALID [2020-07-10 15:04:18,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {33464#true} assume !(0 != ~p2~0); {33464#true} is VALID [2020-07-10 15:04:18,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {33464#true} assume !(0 != ~p3~0); {33464#true} is VALID [2020-07-10 15:04:18,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {33464#true} assume !(0 != ~p4~0); {33464#true} is VALID [2020-07-10 15:04:18,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {33464#true} assume !(0 != ~p5~0); {33464#true} is VALID [2020-07-10 15:04:18,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {33464#true} assume 0 != ~p6~0;~lk6~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,693 INFO L280 TraceCheckUtils]: 13: Hoare triple {33468#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,694 INFO L280 TraceCheckUtils]: 15: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,694 INFO L280 TraceCheckUtils]: 16: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,695 INFO L280 TraceCheckUtils]: 17: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,696 INFO L280 TraceCheckUtils]: 19: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:04:18,696 INFO L280 TraceCheckUtils]: 20: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {33465#false} is VALID [2020-07-10 15:04:18,697 INFO L280 TraceCheckUtils]: 21: Hoare triple {33465#false} assume 0 != ~p7~0; {33465#false} is VALID [2020-07-10 15:04:18,697 INFO L280 TraceCheckUtils]: 22: Hoare triple {33465#false} assume 1 != ~lk7~0; {33465#false} is VALID [2020-07-10 15:04:18,697 INFO L280 TraceCheckUtils]: 23: Hoare triple {33465#false} assume !false; {33465#false} is VALID [2020-07-10 15:04:18,697 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:04:18,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032097490] [2020-07-10 15:04:18,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:18,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:18,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477444685] [2020-07-10 15:04:18,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:18,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:18,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:18,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:18,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:18,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:18,724 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2020-07-10 15:04:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:19,490 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2020-07-10 15:04:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:19,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-10 15:04:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-10 15:04:19,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2020-07-10 15:04:19,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:19,705 INFO L225 Difference]: With dead ends: 2268 [2020-07-10 15:04:19,705 INFO L226 Difference]: Without dead ends: 1546 [2020-07-10 15:04:19,707 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:04:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-07-10 15:04:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2020-07-10 15:04:20,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:20,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1544 states. [2020-07-10 15:04:20,075 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1544 states. [2020-07-10 15:04:20,076 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1544 states. [2020-07-10 15:04:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:20,161 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-10 15:04:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-10 15:04:20,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:20,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:20,165 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1546 states. [2020-07-10 15:04:20,165 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1546 states. [2020-07-10 15:04:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:20,257 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-10 15:04:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-10 15:04:20,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:20,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:20,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:20,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-10 15:04:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2020-07-10 15:04:20,351 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2020-07-10 15:04:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:20,352 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2020-07-10 15:04:20,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2020-07-10 15:04:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:20,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:20,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:20,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 15:04:20,354 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2020-07-10 15:04:20,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:20,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537799656] [2020-07-10 15:04:20,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:20,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-10 15:04:20,382 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-10 15:04:20,382 INFO L263 TraceCheckUtils]: 0: Hoare triple {40549#true} call ULTIMATE.init(); {40549#true} is VALID [2020-07-10 15:04:20,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L263 TraceCheckUtils]: 3: Hoare triple {40549#true} call #t~ret9 := main(); {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {40549#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {40549#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {40549#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {40549#true} is VALID [2020-07-10 15:04:20,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {40549#true} assume !(0 != ~p1~0); {40549#true} is VALID [2020-07-10 15:04:20,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {40549#true} assume !(0 != ~p2~0); {40549#true} is VALID [2020-07-10 15:04:20,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {40549#true} assume !(0 != ~p3~0); {40549#true} is VALID [2020-07-10 15:04:20,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {40549#true} assume !(0 != ~p4~0); {40549#true} is VALID [2020-07-10 15:04:20,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {40549#true} assume !(0 != ~p5~0); {40549#true} is VALID [2020-07-10 15:04:20,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {40549#true} assume !(0 != ~p6~0); {40549#true} is VALID [2020-07-10 15:04:20,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {40549#true} assume 0 != ~p7~0;~lk7~0 := 1; {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,389 INFO L280 TraceCheckUtils]: 14: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,390 INFO L280 TraceCheckUtils]: 15: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,394 INFO L280 TraceCheckUtils]: 16: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,394 INFO L280 TraceCheckUtils]: 17: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,395 INFO L280 TraceCheckUtils]: 18: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,395 INFO L280 TraceCheckUtils]: 19: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,397 INFO L280 TraceCheckUtils]: 21: Hoare triple {40553#(= main_~lk7~0 1)} assume 0 != ~p7~0; {40553#(= main_~lk7~0 1)} is VALID [2020-07-10 15:04:20,397 INFO L280 TraceCheckUtils]: 22: Hoare triple {40553#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {40550#false} is VALID [2020-07-10 15:04:20,398 INFO L280 TraceCheckUtils]: 23: Hoare triple {40550#false} assume !false; {40550#false} is VALID [2020-07-10 15:04:20,398 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:04:20,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537799656] [2020-07-10 15:04:20,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:20,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:20,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430249822] [2020-07-10 15:04:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:20,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:20,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:20,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:20,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:20,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:20,422 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2020-07-10 15:04:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:21,451 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2020-07-10 15:04:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:21,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-10 15:04:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-10 15:04:21,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-10 15:04:21,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:21,748 INFO L225 Difference]: With dead ends: 2572 [2020-07-10 15:04:21,749 INFO L226 Difference]: Without dead ends: 2570 [2020-07-10 15:04:21,749 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:04:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-07-10 15:04:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2020-07-10 15:04:22,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:22,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2570 states. Second operand 2312 states. [2020-07-10 15:04:22,155 INFO L74 IsIncluded]: Start isIncluded. First operand 2570 states. Second operand 2312 states. [2020-07-10 15:04:22,155 INFO L87 Difference]: Start difference. First operand 2570 states. Second operand 2312 states. [2020-07-10 15:04:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:22,362 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-10 15:04:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-10 15:04:22,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:22,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:22,366 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2570 states. [2020-07-10 15:04:22,366 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2570 states. [2020-07-10 15:04:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:22,568 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-10 15:04:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-10 15:04:22,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:22,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:22,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:22,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2020-07-10 15:04:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2020-07-10 15:04:22,762 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2020-07-10 15:04:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:22,762 INFO L479 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2020-07-10 15:04:22,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2020-07-10 15:04:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:04:22,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:22,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:22,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 15:04:22,765 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:22,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2020-07-10 15:04:22,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:22,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792053948] [2020-07-10 15:04:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:22,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-10 15:04:22,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-10 15:04:22,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {50786#true} call ULTIMATE.init(); {50786#true} is VALID [2020-07-10 15:04:22,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-10 15:04:22,795 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-10 15:04:22,795 INFO L263 TraceCheckUtils]: 3: Hoare triple {50786#true} call #t~ret9 := main(); {50786#true} is VALID [2020-07-10 15:04:22,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {50786#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {50786#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {50786#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {50786#true} assume !(0 != ~p1~0); {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 8: Hoare triple {50786#true} assume !(0 != ~p2~0); {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {50786#true} assume !(0 != ~p3~0); {50786#true} is VALID [2020-07-10 15:04:22,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {50786#true} assume !(0 != ~p4~0); {50786#true} is VALID [2020-07-10 15:04:22,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {50786#true} assume !(0 != ~p5~0); {50786#true} is VALID [2020-07-10 15:04:22,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {50786#true} assume !(0 != ~p6~0); {50786#true} is VALID [2020-07-10 15:04:22,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {50786#true} assume !(0 != ~p7~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,799 INFO L280 TraceCheckUtils]: 16: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,799 INFO L280 TraceCheckUtils]: 17: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,800 INFO L280 TraceCheckUtils]: 18: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,800 INFO L280 TraceCheckUtils]: 19: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,801 INFO L280 TraceCheckUtils]: 20: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-10 15:04:22,801 INFO L280 TraceCheckUtils]: 21: Hoare triple {50790#(= 0 main_~p7~0)} assume 0 != ~p7~0; {50787#false} is VALID [2020-07-10 15:04:22,801 INFO L280 TraceCheckUtils]: 22: Hoare triple {50787#false} assume 1 != ~lk7~0; {50787#false} is VALID [2020-07-10 15:04:22,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {50787#false} assume !false; {50787#false} is VALID [2020-07-10 15:04:22,802 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:04:22,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792053948] [2020-07-10 15:04:22,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:22,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:22,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925151865] [2020-07-10 15:04:22,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:22,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:22,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:22,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:22,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:22,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:22,833 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2020-07-10 15:04:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:24,379 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2020-07-10 15:04:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:24,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:04:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 15:04:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 15:04:24,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-10 15:04:24,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:24,801 INFO L225 Difference]: With dead ends: 5196 [2020-07-10 15:04:24,802 INFO L226 Difference]: Without dead ends: 2954 [2020-07-10 15:04:24,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:04:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-07-10 15:04:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2020-07-10 15:04:25,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:25,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2952 states. [2020-07-10 15:04:25,563 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2952 states. [2020-07-10 15:04:25,563 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2952 states. [2020-07-10 15:04:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:25,795 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-10 15:04:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-10 15:04:25,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:25,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:25,798 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand 2954 states. [2020-07-10 15:04:25,798 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand 2954 states. [2020-07-10 15:04:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:26,030 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-10 15:04:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-10 15:04:26,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:26,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:26,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:26,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-07-10 15:04:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2020-07-10 15:04:26,300 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2020-07-10 15:04:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:26,300 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2020-07-10 15:04:26,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2020-07-10 15:04:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:26,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:26,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:26,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 15:04:26,304 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2020-07-10 15:04:26,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:26,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33149666] [2020-07-10 15:04:26,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:26,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-10 15:04:26,330 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-10 15:04:26,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {65183#true} call ULTIMATE.init(); {65183#true} is VALID [2020-07-10 15:04:26,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-10 15:04:26,331 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-10 15:04:26,331 INFO L263 TraceCheckUtils]: 3: Hoare triple {65183#true} call #t~ret9 := main(); {65183#true} is VALID [2020-07-10 15:04:26,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {65183#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {65183#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {65183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {65183#true} assume !(0 != ~p1~0); {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {65183#true} assume !(0 != ~p2~0); {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 9: Hoare triple {65183#true} assume !(0 != ~p3~0); {65183#true} is VALID [2020-07-10 15:04:26,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {65183#true} assume !(0 != ~p4~0); {65183#true} is VALID [2020-07-10 15:04:26,333 INFO L280 TraceCheckUtils]: 11: Hoare triple {65183#true} assume !(0 != ~p5~0); {65183#true} is VALID [2020-07-10 15:04:26,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {65183#true} assume !(0 != ~p6~0); {65183#true} is VALID [2020-07-10 15:04:26,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {65183#true} assume 0 != ~p7~0;~lk7~0 := 1; {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,336 INFO L280 TraceCheckUtils]: 17: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:04:26,338 INFO L280 TraceCheckUtils]: 21: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {65184#false} is VALID [2020-07-10 15:04:26,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {65184#false} assume 0 != ~p8~0; {65184#false} is VALID [2020-07-10 15:04:26,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {65184#false} assume 1 != ~lk8~0; {65184#false} is VALID [2020-07-10 15:04:26,338 INFO L280 TraceCheckUtils]: 24: Hoare triple {65184#false} assume !false; {65184#false} is VALID [2020-07-10 15:04:26,339 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:04:26,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33149666] [2020-07-10 15:04:26,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:26,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:26,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048844322] [2020-07-10 15:04:26,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:26,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:26,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:26,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:26,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:26,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:26,370 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2020-07-10 15:04:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:27,767 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2020-07-10 15:04:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:27,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-10 15:04:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-10 15:04:27,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2020-07-10 15:04:27,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:28,173 INFO L225 Difference]: With dead ends: 4428 [2020-07-10 15:04:28,174 INFO L226 Difference]: Without dead ends: 3018 [2020-07-10 15:04:28,176 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:04:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-07-10 15:04:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2020-07-10 15:04:28,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:28,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3018 states. Second operand 3016 states. [2020-07-10 15:04:28,952 INFO L74 IsIncluded]: Start isIncluded. First operand 3018 states. Second operand 3016 states. [2020-07-10 15:04:28,952 INFO L87 Difference]: Start difference. First operand 3018 states. Second operand 3016 states. [2020-07-10 15:04:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:29,195 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-10 15:04:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-10 15:04:29,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:29,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:29,198 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3018 states. [2020-07-10 15:04:29,198 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3018 states. [2020-07-10 15:04:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:29,456 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-10 15:04:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-10 15:04:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:29,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:29,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:29,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-10 15:04:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2020-07-10 15:04:29,720 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2020-07-10 15:04:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:29,720 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2020-07-10 15:04:29,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2020-07-10 15:04:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:29,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:29,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:29,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 15:04:29,723 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2020-07-10 15:04:29,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:29,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350520404] [2020-07-10 15:04:29,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:29,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-10 15:04:29,782 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-10 15:04:29,783 INFO L263 TraceCheckUtils]: 0: Hoare triple {79004#true} call ULTIMATE.init(); {79004#true} is VALID [2020-07-10 15:04:29,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-10 15:04:29,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-10 15:04:29,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {79004#true} call #t~ret9 := main(); {79004#true} is VALID [2020-07-10 15:04:29,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {79004#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {79004#true} is VALID [2020-07-10 15:04:29,784 INFO L280 TraceCheckUtils]: 5: Hoare triple {79004#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {79004#true} is VALID [2020-07-10 15:04:29,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {79004#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {79004#true} is VALID [2020-07-10 15:04:29,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {79004#true} assume !(0 != ~p1~0); {79004#true} is VALID [2020-07-10 15:04:29,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {79004#true} assume !(0 != ~p2~0); {79004#true} is VALID [2020-07-10 15:04:29,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {79004#true} assume !(0 != ~p3~0); {79004#true} is VALID [2020-07-10 15:04:29,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {79004#true} assume !(0 != ~p4~0); {79004#true} is VALID [2020-07-10 15:04:29,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {79004#true} assume !(0 != ~p5~0); {79004#true} is VALID [2020-07-10 15:04:29,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {79004#true} assume !(0 != ~p6~0); {79004#true} is VALID [2020-07-10 15:04:29,785 INFO L280 TraceCheckUtils]: 13: Hoare triple {79004#true} assume !(0 != ~p7~0); {79004#true} is VALID [2020-07-10 15:04:29,787 INFO L280 TraceCheckUtils]: 14: Hoare triple {79004#true} assume !(0 != ~p8~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,788 INFO L280 TraceCheckUtils]: 15: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,788 INFO L280 TraceCheckUtils]: 16: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,789 INFO L280 TraceCheckUtils]: 17: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,789 INFO L280 TraceCheckUtils]: 18: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,790 INFO L280 TraceCheckUtils]: 19: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,790 INFO L280 TraceCheckUtils]: 20: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,791 INFO L280 TraceCheckUtils]: 21: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:29,792 INFO L280 TraceCheckUtils]: 22: Hoare triple {79008#(= 0 main_~p8~0)} assume 0 != ~p8~0; {79005#false} is VALID [2020-07-10 15:04:29,792 INFO L280 TraceCheckUtils]: 23: Hoare triple {79005#false} assume 1 != ~lk8~0; {79005#false} is VALID [2020-07-10 15:04:29,792 INFO L280 TraceCheckUtils]: 24: Hoare triple {79005#false} assume !false; {79005#false} is VALID [2020-07-10 15:04:29,793 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:04:29,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350520404] [2020-07-10 15:04:29,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:29,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:29,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783739245] [2020-07-10 15:04:29,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:29,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:29,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:29,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:29,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:29,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:29,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:29,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:29,820 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2020-07-10 15:04:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:33,659 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2020-07-10 15:04:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:33,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 15:04:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 15:04:33,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-10 15:04:33,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:34,104 INFO L225 Difference]: With dead ends: 8650 [2020-07-10 15:04:34,104 INFO L226 Difference]: Without dead ends: 3016 [2020-07-10 15:04:34,109 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:04:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-07-10 15:04:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2020-07-10 15:04:34,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:34,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3016 states. Second operand 3016 states. [2020-07-10 15:04:34,858 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-10 15:04:34,858 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-10 15:04:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:35,103 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-10 15:04:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-10 15:04:35,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:35,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:35,106 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-10 15:04:35,106 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-10 15:04:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:35,354 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-10 15:04:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-10 15:04:35,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:35,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:35,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:35,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-10 15:04:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2020-07-10 15:04:35,633 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2020-07-10 15:04:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:35,633 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2020-07-10 15:04:35,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-10 15:04:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:04:35,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:35,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:35,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 15:04:35,635 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2020-07-10 15:04:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:35,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350717200] [2020-07-10 15:04:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:35,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-10 15:04:35,673 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-10 15:04:35,673 INFO L263 TraceCheckUtils]: 0: Hoare triple {97234#true} call ULTIMATE.init(); {97234#true} is VALID [2020-07-10 15:04:35,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-10 15:04:35,674 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-10 15:04:35,674 INFO L263 TraceCheckUtils]: 3: Hoare triple {97234#true} call #t~ret9 := main(); {97234#true} is VALID [2020-07-10 15:04:35,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {97234#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {97234#true} is VALID [2020-07-10 15:04:35,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {97234#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {97234#true} is VALID [2020-07-10 15:04:35,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {97234#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {97234#true} is VALID [2020-07-10 15:04:35,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {97234#true} assume !(0 != ~p1~0); {97234#true} is VALID [2020-07-10 15:04:35,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {97234#true} assume !(0 != ~p2~0); {97234#true} is VALID [2020-07-10 15:04:35,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {97234#true} assume !(0 != ~p3~0); {97234#true} is VALID [2020-07-10 15:04:35,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {97234#true} assume !(0 != ~p4~0); {97234#true} is VALID [2020-07-10 15:04:35,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {97234#true} assume !(0 != ~p5~0); {97234#true} is VALID [2020-07-10 15:04:35,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {97234#true} assume !(0 != ~p6~0); {97234#true} is VALID [2020-07-10 15:04:35,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {97234#true} assume !(0 != ~p7~0); {97234#true} is VALID [2020-07-10 15:04:35,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {97234#true} assume 0 != ~p8~0;~lk8~0 := 1; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,677 INFO L280 TraceCheckUtils]: 15: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,677 INFO L280 TraceCheckUtils]: 16: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,678 INFO L280 TraceCheckUtils]: 17: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,678 INFO L280 TraceCheckUtils]: 18: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,678 INFO L280 TraceCheckUtils]: 19: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,679 INFO L280 TraceCheckUtils]: 20: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,679 INFO L280 TraceCheckUtils]: 21: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,680 INFO L280 TraceCheckUtils]: 22: Hoare triple {97238#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:35,680 INFO L280 TraceCheckUtils]: 23: Hoare triple {97238#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {97235#false} is VALID [2020-07-10 15:04:35,680 INFO L280 TraceCheckUtils]: 24: Hoare triple {97235#false} assume !false; {97235#false} is VALID [2020-07-10 15:04:35,681 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:04:35,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350717200] [2020-07-10 15:04:35,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:35,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:35,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897061066] [2020-07-10 15:04:35,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:35,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:35,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:35,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:35,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:35,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:35,708 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2020-07-10 15:04:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:36,761 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-10 15:04:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:04:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-10 15:04:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-10 15:04:36,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2020-07-10 15:04:36,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:36,818 INFO L225 Difference]: With dead ends: 3016 [2020-07-10 15:04:36,818 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:04:36,823 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:04:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:04:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:04:36,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:36,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:36,824 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:36,824 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:36,824 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:04:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:36,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:36,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:36,824 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:36,825 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:36,825 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:04:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:36,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:36,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:36,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:36,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:04:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:04:36,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-10 15:04:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:36,826 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:04:36,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:36,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:36,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 15:04:36,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:04:36,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:04:36,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:04:36,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:04:36,859 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:04:36,859 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:04:36,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:04:36,859 INFO L268 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2020-07-10 15:04:36,859 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-10 15:04:36,859 INFO L268 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2020-07-10 15:04:36,860 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2020-07-10 15:04:36,861 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-10 15:04:36,861 INFO L268 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2020-07-10 15:04:36,861 INFO L268 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,861 INFO L268 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,861 INFO L268 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,861 INFO L268 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,862 INFO L268 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L268 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,863 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-10 15:04:36,864 INFO L268 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,864 INFO L268 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,864 INFO L268 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-07-10 15:04:36,864 INFO L268 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2020-07-10 15:04:36,864 INFO L268 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2020-07-10 15:04:36,870 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:04:36,870 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:04:36,870 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:04:36,871 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-10 15:04:36,872 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:04:36,873 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:04:36,874 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:04:36,874 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-10 15:04:36,876 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-10 15:04:36,877 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-10 15:04:36,878 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-10 15:04:36,878 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:04:36,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:04:36 BoogieIcfgContainer [2020-07-10 15:04:36,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:04:36,890 INFO L168 Benchmark]: Toolchain (without parser) took 30894.05 ms. Allocated memory was 139.5 MB in the beginning and 461.4 MB in the end (delta: 321.9 MB). Free memory was 103.9 MB in the beginning and 363.6 MB in the end (delta: -259.7 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:36,890 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 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:04:36,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.87 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 92.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:36,891 INFO L168 Benchmark]: Boogie Preprocessor took 129.77 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:36,892 INFO L168 Benchmark]: RCFGBuilder took 594.37 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 154.1 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:36,892 INFO L168 Benchmark]: TraceAbstraction took 29757.64 ms. Allocated memory was 202.9 MB in the beginning and 461.4 MB in the end (delta: 258.5 MB). Free memory was 153.5 MB in the beginning and 363.6 MB in the end (delta: -210.2 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:36,894 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 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 406.87 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 92.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.77 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 594.37 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 154.1 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29757.64 ms. Allocated memory was 202.9 MB in the beginning and 461.4 MB in the end (delta: 258.5 MB). Free memory was 153.5 MB in the beginning and 363.6 MB in the end (delta: -210.2 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...