/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:30,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:30,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:30,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:30,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:30,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:30,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:30,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:30,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:30,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:30,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:30,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:30,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:30,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:30,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:30,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:30,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:30,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:30,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:30,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:30,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:30,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:30,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:30,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:30,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:30,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:30,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:30,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:30,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:30,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:30,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:30,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:30,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:30,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:30,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:30,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:30,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:30,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:30,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:30,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:30,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:30,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:03:30,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:30,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:30,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:30,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:30,791 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:30,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:30,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:30,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:30,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:30,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:30,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:30,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:30,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:30,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:30,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:30,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:30,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:30,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:30,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:30,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:31,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:31,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:31,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:31,105 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:31,106 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:31,106 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2020-07-10 15:03:31,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34bc13de/0e75de32ba4f4b8091c557579b0a32e8/FLAG5e5f9116f [2020-07-10 15:03:31,612 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:31,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2020-07-10 15:03:31,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34bc13de/0e75de32ba4f4b8091c557579b0a32e8/FLAG5e5f9116f [2020-07-10 15:03:31,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34bc13de/0e75de32ba4f4b8091c557579b0a32e8 [2020-07-10 15:03:31,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:31,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:31,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:31,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:31,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:31,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:31" (1/1) ... [2020-07-10 15:03:31,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d1e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:31, skipping insertion in model container [2020-07-10 15:03:31,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:31" (1/1) ... [2020-07-10 15:03:31,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:32,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:32,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:32,199 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:32,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:32,244 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:32,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32 WrapperNode [2020-07-10 15:03:32,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:32,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:32,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:32,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:32,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:32,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:32,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:32,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:32,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:32,930 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:32,931 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:32,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:32 BoogieIcfgContainer [2020-07-10 15:03:32,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:32,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:32,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:32,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:32,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:31" (1/3) ... [2020-07-10 15:03:32,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413c3ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:32, skipping insertion in model container [2020-07-10 15:03:32,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32" (2/3) ... [2020-07-10 15:03:32,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413c3ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:32, skipping insertion in model container [2020-07-10 15:03:32,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:32" (3/3) ... [2020-07-10 15:03:32,945 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2020-07-10 15:03:32,956 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:32,963 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:32,976 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:33,000 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:33,000 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:33,001 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:33,001 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:33,001 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:33,001 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:33,001 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:33,002 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-10 15:03:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:03:33,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:33,029 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:03:33,030 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2020-07-10 15:03:33,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:33,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886271544] [2020-07-10 15:03:33,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-10 15:03:33,301 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-10 15:03:33,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2020-07-10 15:03:33,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-10 15:03:33,305 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-10 15:03:33,305 INFO L263 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret12 := main(); {50#true} is VALID [2020-07-10 15:03:33,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {50#true} is VALID [2020-07-10 15:03:33,306 INFO L280 TraceCheckUtils]: 5: Hoare triple {50#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {50#true} is VALID [2020-07-10 15:03:33,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {50#true} is VALID [2020-07-10 15:03:33,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} assume 0 != ~p1~0;~lk1~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,310 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,314 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {54#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:33,322 INFO L280 TraceCheckUtils]: 19: Hoare triple {54#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {51#false} is VALID [2020-07-10 15:03:33,322 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-10 15:03:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:33,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886271544] [2020-07-10 15:03:33,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:33,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:33,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222526578] [2020-07-10 15:03:33,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:33,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:33,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:33,387 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:03:33,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:33,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:33,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:33,402 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-07-10 15:03:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,629 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-07-10 15:03:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:33,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:33,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:03:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:03:33,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-10 15:03:33,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:33,886 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:03:33,887 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 15:03:33,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 15:03:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2020-07-10 15:03:33,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:33,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 54 states. [2020-07-10 15:03:33,933 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 54 states. [2020-07-10 15:03:33,933 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 54 states. [2020-07-10 15:03:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,942 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-10 15:03:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-10 15:03:33,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:33,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:33,944 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 78 states. [2020-07-10 15:03:33,944 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 78 states. [2020-07-10 15:03:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,953 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-10 15:03:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-10 15:03:33,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:33,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:33,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:33,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:03:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2020-07-10 15:03:33,961 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2020-07-10 15:03:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:33,962 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2020-07-10 15:03:33,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2020-07-10 15:03:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:03:33,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:33,963 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:03:33,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:33,964 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2020-07-10 15:03:33,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:33,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516007220] [2020-07-10 15:03:33,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-10 15:03:34,044 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-10 15:03:34,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2020-07-10 15:03:34,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-10 15:03:34,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-10 15:03:34,046 INFO L263 TraceCheckUtils]: 3: Hoare triple {378#true} call #t~ret12 := main(); {378#true} is VALID [2020-07-10 15:03:34,046 INFO L280 TraceCheckUtils]: 4: Hoare triple {378#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {378#true} is VALID [2020-07-10 15:03:34,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {378#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {378#true} is VALID [2020-07-10 15:03:34,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {378#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {378#true} is VALID [2020-07-10 15:03:34,047 INFO L280 TraceCheckUtils]: 7: Hoare triple {378#true} assume !(0 != ~p1~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,053 INFO L280 TraceCheckUtils]: 12: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,054 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,055 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,056 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:34,059 INFO L280 TraceCheckUtils]: 18: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p1~0; {379#false} is VALID [2020-07-10 15:03:34,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {379#false} assume 1 != ~lk1~0; {379#false} is VALID [2020-07-10 15:03:34,060 INFO L280 TraceCheckUtils]: 20: Hoare triple {379#false} assume !false; {379#false} is VALID [2020-07-10 15:03:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:34,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516007220] [2020-07-10 15:03:34,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:34,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:34,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216701707] [2020-07-10 15:03:34,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:34,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:34,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:34,088 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:03:34,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:34,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:34,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:34,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,090 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2020-07-10 15:03:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,243 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2020-07-10 15:03:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:34,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-10 15:03:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-10 15:03:34,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2020-07-10 15:03:34,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:34,502 INFO L225 Difference]: With dead ends: 127 [2020-07-10 15:03:34,503 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 15:03:34,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 15:03:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-10 15:03:34,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:34,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:34,518 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:34,518 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-10 15:03:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,524 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-10 15:03:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-10 15:03:34,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:34,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:34,526 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-10 15:03:34,526 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-10 15:03:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,532 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-10 15:03:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-10 15:03:34,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:34,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:34,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:34,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 15:03:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2020-07-10 15:03:34,539 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2020-07-10 15:03:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:34,539 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2020-07-10 15:03:34,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2020-07-10 15:03:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:34,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:34,541 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:03:34,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:34,541 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2020-07-10 15:03:34,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:34,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010753031] [2020-07-10 15:03:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-10 15:03:34,602 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-10 15:03:34,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2020-07-10 15:03:34,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-10 15:03:34,603 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-10 15:03:34,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {761#true} call #t~ret12 := main(); {761#true} is VALID [2020-07-10 15:03:34,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {761#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {761#true} is VALID [2020-07-10 15:03:34,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {761#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {761#true} is VALID [2020-07-10 15:03:34,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {761#true} is VALID [2020-07-10 15:03:34,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {761#true} assume 0 != ~p1~0;~lk1~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,611 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,612 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,613 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p11~0;~lk11~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {762#false} is VALID [2020-07-10 15:03:34,615 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#false} assume 0 != ~p2~0; {762#false} is VALID [2020-07-10 15:03:34,615 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#false} assume 1 != ~lk2~0; {762#false} is VALID [2020-07-10 15:03:34,615 INFO L280 TraceCheckUtils]: 21: Hoare triple {762#false} assume !false; {762#false} is VALID [2020-07-10 15:03:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:34,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010753031] [2020-07-10 15:03:34,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:34,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:34,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609467520] [2020-07-10 15:03:34,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:34,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:34,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:34,655 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:03:34,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:34,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,656 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2020-07-10 15:03:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,814 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2020-07-10 15:03:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:34,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-10 15:03:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-10 15:03:34,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2020-07-10 15:03:35,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,024 INFO L225 Difference]: With dead ends: 117 [2020-07-10 15:03:35,024 INFO L226 Difference]: Without dead ends: 81 [2020-07-10 15:03:35,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-10 15:03:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-07-10 15:03:35,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2020-07-10 15:03:35,036 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2020-07-10 15:03:35,037 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2020-07-10 15:03:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,041 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-10 15:03:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-10 15:03:35,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,042 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2020-07-10 15:03:35,043 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2020-07-10 15:03:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,047 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-10 15:03:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-10 15:03:35,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 15:03:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2020-07-10 15:03:35,053 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2020-07-10 15:03:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,053 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2020-07-10 15:03:35,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2020-07-10 15:03:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:35,054 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,054 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:03:35,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:35,055 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2020-07-10 15:03:35,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047669497] [2020-07-10 15:03:35,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 15:03:35,105 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-10 15:03:35,106 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-10 15:03:35,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 15:03:35,106 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-10 15:03:35,106 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret12 := main(); {1145#true} is VALID [2020-07-10 15:03:35,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1145#true} is VALID [2020-07-10 15:03:35,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1145#true} is VALID [2020-07-10 15:03:35,107 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1145#true} is VALID [2020-07-10 15:03:35,108 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} assume !(0 != ~p1~0); {1145#true} is VALID [2020-07-10 15:03:35,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume 0 != ~p2~0;~lk2~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,109 INFO L280 TraceCheckUtils]: 9: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,110 INFO L280 TraceCheckUtils]: 10: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,110 INFO L280 TraceCheckUtils]: 11: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,111 INFO L280 TraceCheckUtils]: 12: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,112 INFO L280 TraceCheckUtils]: 13: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,112 INFO L280 TraceCheckUtils]: 14: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,114 INFO L280 TraceCheckUtils]: 16: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,114 INFO L280 TraceCheckUtils]: 17: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,115 INFO L280 TraceCheckUtils]: 18: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:35,116 INFO L280 TraceCheckUtils]: 20: Hoare triple {1149#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1146#false} is VALID [2020-07-10 15:03:35,116 INFO L280 TraceCheckUtils]: 21: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-10 15:03:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:35,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047669497] [2020-07-10 15:03:35,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:35,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151052166] [2020-07-10 15:03:35,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:35,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:35,144 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:03:35,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:35,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:35,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,146 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2020-07-10 15:03:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,291 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2020-07-10 15:03:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:35,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:03:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:03:35,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-10 15:03:35,445 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:03:35,452 INFO L225 Difference]: With dead ends: 148 [2020-07-10 15:03:35,455 INFO L226 Difference]: Without dead ends: 146 [2020-07-10 15:03:35,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-10 15:03:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2020-07-10 15:03:35,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 104 states. [2020-07-10 15:03:35,482 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 104 states. [2020-07-10 15:03:35,483 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 104 states. [2020-07-10 15:03:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,492 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-10 15:03:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-10 15:03:35,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,493 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 146 states. [2020-07-10 15:03:35,494 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 146 states. [2020-07-10 15:03:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,502 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-10 15:03:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-10 15:03:35,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-10 15:03:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2020-07-10 15:03:35,509 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2020-07-10 15:03:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,509 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2020-07-10 15:03:35,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2020-07-10 15:03:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:35,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,511 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:03:35,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:35,511 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2020-07-10 15:03:35,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265760672] [2020-07-10 15:03:35,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 15:03:35,596 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-10 15:03:35,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-10 15:03:35,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-10 15:03:35,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-10 15:03:35,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret12 := main(); {1716#true} is VALID [2020-07-10 15:03:35,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1716#true} is VALID [2020-07-10 15:03:35,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1716#true} is VALID [2020-07-10 15:03:35,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1716#true} is VALID [2020-07-10 15:03:35,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} assume !(0 != ~p1~0); {1716#true} is VALID [2020-07-10 15:03:35,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume !(0 != ~p2~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,603 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,603 INFO L280 TraceCheckUtils]: 15: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,604 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,604 INFO L280 TraceCheckUtils]: 17: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,605 INFO L280 TraceCheckUtils]: 18: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:35,606 INFO L280 TraceCheckUtils]: 19: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1717#false} is VALID [2020-07-10 15:03:35,606 INFO L280 TraceCheckUtils]: 20: Hoare triple {1717#false} assume 1 != ~lk2~0; {1717#false} is VALID [2020-07-10 15:03:35,606 INFO L280 TraceCheckUtils]: 21: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-10 15:03:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:35,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265760672] [2020-07-10 15:03:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:35,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:35,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757747627] [2020-07-10 15:03:35,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:35,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:35,641 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:03:35,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:35,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,643 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2020-07-10 15:03:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,796 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2020-07-10 15:03:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:35,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-10 15:03:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-10 15:03:35,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2020-07-10 15:03:35,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,993 INFO L225 Difference]: With dead ends: 244 [2020-07-10 15:03:35,994 INFO L226 Difference]: Without dead ends: 148 [2020-07-10 15:03:35,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-10 15:03:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2020-07-10 15:03:36,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2020-07-10 15:03:36,010 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2020-07-10 15:03:36,011 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2020-07-10 15:03:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,017 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-10 15:03:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-10 15:03:36,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,018 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2020-07-10 15:03:36,018 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2020-07-10 15:03:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,024 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-10 15:03:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-10 15:03:36,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-10 15:03:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2020-07-10 15:03:36,031 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2020-07-10 15:03:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,032 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2020-07-10 15:03:36,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2020-07-10 15:03:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:36,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,033 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:03:36,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:36,033 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2020-07-10 15:03:36,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125276092] [2020-07-10 15:03:36,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-10 15:03:36,068 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-10 15:03:36,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {2433#true} call ULTIMATE.init(); {2433#true} is VALID [2020-07-10 15:03:36,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-10 15:03:36,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-10 15:03:36,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {2433#true} call #t~ret12 := main(); {2433#true} is VALID [2020-07-10 15:03:36,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {2433#true} is VALID [2020-07-10 15:03:36,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {2433#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2433#true} is VALID [2020-07-10 15:03:36,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {2433#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {2433#true} is VALID [2020-07-10 15:03:36,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#true} assume !(0 != ~p1~0); {2433#true} is VALID [2020-07-10 15:03:36,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {2433#true} assume 0 != ~p2~0;~lk2~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,074 INFO L280 TraceCheckUtils]: 13: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p11~0;~lk11~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,077 INFO L280 TraceCheckUtils]: 18: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:36,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2434#false} is VALID [2020-07-10 15:03:36,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {2434#false} assume 0 != ~p3~0; {2434#false} is VALID [2020-07-10 15:03:36,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {2434#false} assume 1 != ~lk3~0; {2434#false} is VALID [2020-07-10 15:03:36,079 INFO L280 TraceCheckUtils]: 22: Hoare triple {2434#false} assume !false; {2434#false} is VALID [2020-07-10 15:03:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:36,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125276092] [2020-07-10 15:03:36,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:36,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:36,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353587125] [2020-07-10 15:03:36,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:36,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:36,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:36,107 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:03:36,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:36,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,108 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2020-07-10 15:03:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,267 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2020-07-10 15:03:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:36,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-10 15:03:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-10 15:03:36,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2020-07-10 15:03:36,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:36,467 INFO L225 Difference]: With dead ends: 219 [2020-07-10 15:03:36,468 INFO L226 Difference]: Without dead ends: 150 [2020-07-10 15:03:36,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-10 15:03:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-07-10 15:03:36,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2020-07-10 15:03:36,511 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2020-07-10 15:03:36,511 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2020-07-10 15:03:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,520 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-10 15:03:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-10 15:03:36,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,521 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2020-07-10 15:03:36,521 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2020-07-10 15:03:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,539 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-10 15:03:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-10 15:03:36,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-10 15:03:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2020-07-10 15:03:36,551 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2020-07-10 15:03:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,554 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2020-07-10 15:03:36,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2020-07-10 15:03:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:36,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,555 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:03:36,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:03:36,556 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2020-07-10 15:03:36,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178317910] [2020-07-10 15:03:36,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-10 15:03:36,629 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-10 15:03:36,629 INFO L263 TraceCheckUtils]: 0: Hoare triple {3131#true} call ULTIMATE.init(); {3131#true} is VALID [2020-07-10 15:03:36,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-10 15:03:36,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-10 15:03:36,630 INFO L263 TraceCheckUtils]: 3: Hoare triple {3131#true} call #t~ret12 := main(); {3131#true} is VALID [2020-07-10 15:03:36,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {3131#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {3131#true} is VALID [2020-07-10 15:03:36,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {3131#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3131#true} is VALID [2020-07-10 15:03:36,631 INFO L280 TraceCheckUtils]: 6: Hoare triple {3131#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {3131#true} is VALID [2020-07-10 15:03:36,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {3131#true} assume !(0 != ~p1~0); {3131#true} is VALID [2020-07-10 15:03:36,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {3131#true} assume !(0 != ~p2~0); {3131#true} is VALID [2020-07-10 15:03:36,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {3131#true} assume 0 != ~p3~0;~lk3~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,639 INFO L280 TraceCheckUtils]: 12: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,640 INFO L280 TraceCheckUtils]: 13: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,640 INFO L280 TraceCheckUtils]: 14: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,641 INFO L280 TraceCheckUtils]: 16: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,645 INFO L280 TraceCheckUtils]: 20: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:36,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {3135#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {3132#false} is VALID [2020-07-10 15:03:36,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {3132#false} assume !false; {3132#false} is VALID [2020-07-10 15:03:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:36,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178317910] [2020-07-10 15:03:36,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:36,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:36,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864326862] [2020-07-10 15:03:36,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:36,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:36,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:36,676 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:03:36,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:36,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,677 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2020-07-10 15:03:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,825 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2020-07-10 15:03:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:36,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 15:03:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 15:03:36,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-10 15:03:36,937 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:03:36,944 INFO L225 Difference]: With dead ends: 276 [2020-07-10 15:03:36,944 INFO L226 Difference]: Without dead ends: 274 [2020-07-10 15:03:36,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-07-10 15:03:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2020-07-10 15:03:36,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 200 states. [2020-07-10 15:03:36,967 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 200 states. [2020-07-10 15:03:36,967 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 200 states. [2020-07-10 15:03:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,976 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-10 15:03:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-10 15:03:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,977 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 274 states. [2020-07-10 15:03:36,977 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 274 states. [2020-07-10 15:03:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,987 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-10 15:03:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-10 15:03:36,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-10 15:03:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2020-07-10 15:03:36,996 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2020-07-10 15:03:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,996 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2020-07-10 15:03:36,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2020-07-10 15:03:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:36,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,998 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:03:36,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:03:36,998 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2020-07-10 15:03:36,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883942679] [2020-07-10 15:03:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-10 15:03:37,030 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-10 15:03:37,030 INFO L263 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2020-07-10 15:03:37,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-10 15:03:37,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-10 15:03:37,031 INFO L263 TraceCheckUtils]: 3: Hoare triple {4188#true} call #t~ret12 := main(); {4188#true} is VALID [2020-07-10 15:03:37,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {4188#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {4188#true} is VALID [2020-07-10 15:03:37,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {4188#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4188#true} is VALID [2020-07-10 15:03:37,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {4188#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {4188#true} is VALID [2020-07-10 15:03:37,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {4188#true} assume !(0 != ~p1~0); {4188#true} is VALID [2020-07-10 15:03:37,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 != ~p2~0); {4188#true} is VALID [2020-07-10 15:03:37,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {4188#true} assume !(0 != ~p3~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,036 INFO L280 TraceCheckUtils]: 14: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,037 INFO L280 TraceCheckUtils]: 15: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,037 INFO L280 TraceCheckUtils]: 16: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,039 INFO L280 TraceCheckUtils]: 18: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,039 INFO L280 TraceCheckUtils]: 19: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:37,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4189#false} is VALID [2020-07-10 15:03:37,040 INFO L280 TraceCheckUtils]: 21: Hoare triple {4189#false} assume 1 != ~lk3~0; {4189#false} is VALID [2020-07-10 15:03:37,041 INFO L280 TraceCheckUtils]: 22: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2020-07-10 15:03:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:37,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883942679] [2020-07-10 15:03:37,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:37,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:37,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169038910] [2020-07-10 15:03:37,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:37,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:37,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:37,067 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:03:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:37,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,068 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2020-07-10 15:03:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,231 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2020-07-10 15:03:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:37,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-10 15:03:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-10 15:03:37,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2020-07-10 15:03:37,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:37,430 INFO L225 Difference]: With dead ends: 472 [2020-07-10 15:03:37,430 INFO L226 Difference]: Without dead ends: 282 [2020-07-10 15:03:37,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-10 15:03:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2020-07-10 15:03:37,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:37,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 280 states. [2020-07-10 15:03:37,466 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 280 states. [2020-07-10 15:03:37,466 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 280 states. [2020-07-10 15:03:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,474 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-10 15:03:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-10 15:03:37,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,476 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 282 states. [2020-07-10 15:03:37,476 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 282 states. [2020-07-10 15:03:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,484 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-10 15:03:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-10 15:03:37,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:37,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-07-10 15:03:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2020-07-10 15:03:37,493 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2020-07-10 15:03:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:37,493 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2020-07-10 15:03:37,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2020-07-10 15:03:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:37,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:37,495 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:03:37,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:03:37,495 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2020-07-10 15:03:37,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:37,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286932766] [2020-07-10 15:03:37,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-10 15:03:37,523 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-10 15:03:37,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {5545#true} call ULTIMATE.init(); {5545#true} is VALID [2020-07-10 15:03:37,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-10 15:03:37,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-10 15:03:37,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {5545#true} call #t~ret12 := main(); {5545#true} is VALID [2020-07-10 15:03:37,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {5545#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {5545#true} is VALID [2020-07-10 15:03:37,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {5545#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {5545#true} is VALID [2020-07-10 15:03:37,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {5545#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {5545#true} is VALID [2020-07-10 15:03:37,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {5545#true} assume !(0 != ~p1~0); {5545#true} is VALID [2020-07-10 15:03:37,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {5545#true} assume !(0 != ~p2~0); {5545#true} is VALID [2020-07-10 15:03:37,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {5545#true} assume 0 != ~p3~0;~lk3~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,528 INFO L280 TraceCheckUtils]: 13: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p10~0;~lk10~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p11~0;~lk11~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:37,532 INFO L280 TraceCheckUtils]: 20: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5546#false} is VALID [2020-07-10 15:03:37,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {5546#false} assume 0 != ~p4~0; {5546#false} is VALID [2020-07-10 15:03:37,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {5546#false} assume 1 != ~lk4~0; {5546#false} is VALID [2020-07-10 15:03:37,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {5546#false} assume !false; {5546#false} is VALID [2020-07-10 15:03:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:37,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286932766] [2020-07-10 15:03:37,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:37,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025716082] [2020-07-10 15:03:37,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:37,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:37,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:37,557 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:03:37,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:37,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,559 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2020-07-10 15:03:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,710 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2020-07-10 15:03:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:37,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-10 15:03:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-10 15:03:37,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-10 15:03:37,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:37,927 INFO L225 Difference]: With dead ends: 420 [2020-07-10 15:03:37,928 INFO L226 Difference]: Without dead ends: 286 [2020-07-10 15:03:37,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-07-10 15:03:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2020-07-10 15:03:37,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:37,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2020-07-10 15:03:37,959 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2020-07-10 15:03:37,960 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2020-07-10 15:03:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,968 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-10 15:03:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-10 15:03:37,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,969 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2020-07-10 15:03:37,969 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2020-07-10 15:03:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,984 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-10 15:03:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-10 15:03:37,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:37,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-07-10 15:03:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2020-07-10 15:03:37,995 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2020-07-10 15:03:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:37,998 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2020-07-10 15:03:37,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2020-07-10 15:03:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:37,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:37,999 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:03:37,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:03:37,999 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2020-07-10 15:03:38,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:38,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105215326] [2020-07-10 15:03:38,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-10 15:03:38,061 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-10 15:03:38,062 INFO L263 TraceCheckUtils]: 0: Hoare triple {6862#true} call ULTIMATE.init(); {6862#true} is VALID [2020-07-10 15:03:38,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-10 15:03:38,062 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-10 15:03:38,062 INFO L263 TraceCheckUtils]: 3: Hoare triple {6862#true} call #t~ret12 := main(); {6862#true} is VALID [2020-07-10 15:03:38,063 INFO L280 TraceCheckUtils]: 4: Hoare triple {6862#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {6862#true} is VALID [2020-07-10 15:03:38,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {6862#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6862#true} is VALID [2020-07-10 15:03:38,063 INFO L280 TraceCheckUtils]: 6: Hoare triple {6862#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {6862#true} is VALID [2020-07-10 15:03:38,063 INFO L280 TraceCheckUtils]: 7: Hoare triple {6862#true} assume !(0 != ~p1~0); {6862#true} is VALID [2020-07-10 15:03:38,064 INFO L280 TraceCheckUtils]: 8: Hoare triple {6862#true} assume !(0 != ~p2~0); {6862#true} is VALID [2020-07-10 15:03:38,064 INFO L280 TraceCheckUtils]: 9: Hoare triple {6862#true} assume !(0 != ~p3~0); {6862#true} is VALID [2020-07-10 15:03:38,065 INFO L280 TraceCheckUtils]: 10: Hoare triple {6862#true} assume 0 != ~p4~0;~lk4~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,066 INFO L280 TraceCheckUtils]: 12: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,067 INFO L280 TraceCheckUtils]: 15: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,068 INFO L280 TraceCheckUtils]: 16: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,068 INFO L280 TraceCheckUtils]: 17: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,069 INFO L280 TraceCheckUtils]: 18: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,069 INFO L280 TraceCheckUtils]: 19: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,070 INFO L280 TraceCheckUtils]: 20: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,070 INFO L280 TraceCheckUtils]: 21: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,071 INFO L280 TraceCheckUtils]: 22: Hoare triple {6866#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6863#false} is VALID [2020-07-10 15:03:38,071 INFO L280 TraceCheckUtils]: 23: Hoare triple {6863#false} assume !false; {6863#false} is VALID [2020-07-10 15:03:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:38,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105215326] [2020-07-10 15:03:38,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:38,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:38,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876481902] [2020-07-10 15:03:38,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:38,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:38,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:38,094 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:03:38,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:38,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,095 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2020-07-10 15:03:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,262 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2020-07-10 15:03:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:38,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:03:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:03:38,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-10 15:03:38,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:38,404 INFO L225 Difference]: With dead ends: 524 [2020-07-10 15:03:38,405 INFO L226 Difference]: Without dead ends: 522 [2020-07-10 15:03:38,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-07-10 15:03:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2020-07-10 15:03:38,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:38,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 392 states. [2020-07-10 15:03:38,443 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 392 states. [2020-07-10 15:03:38,443 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 392 states. [2020-07-10 15:03:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,465 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-10 15:03:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-10 15:03:38,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,467 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 522 states. [2020-07-10 15:03:38,467 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 522 states. [2020-07-10 15:03:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,494 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-10 15:03:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-10 15:03:38,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:38,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-07-10 15:03:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2020-07-10 15:03:38,510 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2020-07-10 15:03:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:38,510 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2020-07-10 15:03:38,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2020-07-10 15:03:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:38,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:38,511 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:03:38,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:03:38,512 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:38,512 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2020-07-10 15:03:38,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:38,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868750008] [2020-07-10 15:03:38,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-10 15:03:38,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-10 15:03:38,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {8867#true} call ULTIMATE.init(); {8867#true} is VALID [2020-07-10 15:03:38,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-10 15:03:38,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-10 15:03:38,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {8867#true} call #t~ret12 := main(); {8867#true} is VALID [2020-07-10 15:03:38,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {8867#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {8867#true} is VALID [2020-07-10 15:03:38,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {8867#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8867#true} is VALID [2020-07-10 15:03:38,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {8867#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {8867#true} is VALID [2020-07-10 15:03:38,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {8867#true} assume !(0 != ~p1~0); {8867#true} is VALID [2020-07-10 15:03:38,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {8867#true} assume !(0 != ~p2~0); {8867#true} is VALID [2020-07-10 15:03:38,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {8867#true} assume !(0 != ~p3~0); {8867#true} is VALID [2020-07-10 15:03:38,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {8867#true} assume !(0 != ~p4~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,547 INFO L280 TraceCheckUtils]: 13: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,548 INFO L280 TraceCheckUtils]: 14: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,549 INFO L280 TraceCheckUtils]: 16: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,549 INFO L280 TraceCheckUtils]: 17: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,550 INFO L280 TraceCheckUtils]: 18: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,550 INFO L280 TraceCheckUtils]: 19: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,551 INFO L280 TraceCheckUtils]: 20: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:38,552 INFO L280 TraceCheckUtils]: 21: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8868#false} is VALID [2020-07-10 15:03:38,552 INFO L280 TraceCheckUtils]: 22: Hoare triple {8868#false} assume 1 != ~lk4~0; {8868#false} is VALID [2020-07-10 15:03:38,552 INFO L280 TraceCheckUtils]: 23: Hoare triple {8868#false} assume !false; {8868#false} is VALID [2020-07-10 15:03:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:38,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868750008] [2020-07-10 15:03:38,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:38,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:38,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493079807] [2020-07-10 15:03:38,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:38,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:38,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:38,577 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:03:38,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:38,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,579 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2020-07-10 15:03:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,805 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2020-07-10 15:03:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:38,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-10 15:03:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-10 15:03:38,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2020-07-10 15:03:39,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:39,036 INFO L225 Difference]: With dead ends: 924 [2020-07-10 15:03:39,037 INFO L226 Difference]: Without dead ends: 546 [2020-07-10 15:03:39,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-07-10 15:03:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2020-07-10 15:03:39,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:39,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand 544 states. [2020-07-10 15:03:39,107 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand 544 states. [2020-07-10 15:03:39,107 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 544 states. [2020-07-10 15:03:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,133 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-10 15:03:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-10 15:03:39,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,135 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand 546 states. [2020-07-10 15:03:39,135 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 546 states. [2020-07-10 15:03:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,158 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-10 15:03:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-10 15:03:39,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:39,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-10 15:03:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2020-07-10 15:03:39,184 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2020-07-10 15:03:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:39,184 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2020-07-10 15:03:39,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2020-07-10 15:03:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:39,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:39,187 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:03:39,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:03:39,188 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2020-07-10 15:03:39,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:39,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128379116] [2020-07-10 15:03:39,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-10 15:03:39,230 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-10 15:03:39,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {11488#true} call ULTIMATE.init(); {11488#true} is VALID [2020-07-10 15:03:39,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-10 15:03:39,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-10 15:03:39,231 INFO L263 TraceCheckUtils]: 3: Hoare triple {11488#true} call #t~ret12 := main(); {11488#true} is VALID [2020-07-10 15:03:39,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {11488#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {11488#true} is VALID [2020-07-10 15:03:39,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {11488#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {11488#true} is VALID [2020-07-10 15:03:39,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {11488#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {11488#true} is VALID [2020-07-10 15:03:39,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {11488#true} assume !(0 != ~p1~0); {11488#true} is VALID [2020-07-10 15:03:39,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {11488#true} assume !(0 != ~p2~0); {11488#true} is VALID [2020-07-10 15:03:39,232 INFO L280 TraceCheckUtils]: 9: Hoare triple {11488#true} assume !(0 != ~p3~0); {11488#true} is VALID [2020-07-10 15:03:39,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {11488#true} assume 0 != ~p4~0;~lk4~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,233 INFO L280 TraceCheckUtils]: 11: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,234 INFO L280 TraceCheckUtils]: 12: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,234 INFO L280 TraceCheckUtils]: 13: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,235 INFO L280 TraceCheckUtils]: 14: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,236 INFO L280 TraceCheckUtils]: 15: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,236 INFO L280 TraceCheckUtils]: 16: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p10~0;~lk10~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,237 INFO L280 TraceCheckUtils]: 17: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p11~0;~lk11~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,240 INFO L280 TraceCheckUtils]: 20: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:03:39,240 INFO L280 TraceCheckUtils]: 21: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {11489#false} is VALID [2020-07-10 15:03:39,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {11489#false} assume 0 != ~p5~0; {11489#false} is VALID [2020-07-10 15:03:39,241 INFO L280 TraceCheckUtils]: 23: Hoare triple {11489#false} assume 1 != ~lk5~0; {11489#false} is VALID [2020-07-10 15:03:39,241 INFO L280 TraceCheckUtils]: 24: Hoare triple {11489#false} assume !false; {11489#false} is VALID [2020-07-10 15:03:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:39,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128379116] [2020-07-10 15:03:39,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:39,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:39,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612562506] [2020-07-10 15:03:39,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:39,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:39,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:39,269 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:03:39,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:39,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,270 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2020-07-10 15:03:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,485 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2020-07-10 15:03:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:39,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-10 15:03:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-10 15:03:39,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2020-07-10 15:03:39,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:39,689 INFO L225 Difference]: With dead ends: 816 [2020-07-10 15:03:39,689 INFO L226 Difference]: Without dead ends: 554 [2020-07-10 15:03:39,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-10 15:03:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2020-07-10 15:03:39,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:39,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand 552 states. [2020-07-10 15:03:39,764 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand 552 states. [2020-07-10 15:03:39,764 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 552 states. [2020-07-10 15:03:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,786 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-10 15:03:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-10 15:03:39,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,788 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand 554 states. [2020-07-10 15:03:39,789 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 554 states. [2020-07-10 15:03:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,810 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-10 15:03:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-10 15:03:39,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:39,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-10 15:03:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2020-07-10 15:03:39,834 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2020-07-10 15:03:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:39,834 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2020-07-10 15:03:39,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2020-07-10 15:03:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:39,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:39,836 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:03:39,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:03:39,836 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2020-07-10 15:03:39,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:39,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46028758] [2020-07-10 15:03:39,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-10 15:03:39,873 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-10 15:03:39,874 INFO L263 TraceCheckUtils]: 0: Hoare triple {14025#true} call ULTIMATE.init(); {14025#true} is VALID [2020-07-10 15:03:39,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-10 15:03:39,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-10 15:03:39,874 INFO L263 TraceCheckUtils]: 3: Hoare triple {14025#true} call #t~ret12 := main(); {14025#true} is VALID [2020-07-10 15:03:39,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {14025#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {14025#true} is VALID [2020-07-10 15:03:39,875 INFO L280 TraceCheckUtils]: 5: Hoare triple {14025#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {14025#true} is VALID [2020-07-10 15:03:39,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {14025#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {14025#true} is VALID [2020-07-10 15:03:39,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {14025#true} assume !(0 != ~p1~0); {14025#true} is VALID [2020-07-10 15:03:39,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {14025#true} assume !(0 != ~p2~0); {14025#true} is VALID [2020-07-10 15:03:39,876 INFO L280 TraceCheckUtils]: 9: Hoare triple {14025#true} assume !(0 != ~p3~0); {14025#true} is VALID [2020-07-10 15:03:39,876 INFO L280 TraceCheckUtils]: 10: Hoare triple {14025#true} assume !(0 != ~p4~0); {14025#true} is VALID [2020-07-10 15:03:39,878 INFO L280 TraceCheckUtils]: 11: Hoare triple {14025#true} assume 0 != ~p5~0;~lk5~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,879 INFO L280 TraceCheckUtils]: 12: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,879 INFO L280 TraceCheckUtils]: 13: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,880 INFO L280 TraceCheckUtils]: 14: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,880 INFO L280 TraceCheckUtils]: 15: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,881 INFO L280 TraceCheckUtils]: 16: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,881 INFO L280 TraceCheckUtils]: 17: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,882 INFO L280 TraceCheckUtils]: 18: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,883 INFO L280 TraceCheckUtils]: 19: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,883 INFO L280 TraceCheckUtils]: 20: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,884 INFO L280 TraceCheckUtils]: 22: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:39,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {14029#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {14026#false} is VALID [2020-07-10 15:03:39,885 INFO L280 TraceCheckUtils]: 24: Hoare triple {14026#false} assume !false; {14026#false} is VALID [2020-07-10 15:03:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:39,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46028758] [2020-07-10 15:03:39,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:39,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:39,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359193880] [2020-07-10 15:03:39,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:39,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:39,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:39,914 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:03:39,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:39,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,915 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2020-07-10 15:03:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,219 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2020-07-10 15:03:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:40,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:03:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:03:40,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-10 15:03:40,348 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:03:40,406 INFO L225 Difference]: With dead ends: 1004 [2020-07-10 15:03:40,407 INFO L226 Difference]: Without dead ends: 1002 [2020-07-10 15:03:40,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-07-10 15:03:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2020-07-10 15:03:40,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:40,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1002 states. Second operand 776 states. [2020-07-10 15:03:40,486 INFO L74 IsIncluded]: Start isIncluded. First operand 1002 states. Second operand 776 states. [2020-07-10 15:03:40,486 INFO L87 Difference]: Start difference. First operand 1002 states. Second operand 776 states. [2020-07-10 15:03:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,543 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-10 15:03:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-10 15:03:40,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:40,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:40,547 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 1002 states. [2020-07-10 15:03:40,547 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 1002 states. [2020-07-10 15:03:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,603 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-10 15:03:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-10 15:03:40,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:40,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:40,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:40,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-10 15:03:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2020-07-10 15:03:40,645 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2020-07-10 15:03:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:40,646 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2020-07-10 15:03:40,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2020-07-10 15:03:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:40,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:40,648 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:03:40,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:03:40,648 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2020-07-10 15:03:40,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:40,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364567242] [2020-07-10 15:03:40,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-10 15:03:40,676 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-10 15:03:40,676 INFO L263 TraceCheckUtils]: 0: Hoare triple {17878#true} call ULTIMATE.init(); {17878#true} is VALID [2020-07-10 15:03:40,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-10 15:03:40,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-10 15:03:40,677 INFO L263 TraceCheckUtils]: 3: Hoare triple {17878#true} call #t~ret12 := main(); {17878#true} is VALID [2020-07-10 15:03:40,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {17878#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {17878#true} is VALID [2020-07-10 15:03:40,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {17878#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {17878#true} is VALID [2020-07-10 15:03:40,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {17878#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {17878#true} is VALID [2020-07-10 15:03:40,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {17878#true} assume !(0 != ~p1~0); {17878#true} is VALID [2020-07-10 15:03:40,678 INFO L280 TraceCheckUtils]: 8: Hoare triple {17878#true} assume !(0 != ~p2~0); {17878#true} is VALID [2020-07-10 15:03:40,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {17878#true} assume !(0 != ~p3~0); {17878#true} is VALID [2020-07-10 15:03:40,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {17878#true} assume !(0 != ~p4~0); {17878#true} is VALID [2020-07-10 15:03:40,679 INFO L280 TraceCheckUtils]: 11: Hoare triple {17878#true} assume !(0 != ~p5~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,679 INFO L280 TraceCheckUtils]: 12: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,680 INFO L280 TraceCheckUtils]: 13: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,680 INFO L280 TraceCheckUtils]: 14: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,681 INFO L280 TraceCheckUtils]: 15: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,682 INFO L280 TraceCheckUtils]: 17: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,683 INFO L280 TraceCheckUtils]: 18: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,683 INFO L280 TraceCheckUtils]: 19: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,684 INFO L280 TraceCheckUtils]: 20: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,684 INFO L280 TraceCheckUtils]: 21: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:40,685 INFO L280 TraceCheckUtils]: 22: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17879#false} is VALID [2020-07-10 15:03:40,685 INFO L280 TraceCheckUtils]: 23: Hoare triple {17879#false} assume 1 != ~lk5~0; {17879#false} is VALID [2020-07-10 15:03:40,685 INFO L280 TraceCheckUtils]: 24: Hoare triple {17879#false} assume !false; {17879#false} is VALID [2020-07-10 15:03:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:40,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364567242] [2020-07-10 15:03:40,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:40,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:40,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399777632] [2020-07-10 15:03:40,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:40,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:40,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:40,709 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:03:40,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:40,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:40,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:40,710 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2020-07-10 15:03:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,135 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2020-07-10 15:03:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:41,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-10 15:03:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-10 15:03:41,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2020-07-10 15:03:41,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:41,367 INFO L225 Difference]: With dead ends: 1820 [2020-07-10 15:03:41,367 INFO L226 Difference]: Without dead ends: 1066 [2020-07-10 15:03:41,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-07-10 15:03:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2020-07-10 15:03:41,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:41,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand 1064 states. [2020-07-10 15:03:41,505 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand 1064 states. [2020-07-10 15:03:41,505 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand 1064 states. [2020-07-10 15:03:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,571 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-10 15:03:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-10 15:03:41,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:41,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:41,574 INFO L74 IsIncluded]: Start isIncluded. First operand 1064 states. Second operand 1066 states. [2020-07-10 15:03:41,574 INFO L87 Difference]: Start difference. First operand 1064 states. Second operand 1066 states. [2020-07-10 15:03:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,635 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-10 15:03:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-10 15:03:41,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:41,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:41,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:41,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-07-10 15:03:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2020-07-10 15:03:41,702 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2020-07-10 15:03:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:41,702 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2020-07-10 15:03:41,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2020-07-10 15:03:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:41,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:41,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:41,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:03:41,705 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2020-07-10 15:03:41,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:41,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703650306] [2020-07-10 15:03:41,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:41,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-10 15:03:41,740 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-10 15:03:41,741 INFO L263 TraceCheckUtils]: 0: Hoare triple {22995#true} call ULTIMATE.init(); {22995#true} is VALID [2020-07-10 15:03:41,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-10 15:03:41,741 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-10 15:03:41,741 INFO L263 TraceCheckUtils]: 3: Hoare triple {22995#true} call #t~ret12 := main(); {22995#true} is VALID [2020-07-10 15:03:41,742 INFO L280 TraceCheckUtils]: 4: Hoare triple {22995#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {22995#true} is VALID [2020-07-10 15:03:41,742 INFO L280 TraceCheckUtils]: 5: Hoare triple {22995#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {22995#true} is VALID [2020-07-10 15:03:41,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {22995#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {22995#true} is VALID [2020-07-10 15:03:41,742 INFO L280 TraceCheckUtils]: 7: Hoare triple {22995#true} assume !(0 != ~p1~0); {22995#true} is VALID [2020-07-10 15:03:41,742 INFO L280 TraceCheckUtils]: 8: Hoare triple {22995#true} assume !(0 != ~p2~0); {22995#true} is VALID [2020-07-10 15:03:41,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {22995#true} assume !(0 != ~p3~0); {22995#true} is VALID [2020-07-10 15:03:41,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {22995#true} assume !(0 != ~p4~0); {22995#true} is VALID [2020-07-10 15:03:41,743 INFO L280 TraceCheckUtils]: 11: Hoare triple {22995#true} assume 0 != ~p5~0;~lk5~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,746 INFO L280 TraceCheckUtils]: 16: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p10~0;~lk10~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p11~0;~lk11~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,747 INFO L280 TraceCheckUtils]: 18: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,747 INFO L280 TraceCheckUtils]: 19: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,748 INFO L280 TraceCheckUtils]: 20: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,749 INFO L280 TraceCheckUtils]: 21: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:03:41,749 INFO L280 TraceCheckUtils]: 22: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {22996#false} is VALID [2020-07-10 15:03:41,749 INFO L280 TraceCheckUtils]: 23: Hoare triple {22996#false} assume 0 != ~p6~0; {22996#false} is VALID [2020-07-10 15:03:41,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {22996#false} assume 1 != ~lk6~0; {22996#false} is VALID [2020-07-10 15:03:41,750 INFO L280 TraceCheckUtils]: 25: Hoare triple {22996#false} assume !false; {22996#false} is VALID [2020-07-10 15:03:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:41,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703650306] [2020-07-10 15:03:41,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:41,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:41,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994847980] [2020-07-10 15:03:41,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:41,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:41,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:41,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:41,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:41,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:41,776 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2020-07-10 15:03:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:42,164 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2020-07-10 15:03:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:42,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-10 15:03:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-10 15:03:42,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2020-07-10 15:03:42,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:42,379 INFO L225 Difference]: With dead ends: 1596 [2020-07-10 15:03:42,379 INFO L226 Difference]: Without dead ends: 1082 [2020-07-10 15:03:42,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2020-07-10 15:03:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2020-07-10 15:03:42,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:42,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1082 states. Second operand 1080 states. [2020-07-10 15:03:42,551 INFO L74 IsIncluded]: Start isIncluded. First operand 1082 states. Second operand 1080 states. [2020-07-10 15:03:42,552 INFO L87 Difference]: Start difference. First operand 1082 states. Second operand 1080 states. [2020-07-10 15:03:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:42,611 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-10 15:03:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-10 15:03:42,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:42,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:42,614 INFO L74 IsIncluded]: Start isIncluded. First operand 1080 states. Second operand 1082 states. [2020-07-10 15:03:42,614 INFO L87 Difference]: Start difference. First operand 1080 states. Second operand 1082 states. [2020-07-10 15:03:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:42,676 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-10 15:03:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-10 15:03:42,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:42,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:42,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:42,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2020-07-10 15:03:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2020-07-10 15:03:42,737 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2020-07-10 15:03:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:42,738 INFO L479 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2020-07-10 15:03:42,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2020-07-10 15:03:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:42,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:42,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:42,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:03:42,740 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2020-07-10 15:03:42,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:42,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868087495] [2020-07-10 15:03:42,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-10 15:03:42,777 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-10 15:03:42,778 INFO L263 TraceCheckUtils]: 0: Hoare triple {27936#true} call ULTIMATE.init(); {27936#true} is VALID [2020-07-10 15:03:42,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-10 15:03:42,778 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-10 15:03:42,778 INFO L263 TraceCheckUtils]: 3: Hoare triple {27936#true} call #t~ret12 := main(); {27936#true} is VALID [2020-07-10 15:03:42,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {27936#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {27936#true} is VALID [2020-07-10 15:03:42,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {27936#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {27936#true} is VALID [2020-07-10 15:03:42,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {27936#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {27936#true} is VALID [2020-07-10 15:03:42,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {27936#true} assume !(0 != ~p1~0); {27936#true} is VALID [2020-07-10 15:03:42,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {27936#true} assume !(0 != ~p2~0); {27936#true} is VALID [2020-07-10 15:03:42,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {27936#true} assume !(0 != ~p3~0); {27936#true} is VALID [2020-07-10 15:03:42,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {27936#true} assume !(0 != ~p4~0); {27936#true} is VALID [2020-07-10 15:03:42,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {27936#true} assume !(0 != ~p5~0); {27936#true} is VALID [2020-07-10 15:03:42,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {27936#true} assume 0 != ~p6~0;~lk6~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,786 INFO L280 TraceCheckUtils]: 17: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,788 INFO L280 TraceCheckUtils]: 20: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,789 INFO L280 TraceCheckUtils]: 22: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:42,790 INFO L280 TraceCheckUtils]: 24: Hoare triple {27940#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {27937#false} is VALID [2020-07-10 15:03:42,790 INFO L280 TraceCheckUtils]: 25: Hoare triple {27937#false} assume !false; {27937#false} is VALID [2020-07-10 15:03:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:42,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868087495] [2020-07-10 15:03:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141728328] [2020-07-10 15:03:42,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:42,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:42,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:42,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:42,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:42,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:42,819 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2020-07-10 15:03:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,321 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2020-07-10 15:03:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:43,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:43,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-10 15:03:43,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:43,570 INFO L225 Difference]: With dead ends: 1932 [2020-07-10 15:03:43,570 INFO L226 Difference]: Without dead ends: 1930 [2020-07-10 15:03:43,570 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-10 15:03:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2020-07-10 15:03:43,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:43,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1544 states. [2020-07-10 15:03:43,780 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1544 states. [2020-07-10 15:03:43,780 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1544 states. [2020-07-10 15:03:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,930 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-10 15:03:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-10 15:03:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,934 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1930 states. [2020-07-10 15:03:43,935 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1930 states. [2020-07-10 15:03:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,085 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-10 15:03:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-10 15:03:44,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:44,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:44,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:44,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-10 15:03:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2020-07-10 15:03:44,169 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2020-07-10 15:03:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:44,169 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2020-07-10 15:03:44,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2020-07-10 15:03:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:44,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:44,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:44,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:03:44,172 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:44,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2020-07-10 15:03:44,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:44,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581678683] [2020-07-10 15:03:44,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:44,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-10 15:03:44,204 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-10 15:03:44,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {35389#true} call ULTIMATE.init(); {35389#true} is VALID [2020-07-10 15:03:44,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-10 15:03:44,205 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-10 15:03:44,205 INFO L263 TraceCheckUtils]: 3: Hoare triple {35389#true} call #t~ret12 := main(); {35389#true} is VALID [2020-07-10 15:03:44,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {35389#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {35389#true} is VALID [2020-07-10 15:03:44,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {35389#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {35389#true} is VALID [2020-07-10 15:03:44,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {35389#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {35389#true} is VALID [2020-07-10 15:03:44,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {35389#true} assume !(0 != ~p1~0); {35389#true} is VALID [2020-07-10 15:03:44,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {35389#true} assume !(0 != ~p2~0); {35389#true} is VALID [2020-07-10 15:03:44,207 INFO L280 TraceCheckUtils]: 9: Hoare triple {35389#true} assume !(0 != ~p3~0); {35389#true} is VALID [2020-07-10 15:03:44,207 INFO L280 TraceCheckUtils]: 10: Hoare triple {35389#true} assume !(0 != ~p4~0); {35389#true} is VALID [2020-07-10 15:03:44,207 INFO L280 TraceCheckUtils]: 11: Hoare triple {35389#true} assume !(0 != ~p5~0); {35389#true} is VALID [2020-07-10 15:03:44,212 INFO L280 TraceCheckUtils]: 12: Hoare triple {35389#true} assume !(0 != ~p6~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,214 INFO L280 TraceCheckUtils]: 18: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,215 INFO L280 TraceCheckUtils]: 19: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,215 INFO L280 TraceCheckUtils]: 21: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:44,216 INFO L280 TraceCheckUtils]: 23: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p6~0; {35390#false} is VALID [2020-07-10 15:03:44,216 INFO L280 TraceCheckUtils]: 24: Hoare triple {35390#false} assume 1 != ~lk6~0; {35390#false} is VALID [2020-07-10 15:03:44,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {35390#false} assume !false; {35390#false} is VALID [2020-07-10 15:03:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:44,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581678683] [2020-07-10 15:03:44,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:44,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:44,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124755931] [2020-07-10 15:03:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:44,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:44,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:44,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:44,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:44,244 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2020-07-10 15:03:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:45,064 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2020-07-10 15:03:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:45,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 15:03:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 15:03:45,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-10 15:03:45,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:45,412 INFO L225 Difference]: With dead ends: 3596 [2020-07-10 15:03:45,412 INFO L226 Difference]: Without dead ends: 2090 [2020-07-10 15:03:45,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-07-10 15:03:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2020-07-10 15:03:45,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:45,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2090 states. Second operand 2088 states. [2020-07-10 15:03:45,812 INFO L74 IsIncluded]: Start isIncluded. First operand 2090 states. Second operand 2088 states. [2020-07-10 15:03:45,812 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2088 states. [2020-07-10 15:03:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:45,950 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-10 15:03:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-10 15:03:45,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:45,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:45,952 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand 2090 states. [2020-07-10 15:03:45,952 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand 2090 states. [2020-07-10 15:03:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:46,077 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-10 15:03:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-10 15:03:46,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:46,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:46,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:46,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2020-07-10 15:03:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2020-07-10 15:03:46,227 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2020-07-10 15:03:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:46,227 INFO L479 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2020-07-10 15:03:46,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2020-07-10 15:03:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:03:46,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:46,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:46,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:03:46,229 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2020-07-10 15:03:46,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:46,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494297060] [2020-07-10 15:03:46,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:46,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-10 15:03:46,259 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-10 15:03:46,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {45434#true} call ULTIMATE.init(); {45434#true} is VALID [2020-07-10 15:03:46,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-10 15:03:46,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-10 15:03:46,260 INFO L263 TraceCheckUtils]: 3: Hoare triple {45434#true} call #t~ret12 := main(); {45434#true} is VALID [2020-07-10 15:03:46,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {45434#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {45434#true} is VALID [2020-07-10 15:03:46,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {45434#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {45434#true} is VALID [2020-07-10 15:03:46,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {45434#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {45434#true} is VALID [2020-07-10 15:03:46,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {45434#true} assume !(0 != ~p1~0); {45434#true} is VALID [2020-07-10 15:03:46,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {45434#true} assume !(0 != ~p2~0); {45434#true} is VALID [2020-07-10 15:03:46,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {45434#true} assume !(0 != ~p3~0); {45434#true} is VALID [2020-07-10 15:03:46,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {45434#true} assume !(0 != ~p4~0); {45434#true} is VALID [2020-07-10 15:03:46,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {45434#true} assume !(0 != ~p5~0); {45434#true} is VALID [2020-07-10 15:03:46,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {45434#true} assume 0 != ~p6~0;~lk6~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,264 INFO L280 TraceCheckUtils]: 16: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p10~0;~lk10~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p11~0;~lk11~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-10 15:03:46,268 INFO L280 TraceCheckUtils]: 23: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {45435#false} is VALID [2020-07-10 15:03:46,268 INFO L280 TraceCheckUtils]: 24: Hoare triple {45435#false} assume 0 != ~p7~0; {45435#false} is VALID [2020-07-10 15:03:46,268 INFO L280 TraceCheckUtils]: 25: Hoare triple {45435#false} assume 1 != ~lk7~0; {45435#false} is VALID [2020-07-10 15:03:46,268 INFO L280 TraceCheckUtils]: 26: Hoare triple {45435#false} assume !false; {45435#false} is VALID [2020-07-10 15:03:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:46,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494297060] [2020-07-10 15:03:46,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:46,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:46,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692984247] [2020-07-10 15:03:46,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:46,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:46,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:46,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:46,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:46,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:46,303 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2020-07-10 15:03:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:47,387 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2020-07-10 15:03:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:47,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 15:03:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 15:03:47,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-10 15:03:47,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:47,726 INFO L225 Difference]: With dead ends: 3132 [2020-07-10 15:03:47,726 INFO L226 Difference]: Without dead ends: 2122 [2020-07-10 15:03:47,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-07-10 15:03:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2020-07-10 15:03:48,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:48,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 2120 states. [2020-07-10 15:03:48,101 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 2120 states. [2020-07-10 15:03:48,101 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 2120 states. [2020-07-10 15:03:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:48,244 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-10 15:03:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-10 15:03:48,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:48,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:48,246 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand 2122 states. [2020-07-10 15:03:48,247 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand 2122 states. [2020-07-10 15:03:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:48,379 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-10 15:03:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-10 15:03:48,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:48,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:48,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:48,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2020-07-10 15:03:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2020-07-10 15:03:48,520 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2020-07-10 15:03:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:48,520 INFO L479 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2020-07-10 15:03:48,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2020-07-10 15:03:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:03:48,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:48,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:48,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 15:03:48,522 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2020-07-10 15:03:48,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:48,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248819313] [2020-07-10 15:03:48,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:48,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-10 15:03:48,555 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-10 15:03:48,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {55111#true} call ULTIMATE.init(); {55111#true} is VALID [2020-07-10 15:03:48,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-10 15:03:48,556 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-10 15:03:48,556 INFO L263 TraceCheckUtils]: 3: Hoare triple {55111#true} call #t~ret12 := main(); {55111#true} is VALID [2020-07-10 15:03:48,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {55111#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {55111#true} is VALID [2020-07-10 15:03:48,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {55111#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {55111#true} is VALID [2020-07-10 15:03:48,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {55111#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {55111#true} is VALID [2020-07-10 15:03:48,557 INFO L280 TraceCheckUtils]: 7: Hoare triple {55111#true} assume !(0 != ~p1~0); {55111#true} is VALID [2020-07-10 15:03:48,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {55111#true} assume !(0 != ~p2~0); {55111#true} is VALID [2020-07-10 15:03:48,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {55111#true} assume !(0 != ~p3~0); {55111#true} is VALID [2020-07-10 15:03:48,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {55111#true} assume !(0 != ~p4~0); {55111#true} is VALID [2020-07-10 15:03:48,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {55111#true} assume !(0 != ~p5~0); {55111#true} is VALID [2020-07-10 15:03:48,558 INFO L280 TraceCheckUtils]: 12: Hoare triple {55111#true} assume !(0 != ~p6~0); {55111#true} is VALID [2020-07-10 15:03:48,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {55111#true} assume 0 != ~p7~0;~lk7~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,559 INFO L280 TraceCheckUtils]: 14: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,560 INFO L280 TraceCheckUtils]: 17: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,560 INFO L280 TraceCheckUtils]: 18: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,561 INFO L280 TraceCheckUtils]: 19: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,561 INFO L280 TraceCheckUtils]: 20: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,562 INFO L280 TraceCheckUtils]: 21: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,562 INFO L280 TraceCheckUtils]: 22: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,562 INFO L280 TraceCheckUtils]: 23: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p7~0; {55115#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:48,563 INFO L280 TraceCheckUtils]: 25: Hoare triple {55115#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {55112#false} is VALID [2020-07-10 15:03:48,563 INFO L280 TraceCheckUtils]: 26: Hoare triple {55112#false} assume !false; {55112#false} is VALID [2020-07-10 15:03:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:48,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248819313] [2020-07-10 15:03:48,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:48,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:48,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072122363] [2020-07-10 15:03:48,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:48,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:48,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:48,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:48,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:48,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:48,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:48,597 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2020-07-10 15:03:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:49,770 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2020-07-10 15:03:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:49,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 15:03:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 15:03:49,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-10 15:03:49,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:50,354 INFO L225 Difference]: With dead ends: 3724 [2020-07-10 15:03:50,354 INFO L226 Difference]: Without dead ends: 3722 [2020-07-10 15:03:50,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-10 15:03:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2020-07-10 15:03:50,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:50,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3080 states. [2020-07-10 15:03:50,725 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3080 states. [2020-07-10 15:03:50,725 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3080 states. [2020-07-10 15:03:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,123 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-10 15:03:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-10 15:03:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,127 INFO L74 IsIncluded]: Start isIncluded. First operand 3080 states. Second operand 3722 states. [2020-07-10 15:03:51,127 INFO L87 Difference]: Start difference. First operand 3080 states. Second operand 3722 states. [2020-07-10 15:03:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,560 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-10 15:03:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-10 15:03:51,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:51,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:51,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:51,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2020-07-10 15:03:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2020-07-10 15:03:51,890 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2020-07-10 15:03:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:51,890 INFO L479 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2020-07-10 15:03:51,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2020-07-10 15:03:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:03:51,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:51,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:51,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 15:03:51,893 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2020-07-10 15:03:51,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:51,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111574147] [2020-07-10 15:03:51,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:51,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-10 15:03:51,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-10 15:03:51,927 INFO L263 TraceCheckUtils]: 0: Hoare triple {69572#true} call ULTIMATE.init(); {69572#true} is VALID [2020-07-10 15:03:51,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-10 15:03:51,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-10 15:03:51,928 INFO L263 TraceCheckUtils]: 3: Hoare triple {69572#true} call #t~ret12 := main(); {69572#true} is VALID [2020-07-10 15:03:51,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {69572#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {69572#true} is VALID [2020-07-10 15:03:51,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {69572#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {69572#true} is VALID [2020-07-10 15:03:51,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {69572#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 7: Hoare triple {69572#true} assume !(0 != ~p1~0); {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {69572#true} assume !(0 != ~p2~0); {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {69572#true} assume !(0 != ~p3~0); {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {69572#true} assume !(0 != ~p4~0); {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {69572#true} assume !(0 != ~p5~0); {69572#true} is VALID [2020-07-10 15:03:51,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {69572#true} assume !(0 != ~p6~0); {69572#true} is VALID [2020-07-10 15:03:51,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {69572#true} assume !(0 != ~p7~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p10~0;~lk10~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,945 INFO L280 TraceCheckUtils]: 17: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p11~0;~lk11~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,946 INFO L280 TraceCheckUtils]: 21: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,947 INFO L280 TraceCheckUtils]: 22: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,947 INFO L280 TraceCheckUtils]: 23: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:51,948 INFO L280 TraceCheckUtils]: 24: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p7~0; {69573#false} is VALID [2020-07-10 15:03:51,948 INFO L280 TraceCheckUtils]: 25: Hoare triple {69573#false} assume 1 != ~lk7~0; {69573#false} is VALID [2020-07-10 15:03:51,948 INFO L280 TraceCheckUtils]: 26: Hoare triple {69573#false} assume !false; {69573#false} is VALID [2020-07-10 15:03:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:51,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111574147] [2020-07-10 15:03:51,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:51,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:51,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024471619] [2020-07-10 15:03:51,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:51,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:51,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:51,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:51,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:51,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:51,984 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2020-07-10 15:03:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,344 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2020-07-10 15:03:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:54,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:03:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-10 15:03:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-10 15:03:54,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-10 15:03:54,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:55,107 INFO L225 Difference]: With dead ends: 7116 [2020-07-10 15:03:55,107 INFO L226 Difference]: Without dead ends: 4106 [2020-07-10 15:03:55,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2020-07-10 15:03:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2020-07-10 15:03:55,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:55,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 4104 states. [2020-07-10 15:03:55,867 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 4104 states. [2020-07-10 15:03:55,867 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 4104 states. [2020-07-10 15:03:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,367 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-10 15:03:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-10 15:03:56,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,371 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 4106 states. [2020-07-10 15:03:56,371 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 4106 states. [2020-07-10 15:03:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,883 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-10 15:03:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-10 15:03:56,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:56,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2020-07-10 15:03:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2020-07-10 15:03:57,440 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2020-07-10 15:03:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:57,440 INFO L479 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2020-07-10 15:03:57,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2020-07-10 15:03:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:03:57,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:57,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:57,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 15:03:57,444 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2020-07-10 15:03:57,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:57,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815769011] [2020-07-10 15:03:57,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-10 15:03:57,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-10 15:03:57,475 INFO L263 TraceCheckUtils]: 0: Hoare triple {89345#true} call ULTIMATE.init(); {89345#true} is VALID [2020-07-10 15:03:57,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-10 15:03:57,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-10 15:03:57,476 INFO L263 TraceCheckUtils]: 3: Hoare triple {89345#true} call #t~ret12 := main(); {89345#true} is VALID [2020-07-10 15:03:57,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {89345#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {89345#true} is VALID [2020-07-10 15:03:57,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {89345#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {89345#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 7: Hoare triple {89345#true} assume !(0 != ~p1~0); {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {89345#true} assume !(0 != ~p2~0); {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {89345#true} assume !(0 != ~p3~0); {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {89345#true} assume !(0 != ~p4~0); {89345#true} is VALID [2020-07-10 15:03:57,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {89345#true} assume !(0 != ~p5~0); {89345#true} is VALID [2020-07-10 15:03:57,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {89345#true} assume !(0 != ~p6~0); {89345#true} is VALID [2020-07-10 15:03:57,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {89345#true} assume 0 != ~p7~0;~lk7~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p10~0;~lk10~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,480 INFO L280 TraceCheckUtils]: 17: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p11~0;~lk11~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,482 INFO L280 TraceCheckUtils]: 20: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,483 INFO L280 TraceCheckUtils]: 22: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,483 INFO L280 TraceCheckUtils]: 23: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-10 15:03:57,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {89346#false} is VALID [2020-07-10 15:03:57,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {89346#false} assume 0 != ~p8~0; {89346#false} is VALID [2020-07-10 15:03:57,484 INFO L280 TraceCheckUtils]: 26: Hoare triple {89346#false} assume 1 != ~lk8~0; {89346#false} is VALID [2020-07-10 15:03:57,484 INFO L280 TraceCheckUtils]: 27: Hoare triple {89346#false} assume !false; {89346#false} is VALID [2020-07-10 15:03:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:57,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815769011] [2020-07-10 15:03:57,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:57,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:57,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416860672] [2020-07-10 15:03:57,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:03:57,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:57,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:57,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:57,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:57,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,527 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2020-07-10 15:03:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,631 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2020-07-10 15:03:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:59,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:03:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-10 15:03:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-10 15:03:59,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-10 15:03:59,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:00,419 INFO L225 Difference]: With dead ends: 6156 [2020-07-10 15:04:00,419 INFO L226 Difference]: Without dead ends: 4170 [2020-07-10 15:04:00,422 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:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2020-07-10 15:04:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2020-07-10 15:04:01,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:01,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand 4168 states. [2020-07-10 15:04:01,187 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand 4168 states. [2020-07-10 15:04:01,187 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand 4168 states. [2020-07-10 15:04:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:01,731 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-10 15:04:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-10 15:04:01,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:01,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:01,736 INFO L74 IsIncluded]: Start isIncluded. First operand 4168 states. Second operand 4170 states. [2020-07-10 15:04:01,736 INFO L87 Difference]: Start difference. First operand 4168 states. Second operand 4170 states. [2020-07-10 15:04:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,287 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-10 15:04:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-10 15:04:02,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:02,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:02,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:02,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2020-07-10 15:04:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2020-07-10 15:04:02,852 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2020-07-10 15:04:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:02,852 INFO L479 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2020-07-10 15:04:02,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2020-07-10 15:04:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:04:02,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:02,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:02,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 15:04:02,856 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2020-07-10 15:04:02,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:02,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578120593] [2020-07-10 15:04:02,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:02,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-10 15:04:02,887 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-10 15:04:02,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {108350#true} call ULTIMATE.init(); {108350#true} is VALID [2020-07-10 15:04:02,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-10 15:04:02,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {108350#true} call #t~ret12 := main(); {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {108350#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {108350#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L280 TraceCheckUtils]: 6: Hoare triple {108350#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {108350#true} assume !(0 != ~p1~0); {108350#true} is VALID [2020-07-10 15:04:02,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {108350#true} assume !(0 != ~p2~0); {108350#true} is VALID [2020-07-10 15:04:02,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {108350#true} assume !(0 != ~p3~0); {108350#true} is VALID [2020-07-10 15:04:02,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {108350#true} assume !(0 != ~p4~0); {108350#true} is VALID [2020-07-10 15:04:02,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {108350#true} assume !(0 != ~p5~0); {108350#true} is VALID [2020-07-10 15:04:02,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {108350#true} assume !(0 != ~p6~0); {108350#true} is VALID [2020-07-10 15:04:02,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {108350#true} assume !(0 != ~p7~0); {108350#true} is VALID [2020-07-10 15:04:02,890 INFO L280 TraceCheckUtils]: 14: Hoare triple {108350#true} assume !(0 != ~p8~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,890 INFO L280 TraceCheckUtils]: 15: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,891 INFO L280 TraceCheckUtils]: 16: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,892 INFO L280 TraceCheckUtils]: 18: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,893 INFO L280 TraceCheckUtils]: 21: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,894 INFO L280 TraceCheckUtils]: 22: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,894 INFO L280 TraceCheckUtils]: 23: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:02,895 INFO L280 TraceCheckUtils]: 25: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p8~0; {108351#false} is VALID [2020-07-10 15:04:02,895 INFO L280 TraceCheckUtils]: 26: Hoare triple {108351#false} assume 1 != ~lk8~0; {108351#false} is VALID [2020-07-10 15:04:02,895 INFO L280 TraceCheckUtils]: 27: Hoare triple {108351#false} assume !false; {108351#false} is VALID [2020-07-10 15:04:02,896 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:02,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578120593] [2020-07-10 15:04:02,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:02,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:02,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734757229] [2020-07-10 15:04:02,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:02,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:02,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:02,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:02,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:02,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:02,921 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2020-07-10 15:04:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,952 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2020-07-10 15:04:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:08,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 15:04:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 15:04:08,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-10 15:04:09,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:11,388 INFO L225 Difference]: With dead ends: 12108 [2020-07-10 15:04:11,388 INFO L226 Difference]: Without dead ends: 8074 [2020-07-10 15:04:11,394 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,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-10 15:04:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2020-07-10 15:04:12,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:12,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 8072 states. [2020-07-10 15:04:12,893 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 8072 states. [2020-07-10 15:04:12,893 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 8072 states. [2020-07-10 15:04:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:14,738 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-10 15:04:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-10 15:04:14,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:14,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:14,744 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 8074 states. [2020-07-10 15:04:14,744 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 8074 states. [2020-07-10 15:04:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,765 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-10 15:04:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-10 15:04:16,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:16,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:16,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:16,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-10 15:04:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2020-07-10 15:04:18,973 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2020-07-10 15:04:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:18,974 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2020-07-10 15:04:18,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2020-07-10 15:04:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:04:18,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:18,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:18,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 15:04:18,977 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2020-07-10 15:04:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:18,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424817289] [2020-07-10 15:04:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:19,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-10 15:04:19,003 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-10 15:04:19,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {145339#true} call ULTIMATE.init(); {145339#true} is VALID [2020-07-10 15:04:19,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-10 15:04:19,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-10 15:04:19,004 INFO L263 TraceCheckUtils]: 3: Hoare triple {145339#true} call #t~ret12 := main(); {145339#true} is VALID [2020-07-10 15:04:19,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {145339#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {145339#true} is VALID [2020-07-10 15:04:19,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {145339#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {145339#true} is VALID [2020-07-10 15:04:19,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {145339#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {145339#true} is VALID [2020-07-10 15:04:19,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {145339#true} assume !(0 != ~p1~0); {145339#true} is VALID [2020-07-10 15:04:19,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {145339#true} assume !(0 != ~p2~0); {145339#true} is VALID [2020-07-10 15:04:19,005 INFO L280 TraceCheckUtils]: 9: Hoare triple {145339#true} assume !(0 != ~p3~0); {145339#true} is VALID [2020-07-10 15:04:19,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {145339#true} assume !(0 != ~p4~0); {145339#true} is VALID [2020-07-10 15:04:19,006 INFO L280 TraceCheckUtils]: 11: Hoare triple {145339#true} assume !(0 != ~p5~0); {145339#true} is VALID [2020-07-10 15:04:19,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {145339#true} assume !(0 != ~p6~0); {145339#true} is VALID [2020-07-10 15:04:19,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {145339#true} assume !(0 != ~p7~0); {145339#true} is VALID [2020-07-10 15:04:19,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {145339#true} assume 0 != ~p8~0;~lk8~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,007 INFO L280 TraceCheckUtils]: 15: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,008 INFO L280 TraceCheckUtils]: 16: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,009 INFO L280 TraceCheckUtils]: 18: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,010 INFO L280 TraceCheckUtils]: 21: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,011 INFO L280 TraceCheckUtils]: 22: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,011 INFO L280 TraceCheckUtils]: 23: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,011 INFO L280 TraceCheckUtils]: 24: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,012 INFO L280 TraceCheckUtils]: 25: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:19,012 INFO L280 TraceCheckUtils]: 26: Hoare triple {145343#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {145340#false} is VALID [2020-07-10 15:04:19,013 INFO L280 TraceCheckUtils]: 27: Hoare triple {145340#false} assume !false; {145340#false} is VALID [2020-07-10 15:04:19,013 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:19,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424817289] [2020-07-10 15:04:19,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:19,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:19,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448697889] [2020-07-10 15:04:19,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:19,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:19,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:19,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:19,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:19,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:19,044 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2020-07-10 15:04:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:23,761 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2020-07-10 15:04:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:23,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-10 15:04:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-10 15:04:23,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2020-07-10 15:04:23,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:26,800 INFO L225 Difference]: With dead ends: 9100 [2020-07-10 15:04:26,800 INFO L226 Difference]: Without dead ends: 9098 [2020-07-10 15:04:26,801 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:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2020-07-10 15:04:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2020-07-10 15:04:28,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:28,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9098 states. Second operand 8072 states. [2020-07-10 15:04:28,391 INFO L74 IsIncluded]: Start isIncluded. First operand 9098 states. Second operand 8072 states. [2020-07-10 15:04:28,391 INFO L87 Difference]: Start difference. First operand 9098 states. Second operand 8072 states. [2020-07-10 15:04:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:31,005 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-10 15:04:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-10 15:04:31,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:31,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:31,012 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 9098 states. [2020-07-10 15:04:31,012 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 9098 states. [2020-07-10 15:04:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:33,673 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-10 15:04:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-10 15:04:33,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:33,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:33,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:33,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-10 15:04:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2020-07-10 15:04:35,887 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2020-07-10 15:04:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:35,887 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2020-07-10 15:04:35,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2020-07-10 15:04:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:04:35,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:35,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:35,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 15:04:35,892 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2020-07-10 15:04:35,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:35,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312724005] [2020-07-10 15:04:35,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:35,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-10 15:04:35,937 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-10 15:04:35,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {181368#true} call ULTIMATE.init(); {181368#true} is VALID [2020-07-10 15:04:35,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-10 15:04:35,938 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-10 15:04:35,938 INFO L263 TraceCheckUtils]: 3: Hoare triple {181368#true} call #t~ret12 := main(); {181368#true} is VALID [2020-07-10 15:04:35,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {181368#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 5: Hoare triple {181368#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {181368#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {181368#true} assume !(0 != ~p1~0); {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {181368#true} assume !(0 != ~p2~0); {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {181368#true} assume !(0 != ~p3~0); {181368#true} is VALID [2020-07-10 15:04:35,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {181368#true} assume !(0 != ~p4~0); {181368#true} is VALID [2020-07-10 15:04:35,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {181368#true} assume !(0 != ~p5~0); {181368#true} is VALID [2020-07-10 15:04:35,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {181368#true} assume !(0 != ~p6~0); {181368#true} is VALID [2020-07-10 15:04:35,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {181368#true} assume !(0 != ~p7~0); {181368#true} is VALID [2020-07-10 15:04:35,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {181368#true} assume !(0 != ~p8~0); {181368#true} is VALID [2020-07-10 15:04:35,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {181368#true} assume 0 != ~p9~0;~lk9~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,942 INFO L280 TraceCheckUtils]: 17: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,942 INFO L280 TraceCheckUtils]: 18: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,943 INFO L280 TraceCheckUtils]: 19: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,943 INFO L280 TraceCheckUtils]: 20: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,944 INFO L280 TraceCheckUtils]: 22: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,945 INFO L280 TraceCheckUtils]: 24: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,946 INFO L280 TraceCheckUtils]: 25: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,947 INFO L280 TraceCheckUtils]: 26: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:35,947 INFO L280 TraceCheckUtils]: 27: Hoare triple {181372#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {181369#false} is VALID [2020-07-10 15:04:35,948 INFO L280 TraceCheckUtils]: 28: Hoare triple {181369#false} assume !false; {181369#false} is VALID [2020-07-10 15:04:35,948 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,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312724005] [2020-07-10 15:04:35,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:35,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:35,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420779997] [2020-07-10 15:04:35,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:04:35,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:35,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:35,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:35,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:35,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:35,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:35,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:35,985 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2020-07-10 15:04:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:44,665 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2020-07-10 15:04:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:44,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:04:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:04:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:04:44,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-10 15:04:44,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:51,189 INFO L225 Difference]: With dead ends: 13708 [2020-07-10 15:04:51,189 INFO L226 Difference]: Without dead ends: 13706 [2020-07-10 15:04:51,191 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:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2020-07-10 15:04:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2020-07-10 15:04:52,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:52,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13706 states. Second operand 12168 states. [2020-07-10 15:04:52,880 INFO L74 IsIncluded]: Start isIncluded. First operand 13706 states. Second operand 12168 states. [2020-07-10 15:04:52,881 INFO L87 Difference]: Start difference. First operand 13706 states. Second operand 12168 states. [2020-07-10 15:04:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:58,640 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-10 15:04:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-10 15:04:58,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:58,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:58,652 INFO L74 IsIncluded]: Start isIncluded. First operand 12168 states. Second operand 13706 states. [2020-07-10 15:04:58,653 INFO L87 Difference]: Start difference. First operand 12168 states. Second operand 13706 states. [2020-07-10 15:05:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:03,985 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-10 15:05:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-10 15:05:03,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:03,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:03,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:03,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2020-07-10 15:05:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2020-07-10 15:05:08,992 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2020-07-10 15:05:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:08,992 INFO L479 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2020-07-10 15:05:08,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:05:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2020-07-10 15:05:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:05:08,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:08,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:08,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 15:05:08,998 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2020-07-10 15:05:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:08,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068024802] [2020-07-10 15:05:08,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:09,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-10 15:05:09,029 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-10 15:05:09,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {235445#true} call ULTIMATE.init(); {235445#true} is VALID [2020-07-10 15:05:09,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-10 15:05:09,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-10 15:05:09,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {235445#true} call #t~ret12 := main(); {235445#true} is VALID [2020-07-10 15:05:09,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {235445#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {235445#true} is VALID [2020-07-10 15:05:09,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {235445#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {235445#true} is VALID [2020-07-10 15:05:09,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {235445#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {235445#true} is VALID [2020-07-10 15:05:09,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {235445#true} assume !(0 != ~p1~0); {235445#true} is VALID [2020-07-10 15:05:09,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {235445#true} assume !(0 != ~p2~0); {235445#true} is VALID [2020-07-10 15:05:09,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {235445#true} assume !(0 != ~p3~0); {235445#true} is VALID [2020-07-10 15:05:09,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {235445#true} assume !(0 != ~p4~0); {235445#true} is VALID [2020-07-10 15:05:09,031 INFO L280 TraceCheckUtils]: 11: Hoare triple {235445#true} assume !(0 != ~p5~0); {235445#true} is VALID [2020-07-10 15:05:09,031 INFO L280 TraceCheckUtils]: 12: Hoare triple {235445#true} assume !(0 != ~p6~0); {235445#true} is VALID [2020-07-10 15:05:09,031 INFO L280 TraceCheckUtils]: 13: Hoare triple {235445#true} assume !(0 != ~p7~0); {235445#true} is VALID [2020-07-10 15:05:09,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {235445#true} assume !(0 != ~p8~0); {235445#true} is VALID [2020-07-10 15:05:09,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {235445#true} assume !(0 != ~p9~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,037 INFO L280 TraceCheckUtils]: 16: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,037 INFO L280 TraceCheckUtils]: 17: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,039 INFO L280 TraceCheckUtils]: 20: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,039 INFO L280 TraceCheckUtils]: 21: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,040 INFO L280 TraceCheckUtils]: 22: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,040 INFO L280 TraceCheckUtils]: 23: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,040 INFO L280 TraceCheckUtils]: 24: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,041 INFO L280 TraceCheckUtils]: 25: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:09,041 INFO L280 TraceCheckUtils]: 26: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p9~0; {235446#false} is VALID [2020-07-10 15:05:09,042 INFO L280 TraceCheckUtils]: 27: Hoare triple {235446#false} assume 1 != ~lk9~0; {235446#false} is VALID [2020-07-10 15:05:09,042 INFO L280 TraceCheckUtils]: 28: Hoare triple {235446#false} assume !false; {235446#false} is VALID [2020-07-10 15:05:09,042 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:05:09,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068024802] [2020-07-10 15:05:09,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:09,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:05:09,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99457408] [2020-07-10 15:05:09,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:05:09,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:09,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:05:09,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:09,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:05:09,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:05:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:09,073 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2020-07-10 15:05:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:40,186 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2020-07-10 15:05:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:05:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:05:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-10 15:05:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-10 15:05:40,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-10 15:05:40,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:49,260 INFO L225 Difference]: With dead ends: 27788 [2020-07-10 15:05:49,260 INFO L226 Difference]: Without dead ends: 15754 [2020-07-10 15:05:49,271 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:05:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2020-07-10 15:05:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2020-07-10 15:05:52,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:52,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15754 states. Second operand 15752 states. [2020-07-10 15:05:52,727 INFO L74 IsIncluded]: Start isIncluded. First operand 15754 states. Second operand 15752 states. [2020-07-10 15:05:52,727 INFO L87 Difference]: Start difference. First operand 15754 states. Second operand 15752 states. [2020-07-10 15:05:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,821 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-10 15:05:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-10 15:05:59,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:59,829 INFO L74 IsIncluded]: Start isIncluded. First operand 15752 states. Second operand 15754 states. [2020-07-10 15:05:59,829 INFO L87 Difference]: Start difference. First operand 15752 states. Second operand 15754 states. [2020-07-10 15:06:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:07,195 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-10 15:06:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-10 15:06:07,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:07,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:07,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:07,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2020-07-10 15:06:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2020-07-10 15:06:15,182 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2020-07-10 15:06:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:15,182 INFO L479 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2020-07-10 15:06:15,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:06:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2020-07-10 15:06:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:06:15,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:15,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:15,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-10 15:06:15,188 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2020-07-10 15:06:15,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:15,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348486895] [2020-07-10 15:06:15,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:15,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-10 15:06:15,235 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-10 15:06:15,235 INFO L263 TraceCheckUtils]: 0: Hoare triple {311794#true} call ULTIMATE.init(); {311794#true} is VALID [2020-07-10 15:06:15,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-10 15:06:15,235 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-10 15:06:15,235 INFO L263 TraceCheckUtils]: 3: Hoare triple {311794#true} call #t~ret12 := main(); {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {311794#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {311794#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {311794#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {311794#true} assume !(0 != ~p1~0); {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {311794#true} assume !(0 != ~p2~0); {311794#true} is VALID [2020-07-10 15:06:15,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {311794#true} assume !(0 != ~p3~0); {311794#true} is VALID [2020-07-10 15:06:15,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {311794#true} assume !(0 != ~p4~0); {311794#true} is VALID [2020-07-10 15:06:15,237 INFO L280 TraceCheckUtils]: 11: Hoare triple {311794#true} assume !(0 != ~p5~0); {311794#true} is VALID [2020-07-10 15:06:15,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {311794#true} assume !(0 != ~p6~0); {311794#true} is VALID [2020-07-10 15:06:15,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {311794#true} assume !(0 != ~p7~0); {311794#true} is VALID [2020-07-10 15:06:15,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {311794#true} assume !(0 != ~p8~0); {311794#true} is VALID [2020-07-10 15:06:15,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {311794#true} assume 0 != ~p9~0;~lk9~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p10~0;~lk10~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,239 INFO L280 TraceCheckUtils]: 17: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p11~0;~lk11~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,239 INFO L280 TraceCheckUtils]: 18: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p1~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,240 INFO L280 TraceCheckUtils]: 19: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p2~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,240 INFO L280 TraceCheckUtils]: 20: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p3~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,240 INFO L280 TraceCheckUtils]: 21: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p4~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p5~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,241 INFO L280 TraceCheckUtils]: 23: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p6~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,242 INFO L280 TraceCheckUtils]: 24: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p7~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,242 INFO L280 TraceCheckUtils]: 25: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p8~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-10 15:06:15,243 INFO L280 TraceCheckUtils]: 26: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {311795#false} is VALID [2020-07-10 15:06:15,243 INFO L280 TraceCheckUtils]: 27: Hoare triple {311795#false} assume 0 != ~p10~0; {311795#false} is VALID [2020-07-10 15:06:15,243 INFO L280 TraceCheckUtils]: 28: Hoare triple {311795#false} assume 1 != ~lk10~0; {311795#false} is VALID [2020-07-10 15:06:15,243 INFO L280 TraceCheckUtils]: 29: Hoare triple {311795#false} assume !false; {311795#false} is VALID [2020-07-10 15:06:15,244 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:06:15,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348486895] [2020-07-10 15:06:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:06:15,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978669817] [2020-07-10 15:06:15,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:06:15,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:15,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:06:15,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:15,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:06:15,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:06:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:06:15,348 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2020-07-10 15:06:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:36,675 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2020-07-10 15:06:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:06:36,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:06:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-10 15:06:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-10 15:06:36,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-10 15:06:36,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:46,487 INFO L225 Difference]: With dead ends: 23820 [2020-07-10 15:06:46,487 INFO L226 Difference]: Without dead ends: 16138 [2020-07-10 15:06:46,495 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:06:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2020-07-10 15:06:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2020-07-10 15:06:50,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:50,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16138 states. Second operand 16136 states. [2020-07-10 15:06:50,007 INFO L74 IsIncluded]: Start isIncluded. First operand 16138 states. Second operand 16136 states. [2020-07-10 15:06:50,007 INFO L87 Difference]: Start difference. First operand 16138 states. Second operand 16136 states. [2020-07-10 15:06:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,120 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-10 15:06:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-10 15:06:57,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,128 INFO L74 IsIncluded]: Start isIncluded. First operand 16136 states. Second operand 16138 states. [2020-07-10 15:06:57,128 INFO L87 Difference]: Start difference. First operand 16136 states. Second operand 16138 states. [2020-07-10 15:07:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,294 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-10 15:07:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-10 15:07:05,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:05,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:05,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2020-07-10 15:07:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2020-07-10 15:07:14,762 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2020-07-10 15:07:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:14,763 INFO L479 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2020-07-10 15:07:14,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:07:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2020-07-10 15:07:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:07:14,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:14,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:14,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-10 15:07:14,769 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2020-07-10 15:07:14,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:14,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557291] [2020-07-10 15:07:14,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:14,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-10 15:07:14,804 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L263 TraceCheckUtils]: 0: Hoare triple {385327#true} call ULTIMATE.init(); {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L263 TraceCheckUtils]: 3: Hoare triple {385327#true} call #t~ret12 := main(); {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {385327#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {385327#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {385327#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 7: Hoare triple {385327#true} assume !(0 != ~p1~0); {385327#true} is VALID [2020-07-10 15:07:14,805 INFO L280 TraceCheckUtils]: 8: Hoare triple {385327#true} assume !(0 != ~p2~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 9: Hoare triple {385327#true} assume !(0 != ~p3~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 10: Hoare triple {385327#true} assume !(0 != ~p4~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 11: Hoare triple {385327#true} assume !(0 != ~p5~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 12: Hoare triple {385327#true} assume !(0 != ~p6~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 13: Hoare triple {385327#true} assume !(0 != ~p7~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {385327#true} assume !(0 != ~p8~0); {385327#true} is VALID [2020-07-10 15:07:14,806 INFO L280 TraceCheckUtils]: 15: Hoare triple {385327#true} assume !(0 != ~p9~0); {385327#true} is VALID [2020-07-10 15:07:14,807 INFO L280 TraceCheckUtils]: 16: Hoare triple {385327#true} assume 0 != ~p10~0;~lk10~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,807 INFO L280 TraceCheckUtils]: 17: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,807 INFO L280 TraceCheckUtils]: 18: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,808 INFO L280 TraceCheckUtils]: 19: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,808 INFO L280 TraceCheckUtils]: 20: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,808 INFO L280 TraceCheckUtils]: 21: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,809 INFO L280 TraceCheckUtils]: 22: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,810 INFO L280 TraceCheckUtils]: 25: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,810 INFO L280 TraceCheckUtils]: 26: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,810 INFO L280 TraceCheckUtils]: 27: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p10~0; {385331#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:14,811 INFO L280 TraceCheckUtils]: 28: Hoare triple {385331#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {385328#false} is VALID [2020-07-10 15:07:14,811 INFO L280 TraceCheckUtils]: 29: Hoare triple {385328#false} assume !false; {385328#false} is VALID [2020-07-10 15:07:14,812 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:07:14,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557291] [2020-07-10 15:07:14,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:07:14,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:07:14,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678665454] [2020-07-10 15:07:14,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:07:14,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:14,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:07:14,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:14,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:07:14,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:07:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:07:14,850 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2020-07-10 15:07:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:44,764 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2020-07-10 15:07:44,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:07:44,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:07:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:07:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:07:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:07:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:07:44,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-10 15:07:44,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:10,215 INFO L225 Difference]: With dead ends: 26636 [2020-07-10 15:08:10,215 INFO L226 Difference]: Without dead ends: 26634 [2020-07-10 15:08:10,219 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:08:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2020-07-10 15:08:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2020-07-10 15:08:14,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:14,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26634 states. Second operand 24584 states. [2020-07-10 15:08:14,005 INFO L74 IsIncluded]: Start isIncluded. First operand 26634 states. Second operand 24584 states. [2020-07-10 15:08:14,005 INFO L87 Difference]: Start difference. First operand 26634 states. Second operand 24584 states. [2020-07-10 15:08:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:40,738 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-10 15:08:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-10 15:08:40,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:40,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:40,752 INFO L74 IsIncluded]: Start isIncluded. First operand 24584 states. Second operand 26634 states. [2020-07-10 15:08:40,752 INFO L87 Difference]: Start difference. First operand 24584 states. Second operand 26634 states. [2020-07-10 15:09:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,128 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-10 15:09:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-10 15:09:07,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:07,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:07,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:07,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2020-07-10 15:09:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2020-07-10 15:09:33,746 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2020-07-10 15:09:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:33,746 INFO L479 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2020-07-10 15:09:33,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:09:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2020-07-10 15:09:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:09:33,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:33,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:33,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-10 15:09:33,762 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2020-07-10 15:09:33,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:33,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838624269] [2020-07-10 15:09:33,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:33,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-10 15:09:33,799 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-10 15:09:33,799 INFO L263 TraceCheckUtils]: 0: Hoare triple {491372#true} call ULTIMATE.init(); {491372#true} is VALID [2020-07-10 15:09:33,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-10 15:09:33,800 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-10 15:09:33,800 INFO L263 TraceCheckUtils]: 3: Hoare triple {491372#true} call #t~ret12 := main(); {491372#true} is VALID [2020-07-10 15:09:33,800 INFO L280 TraceCheckUtils]: 4: Hoare triple {491372#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {491372#true} is VALID [2020-07-10 15:09:33,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {491372#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {491372#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {491372#true} assume !(0 != ~p1~0); {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {491372#true} assume !(0 != ~p2~0); {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 9: Hoare triple {491372#true} assume !(0 != ~p3~0); {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {491372#true} assume !(0 != ~p4~0); {491372#true} is VALID [2020-07-10 15:09:33,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {491372#true} assume !(0 != ~p5~0); {491372#true} is VALID [2020-07-10 15:09:33,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {491372#true} assume !(0 != ~p6~0); {491372#true} is VALID [2020-07-10 15:09:33,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {491372#true} assume !(0 != ~p7~0); {491372#true} is VALID [2020-07-10 15:09:33,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {491372#true} assume !(0 != ~p8~0); {491372#true} is VALID [2020-07-10 15:09:33,802 INFO L280 TraceCheckUtils]: 15: Hoare triple {491372#true} assume !(0 != ~p9~0); {491372#true} is VALID [2020-07-10 15:09:33,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {491372#true} assume !(0 != ~p10~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p11~0;~lk11~0 := 1; {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,805 INFO L280 TraceCheckUtils]: 21: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,806 INFO L280 TraceCheckUtils]: 23: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,806 INFO L280 TraceCheckUtils]: 25: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,807 INFO L280 TraceCheckUtils]: 26: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-10 15:09:33,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p10~0; {491373#false} is VALID [2020-07-10 15:09:33,807 INFO L280 TraceCheckUtils]: 28: Hoare triple {491373#false} assume 1 != ~lk10~0; {491373#false} is VALID [2020-07-10 15:09:33,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {491373#false} assume !false; {491373#false} is VALID [2020-07-10 15:09:33,808 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:09:33,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838624269] [2020-07-10 15:09:33,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:33,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:09:33,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498929614] [2020-07-10 15:09:33,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:09:33,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:33,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:09:33,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:33,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:09:33,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:33,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:09:33,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:09:33,840 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2020-07-10 15:13:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:13:36,911 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2020-07-10 15:13:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:13:36,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:13:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:13:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:13:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-10 15:13:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:13:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-10 15:13:36,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-10 15:13:37,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:14:15,718 INFO L225 Difference]: With dead ends: 55308 [2020-07-10 15:14:15,719 INFO L226 Difference]: Without dead ends: 31242 [2020-07-10 15:14:15,860 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:14:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2020-07-10 15:14:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2020-07-10 15:14:23,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:14:23,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31242 states. Second operand 31240 states. [2020-07-10 15:14:23,534 INFO L74 IsIncluded]: Start isIncluded. First operand 31242 states. Second operand 31240 states. [2020-07-10 15:14:23,534 INFO L87 Difference]: Start difference. First operand 31242 states. Second operand 31240 states. [2020-07-10 15:15:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:15:06,868 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2020-07-10 15:15:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 36871 transitions. [2020-07-10 15:15:06,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:15:06,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:15:06,885 INFO L74 IsIncluded]: Start isIncluded. First operand 31240 states. Second operand 31242 states. [2020-07-10 15:15:06,885 INFO L87 Difference]: Start difference. First operand 31240 states. Second operand 31242 states. [2020-07-10 15:15:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:15:59,928 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2020-07-10 15:15:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 36871 transitions. [2020-07-10 15:16:01,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:16:01,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:16:01,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:16:01,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:16:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2020-07-10 15:17:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2020-07-10 15:17:13,818 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2020-07-10 15:17:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:17:13,818 INFO L479 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2020-07-10 15:17:13,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:17:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2020-07-10 15:17:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:17:13,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:17:13,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:17:13,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-10 15:17:13,836 INFO L427 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:17:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:17:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2020-07-10 15:17:13,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:17:13,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122816367] [2020-07-10 15:17:13,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:17:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:17:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:17:13,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {642985#true} assume true; {642985#true} is VALID [2020-07-10 15:17:13,870 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {642985#true} {642985#true} #214#return; {642985#true} is VALID [2020-07-10 15:17:13,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {642985#true} call ULTIMATE.init(); {642985#true} is VALID [2020-07-10 15:17:13,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {642985#true} assume true; {642985#true} is VALID [2020-07-10 15:17:13,871 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {642985#true} {642985#true} #214#return; {642985#true} is VALID [2020-07-10 15:17:13,871 INFO L263 TraceCheckUtils]: 3: Hoare triple {642985#true} call #t~ret12 := main(); {642985#true} is VALID [2020-07-10 15:17:13,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {642985#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {642985#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 6: Hoare triple {642985#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {642985#true} assume !(0 != ~p1~0); {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 8: Hoare triple {642985#true} assume !(0 != ~p2~0); {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {642985#true} assume !(0 != ~p3~0); {642985#true} is VALID [2020-07-10 15:17:13,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {642985#true} assume !(0 != ~p4~0); {642985#true} is VALID [2020-07-10 15:17:13,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {642985#true} assume !(0 != ~p5~0); {642985#true} is VALID [2020-07-10 15:17:13,873 INFO L280 TraceCheckUtils]: 12: Hoare triple {642985#true} assume !(0 != ~p6~0); {642985#true} is VALID [2020-07-10 15:17:13,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {642985#true} assume !(0 != ~p7~0); {642985#true} is VALID [2020-07-10 15:17:13,873 INFO L280 TraceCheckUtils]: 14: Hoare triple {642985#true} assume !(0 != ~p8~0); {642985#true} is VALID [2020-07-10 15:17:13,873 INFO L280 TraceCheckUtils]: 15: Hoare triple {642985#true} assume !(0 != ~p9~0); {642985#true} is VALID [2020-07-10 15:17:13,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {642985#true} assume 0 != ~p10~0;~lk10~0 := 1; {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,875 INFO L280 TraceCheckUtils]: 17: Hoare triple {642989#(not (= 0 main_~p10~0))} assume 0 != ~p11~0;~lk11~0 := 1; {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p1~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,876 INFO L280 TraceCheckUtils]: 19: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p2~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p3~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,876 INFO L280 TraceCheckUtils]: 21: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p4~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,877 INFO L280 TraceCheckUtils]: 22: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p5~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,877 INFO L280 TraceCheckUtils]: 23: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p6~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,878 INFO L280 TraceCheckUtils]: 24: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p7~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,878 INFO L280 TraceCheckUtils]: 25: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p8~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,879 INFO L280 TraceCheckUtils]: 26: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p9~0); {642989#(not (= 0 main_~p10~0))} is VALID [2020-07-10 15:17:13,879 INFO L280 TraceCheckUtils]: 27: Hoare triple {642989#(not (= 0 main_~p10~0))} assume !(0 != ~p10~0); {642986#false} is VALID [2020-07-10 15:17:13,879 INFO L280 TraceCheckUtils]: 28: Hoare triple {642986#false} assume 0 != ~p11~0; {642986#false} is VALID [2020-07-10 15:17:13,880 INFO L280 TraceCheckUtils]: 29: Hoare triple {642986#false} assume 1 != ~lk11~0; {642986#false} is VALID [2020-07-10 15:17:13,880 INFO L280 TraceCheckUtils]: 30: Hoare triple {642986#false} assume !false; {642986#false} is VALID [2020-07-10 15:17:13,881 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:17:13,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122816367] [2020-07-10 15:17:13,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:17:13,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:17:13,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009467055] [2020-07-10 15:17:13,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 15:17:13,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:17:13,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:17:13,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:17:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:17:13,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:17:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:17:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:17:13,911 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states.