/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:23,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:23,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:23,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:23,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:23,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:23,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:23,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:23,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:23,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:23,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:23,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:23,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:23,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:23,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:23,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:23,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:23,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:23,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:23,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:23,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:23,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:23,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:23,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:23,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:23,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:23,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:23,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:23,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:23,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:23,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:23,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:23,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:23,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:23,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:23,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:23,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:23,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:23,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:23,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:23,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:23,367 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-17 22:26:23,406 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:23,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:23,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:23,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:23,409 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:23,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:23,413 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:23,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:23,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:23,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:23,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:23,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:23,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:23,414 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:23,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:23,417 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:23,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:23,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:23,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:23,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:23,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:23,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:23,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:23,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:23,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:23,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:23,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:23,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:23,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:23,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:23,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:23,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:23,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:23,740 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:23,740 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:23,741 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-17 22:26:23,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7869bfb4/c8a5f6bbbe814e2da2db040c21f48134/FLAG8ddacb4a9 [2020-07-17 22:26:24,332 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:24,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-17 22:26:24,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7869bfb4/c8a5f6bbbe814e2da2db040c21f48134/FLAG8ddacb4a9 [2020-07-17 22:26:24,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7869bfb4/c8a5f6bbbe814e2da2db040c21f48134 [2020-07-17 22:26:24,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:24,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:24,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:24,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:24,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:24,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:24" (1/1) ... [2020-07-17 22:26:24,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51541991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:24, skipping insertion in model container [2020-07-17 22:26:24,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:24" (1/1) ... [2020-07-17 22:26:24,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:24,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:24,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:24,969 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:25,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:25,039 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:25,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25 WrapperNode [2020-07-17 22:26:25,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:25,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:25,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:25,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:25,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (1/1) ... [2020-07-17 22:26:25,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:25,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:25,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:25,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:25,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (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-17 22:26:25,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:25,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:25,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:25,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:25,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:25,688 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:25,689 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:25,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:25 BoogieIcfgContainer [2020-07-17 22:26:25,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:25,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:25,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:25,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:25,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:24" (1/3) ... [2020-07-17 22:26:25,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:25, skipping insertion in model container [2020-07-17 22:26:25,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:25" (2/3) ... [2020-07-17 22:26:25,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:25, skipping insertion in model container [2020-07-17 22:26:25,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:25" (3/3) ... [2020-07-17 22:26:25,703 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-17 22:26:25,714 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:25,723 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:25,738 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:25,764 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:25,764 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:25,764 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:25,764 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:25,765 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:25,765 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:25,765 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:25,765 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-17 22:26:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:25,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:25,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:25,794 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2020-07-17 22:26:25,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:25,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070454238] [2020-07-17 22:26:25,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-17 22:26:26,033 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-17 22:26:26,036 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-17 22:26:26,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-17 22:26:26,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-17 22:26:26,037 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret9 := main(); {41#true} is VALID [2020-07-17 22:26:26,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {41#true} is VALID [2020-07-17 22:26:26,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {41#true} is VALID [2020-07-17 22:26:26,039 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {41#true} is VALID [2020-07-17 22:26:26,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} assume 0 != ~p1~0;~lk1~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,045 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,046 INFO L280 TraceCheckUtils]: 12: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {45#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:26,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {42#false} is VALID [2020-07-17 22:26:26,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-17 22:26:26,055 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-17 22:26:26,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070454238] [2020-07-17 22:26:26,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:26,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:26,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496420939] [2020-07-17 22:26:26,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:26,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:26,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:26,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:26,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:26,138 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-17 22:26:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,337 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2020-07-17 22:26:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:26,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:26,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-17 22:26:26,570 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-17 22:26:26,587 INFO L225 Difference]: With dead ends: 75 [2020-07-17 22:26:26,587 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:26:26,591 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-17 22:26:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:26:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-17 22:26:26,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:26,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-17 22:26:26,651 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-17 22:26:26,651 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-17 22:26:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,665 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-17 22:26:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-17 22:26:26,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,666 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-17 22:26:26,667 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-17 22:26:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,680 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-17 22:26:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-17 22:26:26,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:26,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:26,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:26,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:26:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-07-17 22:26:26,691 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2020-07-17 22:26:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:26,691 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-07-17 22:26:26,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-07-17 22:26:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:26,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:26,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:26,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:26,696 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2020-07-17 22:26:26,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:26,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050555644] [2020-07-17 22:26:26,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:26,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-17 22:26:26,806 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-17 22:26:26,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2020-07-17 22:26:26,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-17 22:26:26,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-17 22:26:26,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {303#true} call #t~ret9 := main(); {303#true} is VALID [2020-07-17 22:26:26,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {303#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {303#true} is VALID [2020-07-17 22:26:26,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {303#true} is VALID [2020-07-17 22:26:26,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {303#true} is VALID [2020-07-17 22:26:26,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#true} assume !(0 != ~p1~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {307#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:26,817 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p1~0; {304#false} is VALID [2020-07-17 22:26:26,817 INFO L280 TraceCheckUtils]: 16: Hoare triple {304#false} assume 1 != ~lk1~0; {304#false} is VALID [2020-07-17 22:26:26,817 INFO L280 TraceCheckUtils]: 17: Hoare triple {304#false} assume !false; {304#false} is VALID [2020-07-17 22:26:26,819 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-17 22:26:26,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050555644] [2020-07-17 22:26:26,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:26,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:26,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157545218] [2020-07-17 22:26:26,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:26,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:26,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:26,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:26,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:26,847 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2020-07-17 22:26:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:26,982 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-07-17 22:26:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:26,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-17 22:26:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-17 22:26:26,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-17 22:26:27,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:27,202 INFO L225 Difference]: With dead ends: 97 [2020-07-17 22:26:27,202 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:26:27,203 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-17 22:26:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:26:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-07-17 22:26:27,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:27,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2020-07-17 22:26:27,215 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2020-07-17 22:26:27,215 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2020-07-17 22:26:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,219 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-17 22:26:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-17 22:26:27,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,221 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2020-07-17 22:26:27,221 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2020-07-17 22:26:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,225 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-17 22:26:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-17 22:26:27,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:27,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-17 22:26:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2020-07-17 22:26:27,231 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2020-07-17 22:26:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:27,231 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2020-07-17 22:26:27,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2020-07-17 22:26:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:27,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:27,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:27,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:27,233 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2020-07-17 22:26:27,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:27,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882947542] [2020-07-17 22:26:27,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-17 22:26:27,281 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-17 22:26:27,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2020-07-17 22:26:27,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-17 22:26:27,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-17 22:26:27,282 INFO L263 TraceCheckUtils]: 3: Hoare triple {602#true} call #t~ret9 := main(); {602#true} is VALID [2020-07-17 22:26:27,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {602#true} is VALID [2020-07-17 22:26:27,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {602#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {602#true} is VALID [2020-07-17 22:26:27,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {602#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {602#true} is VALID [2020-07-17 22:26:27,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {602#true} assume 0 != ~p1~0;~lk1~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {606#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:27,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {603#false} is VALID [2020-07-17 22:26:27,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {603#false} assume 0 != ~p2~0; {603#false} is VALID [2020-07-17 22:26:27,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {603#false} assume 1 != ~lk2~0; {603#false} is VALID [2020-07-17 22:26:27,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {603#false} assume !false; {603#false} is VALID [2020-07-17 22:26:27,292 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-17 22:26:27,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882947542] [2020-07-17 22:26:27,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:27,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:27,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000072800] [2020-07-17 22:26:27,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:27,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:27,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:27,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:27,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:27,319 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2020-07-17 22:26:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,443 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2020-07-17 22:26:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:27,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:27,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-17 22:26:27,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:27,638 INFO L225 Difference]: With dead ends: 90 [2020-07-17 22:26:27,641 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:26:27,642 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-17 22:26:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:26:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-17 22:26:27,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:27,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-17 22:26:27,661 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-17 22:26:27,661 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-17 22:26:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,673 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-17 22:26:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-17 22:26:27,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,675 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-17 22:26:27,675 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-17 22:26:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,682 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-17 22:26:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-17 22:26:27,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:27,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 22:26:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2020-07-17 22:26:27,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2020-07-17 22:26:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:27,690 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2020-07-17 22:26:27,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2020-07-17 22:26:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:27,691 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:27,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:27,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:27,692 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2020-07-17 22:26:27,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:27,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771656744] [2020-07-17 22:26:27,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:27,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-17 22:26:27,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-17 22:26:27,748 INFO L263 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2020-07-17 22:26:27,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-17 22:26:27,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-17 22:26:27,749 INFO L263 TraceCheckUtils]: 3: Hoare triple {905#true} call #t~ret9 := main(); {905#true} is VALID [2020-07-17 22:26:27,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {905#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {905#true} is VALID [2020-07-17 22:26:27,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {905#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {905#true} is VALID [2020-07-17 22:26:27,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {905#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {905#true} is VALID [2020-07-17 22:26:27,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {905#true} assume !(0 != ~p1~0); {905#true} is VALID [2020-07-17 22:26:27,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {905#true} assume 0 != ~p2~0;~lk2~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,755 INFO L280 TraceCheckUtils]: 13: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,756 INFO L280 TraceCheckUtils]: 15: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {909#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:27,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {909#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {906#false} is VALID [2020-07-17 22:26:27,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {906#false} assume !false; {906#false} is VALID [2020-07-17 22:26:27,759 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-17 22:26:27,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771656744] [2020-07-17 22:26:27,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:27,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:27,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970447657] [2020-07-17 22:26:27,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:27,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:27,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:27,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:27,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:27,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:27,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:27,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:27,782 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2020-07-17 22:26:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,905 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2020-07-17 22:26:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:27,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-17 22:26:27,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-17 22:26:28,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,019 INFO L225 Difference]: With dead ends: 112 [2020-07-17 22:26:28,019 INFO L226 Difference]: Without dead ends: 110 [2020-07-17 22:26:28,021 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-17 22:26:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-17 22:26:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2020-07-17 22:26:28,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:28,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 80 states. [2020-07-17 22:26:28,044 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 80 states. [2020-07-17 22:26:28,044 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 80 states. [2020-07-17 22:26:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,050 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-17 22:26:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-17 22:26:28,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,052 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 110 states. [2020-07-17 22:26:28,052 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 110 states. [2020-07-17 22:26:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,058 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-17 22:26:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-17 22:26:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:28,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 22:26:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2020-07-17 22:26:28,064 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2020-07-17 22:26:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,064 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2020-07-17 22:26:28,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2020-07-17 22:26:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:28,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:28,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:28,066 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2020-07-17 22:26:28,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439833866] [2020-07-17 22:26:28,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-17 22:26:28,103 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-17 22:26:28,103 INFO L263 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2020-07-17 22:26:28,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-17 22:26:28,103 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-17 22:26:28,104 INFO L263 TraceCheckUtils]: 3: Hoare triple {1344#true} call #t~ret9 := main(); {1344#true} is VALID [2020-07-17 22:26:28,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {1344#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1344#true} is VALID [2020-07-17 22:26:28,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {1344#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1344#true} is VALID [2020-07-17 22:26:28,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {1344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1344#true} is VALID [2020-07-17 22:26:28,105 INFO L280 TraceCheckUtils]: 7: Hoare triple {1344#true} assume !(0 != ~p1~0); {1344#true} is VALID [2020-07-17 22:26:28,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {1344#true} assume !(0 != ~p2~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,111 INFO L280 TraceCheckUtils]: 13: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:28,114 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1345#false} is VALID [2020-07-17 22:26:28,114 INFO L280 TraceCheckUtils]: 17: Hoare triple {1345#false} assume 1 != ~lk2~0; {1345#false} is VALID [2020-07-17 22:26:28,115 INFO L280 TraceCheckUtils]: 18: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2020-07-17 22:26:28,115 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-17 22:26:28,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439833866] [2020-07-17 22:26:28,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644173766] [2020-07-17 22:26:28,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:28,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,138 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2020-07-17 22:26:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,271 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2020-07-17 22:26:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:28,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-17 22:26:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-17 22:26:28,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2020-07-17 22:26:28,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,431 INFO L225 Difference]: With dead ends: 184 [2020-07-17 22:26:28,431 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 22:26:28,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 22:26:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-17 22:26:28,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:28,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-17 22:26:28,452 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-17 22:26:28,452 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-17 22:26:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,459 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-17 22:26:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-17 22:26:28,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,460 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-17 22:26:28,460 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-17 22:26:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,470 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-17 22:26:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-17 22:26:28,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:28,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 22:26:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2020-07-17 22:26:28,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2020-07-17 22:26:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,476 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2020-07-17 22:26:28,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2020-07-17 22:26:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:28,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:28,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:28,478 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2020-07-17 22:26:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850586960] [2020-07-17 22:26:28,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-17 22:26:28,515 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-17 22:26:28,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {1893#true} call ULTIMATE.init(); {1893#true} is VALID [2020-07-17 22:26:28,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-17 22:26:28,516 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-17 22:26:28,516 INFO L263 TraceCheckUtils]: 3: Hoare triple {1893#true} call #t~ret9 := main(); {1893#true} is VALID [2020-07-17 22:26:28,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {1893#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1893#true} is VALID [2020-07-17 22:26:28,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {1893#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1893#true} is VALID [2020-07-17 22:26:28,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {1893#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1893#true} is VALID [2020-07-17 22:26:28,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {1893#true} assume !(0 != ~p1~0); {1893#true} is VALID [2020-07-17 22:26:28,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {1893#true} assume 0 != ~p2~0;~lk2~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,520 INFO L280 TraceCheckUtils]: 9: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:28,526 INFO L280 TraceCheckUtils]: 16: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1894#false} is VALID [2020-07-17 22:26:28,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {1894#false} assume 0 != ~p3~0; {1894#false} is VALID [2020-07-17 22:26:28,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {1894#false} assume 1 != ~lk3~0; {1894#false} is VALID [2020-07-17 22:26:28,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {1894#false} assume !false; {1894#false} is VALID [2020-07-17 22:26:28,527 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-17 22:26:28,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850586960] [2020-07-17 22:26:28,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508608524] [2020-07-17 22:26:28,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:28,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,554 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2020-07-17 22:26:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,686 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2020-07-17 22:26:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:28,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-17 22:26:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-17 22:26:28,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-17 22:26:28,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,833 INFO L225 Difference]: With dead ends: 165 [2020-07-17 22:26:28,833 INFO L226 Difference]: Without dead ends: 114 [2020-07-17 22:26:28,834 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-17 22:26:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-17 22:26:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-07-17 22:26:28,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:28,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2020-07-17 22:26:28,851 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2020-07-17 22:26:28,851 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2020-07-17 22:26:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,856 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-17 22:26:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-17 22:26:28,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,857 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2020-07-17 22:26:28,857 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2020-07-17 22:26:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,862 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-17 22:26:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-17 22:26:28,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:28,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-17 22:26:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2020-07-17 22:26:28,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2020-07-17 22:26:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,868 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2020-07-17 22:26:28,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2020-07-17 22:26:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:28,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:28,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:28,870 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2020-07-17 22:26:28,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084316573] [2020-07-17 22:26:28,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-17 22:26:28,902 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-17 22:26:28,902 INFO L263 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2020-07-17 22:26:28,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-17 22:26:28,903 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-17 22:26:28,903 INFO L263 TraceCheckUtils]: 3: Hoare triple {2429#true} call #t~ret9 := main(); {2429#true} is VALID [2020-07-17 22:26:28,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {2429#true} is VALID [2020-07-17 22:26:28,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {2429#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {2429#true} is VALID [2020-07-17 22:26:28,904 INFO L280 TraceCheckUtils]: 6: Hoare triple {2429#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2429#true} is VALID [2020-07-17 22:26:28,904 INFO L280 TraceCheckUtils]: 7: Hoare triple {2429#true} assume !(0 != ~p1~0); {2429#true} is VALID [2020-07-17 22:26:28,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {2429#true} assume !(0 != ~p2~0); {2429#true} is VALID [2020-07-17 22:26:28,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {2429#true} assume 0 != ~p3~0;~lk3~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,911 INFO L280 TraceCheckUtils]: 17: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:28,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {2433#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2430#false} is VALID [2020-07-17 22:26:28,912 INFO L280 TraceCheckUtils]: 19: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2020-07-17 22:26:28,912 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-17 22:26:28,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084316573] [2020-07-17 22:26:28,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061083417] [2020-07-17 22:26:28,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:28,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,936 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2020-07-17 22:26:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,073 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2020-07-17 22:26:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:29,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:29,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-17 22:26:29,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:29,186 INFO L225 Difference]: With dead ends: 204 [2020-07-17 22:26:29,187 INFO L226 Difference]: Without dead ends: 202 [2020-07-17 22:26:29,187 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-17 22:26:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-17 22:26:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2020-07-17 22:26:29,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:29,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 152 states. [2020-07-17 22:26:29,224 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 152 states. [2020-07-17 22:26:29,225 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 152 states. [2020-07-17 22:26:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,232 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-17 22:26:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-17 22:26:29,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:29,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:29,233 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 202 states. [2020-07-17 22:26:29,234 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 202 states. [2020-07-17 22:26:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,241 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-17 22:26:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-17 22:26:29,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:29,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:29,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:29,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-17 22:26:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2020-07-17 22:26:29,248 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2020-07-17 22:26:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:29,249 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2020-07-17 22:26:29,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2020-07-17 22:26:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:29,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:29,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:29,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:29,250 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:29,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2020-07-17 22:26:29,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:29,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012742500] [2020-07-17 22:26:29,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:29,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-17 22:26:29,280 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-17 22:26:29,280 INFO L263 TraceCheckUtils]: 0: Hoare triple {3222#true} call ULTIMATE.init(); {3222#true} is VALID [2020-07-17 22:26:29,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-17 22:26:29,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-17 22:26:29,281 INFO L263 TraceCheckUtils]: 3: Hoare triple {3222#true} call #t~ret9 := main(); {3222#true} is VALID [2020-07-17 22:26:29,281 INFO L280 TraceCheckUtils]: 4: Hoare triple {3222#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {3222#true} is VALID [2020-07-17 22:26:29,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {3222#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {3222#true} is VALID [2020-07-17 22:26:29,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {3222#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {3222#true} is VALID [2020-07-17 22:26:29,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {3222#true} assume !(0 != ~p1~0); {3222#true} is VALID [2020-07-17 22:26:29,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {3222#true} assume !(0 != ~p2~0); {3222#true} is VALID [2020-07-17 22:26:29,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {3222#true} assume !(0 != ~p3~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:29,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3223#false} is VALID [2020-07-17 22:26:29,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {3223#false} assume 1 != ~lk3~0; {3223#false} is VALID [2020-07-17 22:26:29,288 INFO L280 TraceCheckUtils]: 19: Hoare triple {3223#false} assume !false; {3223#false} is VALID [2020-07-17 22:26:29,289 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-17 22:26:29,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012742500] [2020-07-17 22:26:29,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:29,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:29,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50214282] [2020-07-17 22:26:29,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:29,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:29,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:29,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:29,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:29,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:29,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:29,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:29,311 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2020-07-17 22:26:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,468 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2020-07-17 22:26:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:29,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-17 22:26:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-17 22:26:29,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2020-07-17 22:26:29,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:29,645 INFO L225 Difference]: With dead ends: 352 [2020-07-17 22:26:29,645 INFO L226 Difference]: Without dead ends: 210 [2020-07-17 22:26:29,646 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-17 22:26:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-17 22:26:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-07-17 22:26:29,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:29,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2020-07-17 22:26:29,675 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2020-07-17 22:26:29,675 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2020-07-17 22:26:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,681 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-17 22:26:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-17 22:26:29,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:29,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:29,682 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2020-07-17 22:26:29,682 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2020-07-17 22:26:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,688 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-17 22:26:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-17 22:26:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:29,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:29,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-17 22:26:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2020-07-17 22:26:29,694 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2020-07-17 22:26:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:29,695 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2020-07-17 22:26:29,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2020-07-17 22:26:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:29,696 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:29,696 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-17 22:26:29,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:29,697 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2020-07-17 22:26:29,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:29,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131284693] [2020-07-17 22:26:29,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:29,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-17 22:26:29,734 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-17 22:26:29,734 INFO L263 TraceCheckUtils]: 0: Hoare triple {4243#true} call ULTIMATE.init(); {4243#true} is VALID [2020-07-17 22:26:29,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-17 22:26:29,734 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-17 22:26:29,735 INFO L263 TraceCheckUtils]: 3: Hoare triple {4243#true} call #t~ret9 := main(); {4243#true} is VALID [2020-07-17 22:26:29,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {4243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {4243#true} is VALID [2020-07-17 22:26:29,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {4243#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {4243#true} is VALID [2020-07-17 22:26:29,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {4243#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4243#true} is VALID [2020-07-17 22:26:29,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {4243#true} assume !(0 != ~p1~0); {4243#true} is VALID [2020-07-17 22:26:29,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {4243#true} assume !(0 != ~p2~0); {4243#true} is VALID [2020-07-17 22:26:29,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {4243#true} assume 0 != ~p3~0;~lk3~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:29,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {4244#false} is VALID [2020-07-17 22:26:29,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {4244#false} assume 0 != ~p4~0; {4244#false} is VALID [2020-07-17 22:26:29,742 INFO L280 TraceCheckUtils]: 19: Hoare triple {4244#false} assume 1 != ~lk4~0; {4244#false} is VALID [2020-07-17 22:26:29,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {4244#false} assume !false; {4244#false} is VALID [2020-07-17 22:26:29,743 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-17 22:26:29,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131284693] [2020-07-17 22:26:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:29,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36314899] [2020-07-17 22:26:29,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:29,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:29,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:29,770 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-17 22:26:29,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:29,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:29,772 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2020-07-17 22:26:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:29,905 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-07-17 22:26:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:29,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-17 22:26:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-17 22:26:29,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2020-07-17 22:26:30,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:30,069 INFO L225 Difference]: With dead ends: 312 [2020-07-17 22:26:30,069 INFO L226 Difference]: Without dead ends: 214 [2020-07-17 22:26:30,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-17 22:26:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-07-17 22:26:30,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:30,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2020-07-17 22:26:30,098 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2020-07-17 22:26:30,098 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2020-07-17 22:26:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,104 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-17 22:26:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-17 22:26:30,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,105 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2020-07-17 22:26:30,105 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2020-07-17 22:26:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,111 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-17 22:26:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-17 22:26:30,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:30,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-07-17 22:26:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2020-07-17 22:26:30,118 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2020-07-17 22:26:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:30,119 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2020-07-17 22:26:30,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2020-07-17 22:26:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:30,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:30,120 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-17 22:26:30,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:30,120 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2020-07-17 22:26:30,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:30,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146340960] [2020-07-17 22:26:30,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-17 22:26:30,147 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-17 22:26:30,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2020-07-17 22:26:30,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-17 22:26:30,148 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-17 22:26:30,148 INFO L263 TraceCheckUtils]: 3: Hoare triple {5236#true} call #t~ret9 := main(); {5236#true} is VALID [2020-07-17 22:26:30,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {5236#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {5236#true} is VALID [2020-07-17 22:26:30,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {5236#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {5236#true} is VALID [2020-07-17 22:26:30,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {5236#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5236#true} is VALID [2020-07-17 22:26:30,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {5236#true} assume !(0 != ~p1~0); {5236#true} is VALID [2020-07-17 22:26:30,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {5236#true} assume !(0 != ~p2~0); {5236#true} is VALID [2020-07-17 22:26:30,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {5236#true} assume !(0 != ~p3~0); {5236#true} is VALID [2020-07-17 22:26:30,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {5236#true} assume 0 != ~p4~0;~lk4~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:30,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {5240#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {5237#false} is VALID [2020-07-17 22:26:30,157 INFO L280 TraceCheckUtils]: 20: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2020-07-17 22:26:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:30,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146340960] [2020-07-17 22:26:30,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:30,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076975808] [2020-07-17 22:26:30,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:30,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:30,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:30,181 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-17 22:26:30,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:30,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:30,182 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2020-07-17 22:26:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,333 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2020-07-17 22:26:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-17 22:26:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-17 22:26:30,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-17 22:26:30,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:30,435 INFO L225 Difference]: With dead ends: 380 [2020-07-17 22:26:30,435 INFO L226 Difference]: Without dead ends: 378 [2020-07-17 22:26:30,436 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-17 22:26:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-07-17 22:26:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2020-07-17 22:26:30,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:30,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 296 states. [2020-07-17 22:26:30,471 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 296 states. [2020-07-17 22:26:30,471 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 296 states. [2020-07-17 22:26:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,485 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-17 22:26:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-17 22:26:30,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,486 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 378 states. [2020-07-17 22:26:30,487 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 378 states. [2020-07-17 22:26:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,499 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-17 22:26:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-17 22:26:30,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:30,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:30,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:30,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-17 22:26:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2020-07-17 22:26:30,510 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2020-07-17 22:26:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:30,510 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2020-07-17 22:26:30,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2020-07-17 22:26:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:30,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:30,512 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-17 22:26:30,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:30,513 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2020-07-17 22:26:30,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:30,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620443212] [2020-07-17 22:26:30,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:30,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-17 22:26:30,558 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-17 22:26:30,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {6713#true} call ULTIMATE.init(); {6713#true} is VALID [2020-07-17 22:26:30,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-17 22:26:30,559 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-17 22:26:30,560 INFO L263 TraceCheckUtils]: 3: Hoare triple {6713#true} call #t~ret9 := main(); {6713#true} is VALID [2020-07-17 22:26:30,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {6713#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {6713#true} is VALID [2020-07-17 22:26:30,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {6713#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {6713#true} is VALID [2020-07-17 22:26:30,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {6713#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {6713#true} is VALID [2020-07-17 22:26:30,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {6713#true} assume !(0 != ~p1~0); {6713#true} is VALID [2020-07-17 22:26:30,561 INFO L280 TraceCheckUtils]: 8: Hoare triple {6713#true} assume !(0 != ~p2~0); {6713#true} is VALID [2020-07-17 22:26:30,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {6713#true} assume !(0 != ~p3~0); {6713#true} is VALID [2020-07-17 22:26:30,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {6713#true} assume !(0 != ~p4~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,568 INFO L280 TraceCheckUtils]: 16: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:30,569 INFO L280 TraceCheckUtils]: 18: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p4~0; {6714#false} is VALID [2020-07-17 22:26:30,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {6714#false} assume 1 != ~lk4~0; {6714#false} is VALID [2020-07-17 22:26:30,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {6714#false} assume !false; {6714#false} is VALID [2020-07-17 22:26:30,570 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-17 22:26:30,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620443212] [2020-07-17 22:26:30,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:30,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:30,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710064126] [2020-07-17 22:26:30,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:30,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:30,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:30,593 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-17 22:26:30,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:30,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:30,594 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2020-07-17 22:26:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,785 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2020-07-17 22:26:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:30,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-17 22:26:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-17 22:26:30,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2020-07-17 22:26:30,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:30,950 INFO L225 Difference]: With dead ends: 684 [2020-07-17 22:26:30,951 INFO L226 Difference]: Without dead ends: 402 [2020-07-17 22:26:30,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-07-17 22:26:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2020-07-17 22:26:31,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:31,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 400 states. [2020-07-17 22:26:31,013 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 400 states. [2020-07-17 22:26:31,013 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 400 states. [2020-07-17 22:26:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,028 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-17 22:26:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-17 22:26:31,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,030 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand 402 states. [2020-07-17 22:26:31,030 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 402 states. [2020-07-17 22:26:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,044 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-17 22:26:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-17 22:26:31,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:31,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-07-17 22:26:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2020-07-17 22:26:31,060 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2020-07-17 22:26:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:31,060 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2020-07-17 22:26:31,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2020-07-17 22:26:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:31,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:31,064 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-17 22:26:31,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:31,065 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2020-07-17 22:26:31,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:31,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66520873] [2020-07-17 22:26:31,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-17 22:26:31,122 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-17 22:26:31,122 INFO L263 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8662#true} is VALID [2020-07-17 22:26:31,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-17 22:26:31,123 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-17 22:26:31,123 INFO L263 TraceCheckUtils]: 3: Hoare triple {8662#true} call #t~ret9 := main(); {8662#true} is VALID [2020-07-17 22:26:31,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {8662#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {8662#true} is VALID [2020-07-17 22:26:31,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {8662#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {8662#true} is VALID [2020-07-17 22:26:31,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {8662#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {8662#true} is VALID [2020-07-17 22:26:31,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {8662#true} assume !(0 != ~p1~0); {8662#true} is VALID [2020-07-17 22:26:31,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {8662#true} assume !(0 != ~p2~0); {8662#true} is VALID [2020-07-17 22:26:31,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {8662#true} assume !(0 != ~p3~0); {8662#true} is VALID [2020-07-17 22:26:31,129 INFO L280 TraceCheckUtils]: 10: Hoare triple {8662#true} assume 0 != ~p4~0;~lk4~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,135 INFO L280 TraceCheckUtils]: 12: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,140 INFO L280 TraceCheckUtils]: 14: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,147 INFO L280 TraceCheckUtils]: 16: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:31,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {8663#false} is VALID [2020-07-17 22:26:31,149 INFO L280 TraceCheckUtils]: 19: Hoare triple {8663#false} assume 0 != ~p5~0; {8663#false} is VALID [2020-07-17 22:26:31,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {8663#false} assume 1 != ~lk5~0; {8663#false} is VALID [2020-07-17 22:26:31,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2020-07-17 22:26:31,150 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-17 22:26:31,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66520873] [2020-07-17 22:26:31,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:31,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:31,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037280231] [2020-07-17 22:26:31,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:31,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:31,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:31,171 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-17 22:26:31,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:31,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:31,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:31,172 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2020-07-17 22:26:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,360 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2020-07-17 22:26:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:31,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-17 22:26:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-17 22:26:31,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2020-07-17 22:26:31,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:31,518 INFO L225 Difference]: With dead ends: 600 [2020-07-17 22:26:31,519 INFO L226 Difference]: Without dead ends: 410 [2020-07-17 22:26:31,520 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-17 22:26:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-07-17 22:26:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2020-07-17 22:26:31,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:31,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 408 states. [2020-07-17 22:26:31,588 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 408 states. [2020-07-17 22:26:31,588 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 408 states. [2020-07-17 22:26:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,603 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-17 22:26:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-17 22:26:31,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,604 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand 410 states. [2020-07-17 22:26:31,605 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 410 states. [2020-07-17 22:26:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,621 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-17 22:26:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-17 22:26:31,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:31,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:31,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:31,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-07-17 22:26:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2020-07-17 22:26:31,637 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2020-07-17 22:26:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:31,638 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2020-07-17 22:26:31,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2020-07-17 22:26:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:31,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:31,639 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-17 22:26:31,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:31,639 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2020-07-17 22:26:31,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:31,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867131123] [2020-07-17 22:26:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:31,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-17 22:26:31,663 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-17 22:26:31,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {10551#true} call ULTIMATE.init(); {10551#true} is VALID [2020-07-17 22:26:31,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-17 22:26:31,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-17 22:26:31,664 INFO L263 TraceCheckUtils]: 3: Hoare triple {10551#true} call #t~ret9 := main(); {10551#true} is VALID [2020-07-17 22:26:31,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {10551#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {10551#true} is VALID [2020-07-17 22:26:31,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {10551#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {10551#true} is VALID [2020-07-17 22:26:31,665 INFO L280 TraceCheckUtils]: 6: Hoare triple {10551#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {10551#true} is VALID [2020-07-17 22:26:31,665 INFO L280 TraceCheckUtils]: 7: Hoare triple {10551#true} assume !(0 != ~p1~0); {10551#true} is VALID [2020-07-17 22:26:31,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {10551#true} assume !(0 != ~p2~0); {10551#true} is VALID [2020-07-17 22:26:31,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {10551#true} assume !(0 != ~p3~0); {10551#true} is VALID [2020-07-17 22:26:31,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {10551#true} assume !(0 != ~p4~0); {10551#true} is VALID [2020-07-17 22:26:31,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {10551#true} assume 0 != ~p5~0;~lk5~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,668 INFO L280 TraceCheckUtils]: 14: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,669 INFO L280 TraceCheckUtils]: 16: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,672 INFO L280 TraceCheckUtils]: 19: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:31,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {10555#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {10552#false} is VALID [2020-07-17 22:26:31,672 INFO L280 TraceCheckUtils]: 21: Hoare triple {10552#false} assume !false; {10552#false} is VALID [2020-07-17 22:26:31,673 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-17 22:26:31,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867131123] [2020-07-17 22:26:31,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:31,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:31,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70425985] [2020-07-17 22:26:31,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:31,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:31,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:31,700 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-17 22:26:31,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:31,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:31,702 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2020-07-17 22:26:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:31,966 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2020-07-17 22:26:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:31,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:31,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-17 22:26:32,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:32,090 INFO L225 Difference]: With dead ends: 716 [2020-07-17 22:26:32,091 INFO L226 Difference]: Without dead ends: 714 [2020-07-17 22:26:32,091 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-17 22:26:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-07-17 22:26:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2020-07-17 22:26:32,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 584 states. [2020-07-17 22:26:32,162 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 584 states. [2020-07-17 22:26:32,162 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 584 states. [2020-07-17 22:26:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,197 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-17 22:26:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-17 22:26:32,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,199 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 714 states. [2020-07-17 22:26:32,199 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 714 states. [2020-07-17 22:26:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,234 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-17 22:26:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-17 22:26:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:32,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-17 22:26:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2020-07-17 22:26:32,263 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2020-07-17 22:26:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:32,263 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2020-07-17 22:26:32,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2020-07-17 22:26:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:32,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:32,265 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-17 22:26:32,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:32,266 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2020-07-17 22:26:32,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:32,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096046585] [2020-07-17 22:26:32,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:32,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-17 22:26:32,308 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-17 22:26:32,308 INFO L263 TraceCheckUtils]: 0: Hoare triple {13348#true} call ULTIMATE.init(); {13348#true} is VALID [2020-07-17 22:26:32,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-17 22:26:32,309 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-17 22:26:32,309 INFO L263 TraceCheckUtils]: 3: Hoare triple {13348#true} call #t~ret9 := main(); {13348#true} is VALID [2020-07-17 22:26:32,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {13348#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {13348#true} is VALID [2020-07-17 22:26:32,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {13348#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {13348#true} is VALID [2020-07-17 22:26:32,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {13348#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {13348#true} is VALID [2020-07-17 22:26:32,310 INFO L280 TraceCheckUtils]: 7: Hoare triple {13348#true} assume !(0 != ~p1~0); {13348#true} is VALID [2020-07-17 22:26:32,310 INFO L280 TraceCheckUtils]: 8: Hoare triple {13348#true} assume !(0 != ~p2~0); {13348#true} is VALID [2020-07-17 22:26:32,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {13348#true} assume !(0 != ~p3~0); {13348#true} is VALID [2020-07-17 22:26:32,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {13348#true} assume !(0 != ~p4~0); {13348#true} is VALID [2020-07-17 22:26:32,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {13348#true} assume !(0 != ~p5~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,312 INFO L280 TraceCheckUtils]: 13: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,313 INFO L280 TraceCheckUtils]: 14: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,313 INFO L280 TraceCheckUtils]: 15: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,314 INFO L280 TraceCheckUtils]: 17: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,315 INFO L280 TraceCheckUtils]: 18: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:32,315 INFO L280 TraceCheckUtils]: 19: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p5~0; {13349#false} is VALID [2020-07-17 22:26:32,316 INFO L280 TraceCheckUtils]: 20: Hoare triple {13349#false} assume 1 != ~lk5~0; {13349#false} is VALID [2020-07-17 22:26:32,316 INFO L280 TraceCheckUtils]: 21: Hoare triple {13349#false} assume !false; {13349#false} is VALID [2020-07-17 22:26:32,318 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-17 22:26:32,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096046585] [2020-07-17 22:26:32,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:32,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:32,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623777494] [2020-07-17 22:26:32,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:32,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:32,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:32,339 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-17 22:26:32,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:32,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:32,340 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2020-07-17 22:26:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,684 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2020-07-17 22:26:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:32,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-17 22:26:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-17 22:26:32,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-17 22:26:32,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:32,867 INFO L225 Difference]: With dead ends: 1340 [2020-07-17 22:26:32,868 INFO L226 Difference]: Without dead ends: 778 [2020-07-17 22:26:32,869 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-17 22:26:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-07-17 22:26:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2020-07-17 22:26:33,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:33,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand 776 states. [2020-07-17 22:26:33,026 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand 776 states. [2020-07-17 22:26:33,027 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 776 states. [2020-07-17 22:26:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,061 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-17 22:26:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-17 22:26:33,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,063 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 778 states. [2020-07-17 22:26:33,063 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 778 states. [2020-07-17 22:26:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,096 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-17 22:26:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-17 22:26:33,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:33,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-17 22:26:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2020-07-17 22:26:33,134 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2020-07-17 22:26:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:33,134 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2020-07-17 22:26:33,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2020-07-17 22:26:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:33,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:33,136 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-17 22:26:33,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:33,137 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2020-07-17 22:26:33,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:33,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556036836] [2020-07-17 22:26:33,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-17 22:26:33,161 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-17 22:26:33,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {17121#true} call ULTIMATE.init(); {17121#true} is VALID [2020-07-17 22:26:33,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-17 22:26:33,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-17 22:26:33,162 INFO L263 TraceCheckUtils]: 3: Hoare triple {17121#true} call #t~ret9 := main(); {17121#true} is VALID [2020-07-17 22:26:33,162 INFO L280 TraceCheckUtils]: 4: Hoare triple {17121#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {17121#true} is VALID [2020-07-17 22:26:33,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {17121#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {17121#true} is VALID [2020-07-17 22:26:33,163 INFO L280 TraceCheckUtils]: 6: Hoare triple {17121#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {17121#true} is VALID [2020-07-17 22:26:33,163 INFO L280 TraceCheckUtils]: 7: Hoare triple {17121#true} assume !(0 != ~p1~0); {17121#true} is VALID [2020-07-17 22:26:33,163 INFO L280 TraceCheckUtils]: 8: Hoare triple {17121#true} assume !(0 != ~p2~0); {17121#true} is VALID [2020-07-17 22:26:33,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {17121#true} assume !(0 != ~p3~0); {17121#true} is VALID [2020-07-17 22:26:33,164 INFO L280 TraceCheckUtils]: 10: Hoare triple {17121#true} assume !(0 != ~p4~0); {17121#true} is VALID [2020-07-17 22:26:33,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {17121#true} assume 0 != ~p5~0;~lk5~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,166 INFO L280 TraceCheckUtils]: 13: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,166 INFO L280 TraceCheckUtils]: 14: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:33,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {17122#false} is VALID [2020-07-17 22:26:33,169 INFO L280 TraceCheckUtils]: 20: Hoare triple {17122#false} assume 0 != ~p6~0; {17122#false} is VALID [2020-07-17 22:26:33,170 INFO L280 TraceCheckUtils]: 21: Hoare triple {17122#false} assume 1 != ~lk6~0; {17122#false} is VALID [2020-07-17 22:26:33,170 INFO L280 TraceCheckUtils]: 22: Hoare triple {17122#false} assume !false; {17122#false} is VALID [2020-07-17 22:26:33,171 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-17 22:26:33,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556036836] [2020-07-17 22:26:33,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:33,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:33,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443982810] [2020-07-17 22:26:33,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:33,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:33,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:33,194 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-17 22:26:33,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:33,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:33,195 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2020-07-17 22:26:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,516 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2020-07-17 22:26:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:33,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:33,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-17 22:26:33,726 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-17 22:26:33,770 INFO L225 Difference]: With dead ends: 1164 [2020-07-17 22:26:33,770 INFO L226 Difference]: Without dead ends: 794 [2020-07-17 22:26:33,772 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-17 22:26:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-17 22:26:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2020-07-17 22:26:33,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:33,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand 792 states. [2020-07-17 22:26:33,930 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand 792 states. [2020-07-17 22:26:33,930 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 792 states. [2020-07-17 22:26:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,973 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-17 22:26:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-17 22:26:33,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,975 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand 794 states. [2020-07-17 22:26:33,976 INFO L87 Difference]: Start difference. First operand 792 states. Second operand 794 states. [2020-07-17 22:26:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,013 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-17 22:26:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-17 22:26:34,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:34,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:34,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:34,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-07-17 22:26:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2020-07-17 22:26:34,053 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2020-07-17 22:26:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:34,053 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2020-07-17 22:26:34,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2020-07-17 22:26:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:34,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:34,055 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-17 22:26:34,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:34,055 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2020-07-17 22:26:34,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:34,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358960547] [2020-07-17 22:26:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:34,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-17 22:26:34,110 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-17 22:26:34,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {20766#true} call ULTIMATE.init(); {20766#true} is VALID [2020-07-17 22:26:34,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-17 22:26:34,111 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-17 22:26:34,112 INFO L263 TraceCheckUtils]: 3: Hoare triple {20766#true} call #t~ret9 := main(); {20766#true} is VALID [2020-07-17 22:26:34,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {20766#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {20766#true} is VALID [2020-07-17 22:26:34,113 INFO L280 TraceCheckUtils]: 5: Hoare triple {20766#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {20766#true} is VALID [2020-07-17 22:26:34,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {20766#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {20766#true} is VALID [2020-07-17 22:26:34,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {20766#true} assume !(0 != ~p1~0); {20766#true} is VALID [2020-07-17 22:26:34,114 INFO L280 TraceCheckUtils]: 8: Hoare triple {20766#true} assume !(0 != ~p2~0); {20766#true} is VALID [2020-07-17 22:26:34,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {20766#true} assume !(0 != ~p3~0); {20766#true} is VALID [2020-07-17 22:26:34,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {20766#true} assume !(0 != ~p4~0); {20766#true} is VALID [2020-07-17 22:26:34,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {20766#true} assume !(0 != ~p5~0); {20766#true} is VALID [2020-07-17 22:26:34,115 INFO L280 TraceCheckUtils]: 12: Hoare triple {20766#true} assume 0 != ~p6~0;~lk6~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,120 INFO L280 TraceCheckUtils]: 19: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:34,132 INFO L280 TraceCheckUtils]: 21: Hoare triple {20770#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {20767#false} is VALID [2020-07-17 22:26:34,133 INFO L280 TraceCheckUtils]: 22: Hoare triple {20767#false} assume !false; {20767#false} is VALID [2020-07-17 22:26:34,134 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-17 22:26:34,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358960547] [2020-07-17 22:26:34,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:34,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:34,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536847427] [2020-07-17 22:26:34,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:34,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:34,172 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-17 22:26:34,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:34,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:34,174 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2020-07-17 22:26:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:34,601 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2020-07-17 22:26:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:34,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:26:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:26:34,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-17 22:26:34,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:34,870 INFO L225 Difference]: With dead ends: 1356 [2020-07-17 22:26:34,870 INFO L226 Difference]: Without dead ends: 1354 [2020-07-17 22:26:34,871 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-17 22:26:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-07-17 22:26:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2020-07-17 22:26:35,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:35,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1160 states. [2020-07-17 22:26:35,049 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1160 states. [2020-07-17 22:26:35,049 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1160 states. [2020-07-17 22:26:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,146 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-17 22:26:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-17 22:26:35,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1354 states. [2020-07-17 22:26:35,149 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1354 states. [2020-07-17 22:26:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,233 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-17 22:26:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-17 22:26:35,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:35,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:35,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2020-07-17 22:26:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2020-07-17 22:26:35,302 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2020-07-17 22:26:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:35,303 INFO L479 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2020-07-17 22:26:35,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2020-07-17 22:26:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:35,304 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:35,305 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-17 22:26:35,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:35,305 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2020-07-17 22:26:35,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:35,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651615199] [2020-07-17 22:26:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:35,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-17 22:26:35,340 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-17 22:26:35,340 INFO L263 TraceCheckUtils]: 0: Hoare triple {26107#true} call ULTIMATE.init(); {26107#true} is VALID [2020-07-17 22:26:35,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-17 22:26:35,341 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-17 22:26:35,341 INFO L263 TraceCheckUtils]: 3: Hoare triple {26107#true} call #t~ret9 := main(); {26107#true} is VALID [2020-07-17 22:26:35,341 INFO L280 TraceCheckUtils]: 4: Hoare triple {26107#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {26107#true} is VALID [2020-07-17 22:26:35,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {26107#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {26107#true} is VALID [2020-07-17 22:26:35,342 INFO L280 TraceCheckUtils]: 6: Hoare triple {26107#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {26107#true} is VALID [2020-07-17 22:26:35,342 INFO L280 TraceCheckUtils]: 7: Hoare triple {26107#true} assume !(0 != ~p1~0); {26107#true} is VALID [2020-07-17 22:26:35,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {26107#true} assume !(0 != ~p2~0); {26107#true} is VALID [2020-07-17 22:26:35,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {26107#true} assume !(0 != ~p3~0); {26107#true} is VALID [2020-07-17 22:26:35,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {26107#true} assume !(0 != ~p4~0); {26107#true} is VALID [2020-07-17 22:26:35,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {26107#true} assume !(0 != ~p5~0); {26107#true} is VALID [2020-07-17 22:26:35,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {26107#true} assume !(0 != ~p6~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,345 INFO L280 TraceCheckUtils]: 14: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,345 INFO L280 TraceCheckUtils]: 15: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,347 INFO L280 TraceCheckUtils]: 16: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,348 INFO L280 TraceCheckUtils]: 17: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,349 INFO L280 TraceCheckUtils]: 19: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:35,350 INFO L280 TraceCheckUtils]: 20: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p6~0; {26108#false} is VALID [2020-07-17 22:26:35,350 INFO L280 TraceCheckUtils]: 21: Hoare triple {26108#false} assume 1 != ~lk6~0; {26108#false} is VALID [2020-07-17 22:26:35,351 INFO L280 TraceCheckUtils]: 22: Hoare triple {26108#false} assume !false; {26108#false} is VALID [2020-07-17 22:26:35,351 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-17 22:26:35,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651615199] [2020-07-17 22:26:35,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:35,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:35,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233393059] [2020-07-17 22:26:35,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:35,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:35,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:35,376 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-17 22:26:35,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:35,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:35,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:35,377 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2020-07-17 22:26:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:35,988 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2020-07-17 22:26:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:35,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-17 22:26:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-17 22:26:35,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2020-07-17 22:26:36,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:36,192 INFO L225 Difference]: With dead ends: 2636 [2020-07-17 22:26:36,193 INFO L226 Difference]: Without dead ends: 1514 [2020-07-17 22:26:36,195 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-17 22:26:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-07-17 22:26:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2020-07-17 22:26:36,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:36,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand 1512 states. [2020-07-17 22:26:36,526 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand 1512 states. [2020-07-17 22:26:36,526 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand 1512 states. [2020-07-17 22:26:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,640 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-17 22:26:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-17 22:26:36,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,643 INFO L74 IsIncluded]: Start isIncluded. First operand 1512 states. Second operand 1514 states. [2020-07-17 22:26:36,643 INFO L87 Difference]: Start difference. First operand 1512 states. Second operand 1514 states. [2020-07-17 22:26:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:36,756 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-17 22:26:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-17 22:26:36,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:36,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:36,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:36,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2020-07-17 22:26:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2020-07-17 22:26:36,825 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2020-07-17 22:26:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:36,825 INFO L479 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2020-07-17 22:26:36,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2020-07-17 22:26:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:36,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:36,827 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-17 22:26:36,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:36,827 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2020-07-17 22:26:36,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:36,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541553405] [2020-07-17 22:26:36,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:36,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-17 22:26:36,855 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-17 22:26:36,855 INFO L263 TraceCheckUtils]: 0: Hoare triple {33464#true} call ULTIMATE.init(); {33464#true} is VALID [2020-07-17 22:26:36,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-17 22:26:36,855 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-17 22:26:36,856 INFO L263 TraceCheckUtils]: 3: Hoare triple {33464#true} call #t~ret9 := main(); {33464#true} is VALID [2020-07-17 22:26:36,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {33464#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {33464#true} is VALID [2020-07-17 22:26:36,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {33464#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {33464#true} is VALID [2020-07-17 22:26:36,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {33464#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {33464#true} is VALID [2020-07-17 22:26:36,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {33464#true} assume !(0 != ~p1~0); {33464#true} is VALID [2020-07-17 22:26:36,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {33464#true} assume !(0 != ~p2~0); {33464#true} is VALID [2020-07-17 22:26:36,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {33464#true} assume !(0 != ~p3~0); {33464#true} is VALID [2020-07-17 22:26:36,857 INFO L280 TraceCheckUtils]: 10: Hoare triple {33464#true} assume !(0 != ~p4~0); {33464#true} is VALID [2020-07-17 22:26:36,858 INFO L280 TraceCheckUtils]: 11: Hoare triple {33464#true} assume !(0 != ~p5~0); {33464#true} is VALID [2020-07-17 22:26:36,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {33464#true} assume 0 != ~p6~0;~lk6~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {33468#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,875 INFO L280 TraceCheckUtils]: 15: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,875 INFO L280 TraceCheckUtils]: 16: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,876 INFO L280 TraceCheckUtils]: 17: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,876 INFO L280 TraceCheckUtils]: 18: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,877 INFO L280 TraceCheckUtils]: 19: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:36,884 INFO L280 TraceCheckUtils]: 20: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {33465#false} is VALID [2020-07-17 22:26:36,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {33465#false} assume 0 != ~p7~0; {33465#false} is VALID [2020-07-17 22:26:36,884 INFO L280 TraceCheckUtils]: 22: Hoare triple {33465#false} assume 1 != ~lk7~0; {33465#false} is VALID [2020-07-17 22:26:36,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {33465#false} assume !false; {33465#false} is VALID [2020-07-17 22:26:36,885 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-17 22:26:36,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541553405] [2020-07-17 22:26:36,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:36,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:36,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475623848] [2020-07-17 22:26:36,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:36,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:36,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:36,912 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-17 22:26:36,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:36,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:36,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:36,914 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2020-07-17 22:26:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:37,463 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2020-07-17 22:26:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:37,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-17 22:26:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-17 22:26:37,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2020-07-17 22:26:37,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:37,687 INFO L225 Difference]: With dead ends: 2268 [2020-07-17 22:26:37,687 INFO L226 Difference]: Without dead ends: 1546 [2020-07-17 22:26:37,689 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-17 22:26:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-07-17 22:26:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2020-07-17 22:26:38,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:38,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1544 states. [2020-07-17 22:26:38,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1544 states. [2020-07-17 22:26:38,092 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1544 states. [2020-07-17 22:26:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,166 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-17 22:26:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-17 22:26:38,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:38,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:38,167 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1546 states. [2020-07-17 22:26:38,167 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1546 states. [2020-07-17 22:26:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:38,239 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-17 22:26:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-17 22:26:38,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:38,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:38,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:38,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-17 22:26:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2020-07-17 22:26:38,315 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2020-07-17 22:26:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:38,315 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2020-07-17 22:26:38,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2020-07-17 22:26:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:38,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:38,316 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-17 22:26:38,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 22:26:38,316 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2020-07-17 22:26:38,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:38,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780794866] [2020-07-17 22:26:38,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:38,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-17 22:26:38,353 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-17 22:26:38,353 INFO L263 TraceCheckUtils]: 0: Hoare triple {40549#true} call ULTIMATE.init(); {40549#true} is VALID [2020-07-17 22:26:38,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-17 22:26:38,354 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-17 22:26:38,354 INFO L263 TraceCheckUtils]: 3: Hoare triple {40549#true} call #t~ret9 := main(); {40549#true} is VALID [2020-07-17 22:26:38,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {40549#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {40549#true} is VALID [2020-07-17 22:26:38,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {40549#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {40549#true} is VALID [2020-07-17 22:26:38,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {40549#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {40549#true} assume !(0 != ~p1~0); {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {40549#true} assume !(0 != ~p2~0); {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {40549#true} assume !(0 != ~p3~0); {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {40549#true} assume !(0 != ~p4~0); {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {40549#true} assume !(0 != ~p5~0); {40549#true} is VALID [2020-07-17 22:26:38,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {40549#true} assume !(0 != ~p6~0); {40549#true} is VALID [2020-07-17 22:26:38,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {40549#true} assume 0 != ~p7~0;~lk7~0 := 1; {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,363 INFO L280 TraceCheckUtils]: 16: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,364 INFO L280 TraceCheckUtils]: 18: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,365 INFO L280 TraceCheckUtils]: 20: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,365 INFO L280 TraceCheckUtils]: 21: Hoare triple {40553#(= main_~lk7~0 1)} assume 0 != ~p7~0; {40553#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:38,366 INFO L280 TraceCheckUtils]: 22: Hoare triple {40553#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {40550#false} is VALID [2020-07-17 22:26:38,366 INFO L280 TraceCheckUtils]: 23: Hoare triple {40550#false} assume !false; {40550#false} is VALID [2020-07-17 22:26:38,367 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-17 22:26:38,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780794866] [2020-07-17 22:26:38,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:38,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:38,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609820282] [2020-07-17 22:26:38,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:38,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:38,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:38,389 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-17 22:26:38,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:38,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:38,390 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2020-07-17 22:26:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:39,447 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2020-07-17 22:26:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:39,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-17 22:26:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-17 22:26:39,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-17 22:26:39,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:39,739 INFO L225 Difference]: With dead ends: 2572 [2020-07-17 22:26:39,740 INFO L226 Difference]: Without dead ends: 2570 [2020-07-17 22:26:39,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-07-17 22:26:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2020-07-17 22:26:40,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:40,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2570 states. Second operand 2312 states. [2020-07-17 22:26:40,141 INFO L74 IsIncluded]: Start isIncluded. First operand 2570 states. Second operand 2312 states. [2020-07-17 22:26:40,142 INFO L87 Difference]: Start difference. First operand 2570 states. Second operand 2312 states. [2020-07-17 22:26:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:40,362 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-17 22:26:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-17 22:26:40,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:40,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:40,365 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2570 states. [2020-07-17 22:26:40,365 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2570 states. [2020-07-17 22:26:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:40,566 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-17 22:26:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-17 22:26:40,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:40,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:40,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:40,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2020-07-17 22:26:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2020-07-17 22:26:40,751 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2020-07-17 22:26:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:40,751 INFO L479 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2020-07-17 22:26:40,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2020-07-17 22:26:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:40,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:40,753 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-17 22:26:40,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 22:26:40,753 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2020-07-17 22:26:40,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:40,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939483878] [2020-07-17 22:26:40,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:40,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-17 22:26:40,785 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-17 22:26:40,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {50786#true} call ULTIMATE.init(); {50786#true} is VALID [2020-07-17 22:26:40,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-17 22:26:40,786 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-17 22:26:40,786 INFO L263 TraceCheckUtils]: 3: Hoare triple {50786#true} call #t~ret9 := main(); {50786#true} is VALID [2020-07-17 22:26:40,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {50786#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {50786#true} is VALID [2020-07-17 22:26:40,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {50786#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {50786#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {50786#true} assume !(0 != ~p1~0); {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {50786#true} assume !(0 != ~p2~0); {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {50786#true} assume !(0 != ~p3~0); {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {50786#true} assume !(0 != ~p4~0); {50786#true} is VALID [2020-07-17 22:26:40,787 INFO L280 TraceCheckUtils]: 11: Hoare triple {50786#true} assume !(0 != ~p5~0); {50786#true} is VALID [2020-07-17 22:26:40,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {50786#true} assume !(0 != ~p6~0); {50786#true} is VALID [2020-07-17 22:26:40,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {50786#true} assume !(0 != ~p7~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,789 INFO L280 TraceCheckUtils]: 15: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:40,793 INFO L280 TraceCheckUtils]: 21: Hoare triple {50790#(= 0 main_~p7~0)} assume 0 != ~p7~0; {50787#false} is VALID [2020-07-17 22:26:40,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {50787#false} assume 1 != ~lk7~0; {50787#false} is VALID [2020-07-17 22:26:40,793 INFO L280 TraceCheckUtils]: 23: Hoare triple {50787#false} assume !false; {50787#false} is VALID [2020-07-17 22:26:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:40,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939483878] [2020-07-17 22:26:40,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:40,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:40,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317688474] [2020-07-17 22:26:40,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:40,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:40,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:40,816 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-17 22:26:40,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:40,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:40,817 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2020-07-17 22:26:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:42,367 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2020-07-17 22:26:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:42,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-17 22:26:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-17 22:26:42,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-17 22:26:42,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:42,769 INFO L225 Difference]: With dead ends: 5196 [2020-07-17 22:26:42,769 INFO L226 Difference]: Without dead ends: 2954 [2020-07-17 22:26:42,772 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-17 22:26:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-07-17 22:26:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2020-07-17 22:26:43,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:43,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2952 states. [2020-07-17 22:26:43,546 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2952 states. [2020-07-17 22:26:43,547 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2952 states. [2020-07-17 22:26:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:43,775 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-17 22:26:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-17 22:26:43,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:43,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:43,778 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand 2954 states. [2020-07-17 22:26:43,779 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand 2954 states. [2020-07-17 22:26:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:44,030 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-17 22:26:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-17 22:26:44,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:44,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:44,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:44,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-07-17 22:26:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2020-07-17 22:26:44,275 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2020-07-17 22:26:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:44,275 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2020-07-17 22:26:44,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2020-07-17 22:26:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:44,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:44,277 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-17 22:26:44,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 22:26:44,278 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2020-07-17 22:26:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:44,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815034001] [2020-07-17 22:26:44,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:44,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {65183#true} call ULTIMATE.init(); {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L263 TraceCheckUtils]: 3: Hoare triple {65183#true} call #t~ret9 := main(); {65183#true} is VALID [2020-07-17 22:26:44,304 INFO L280 TraceCheckUtils]: 4: Hoare triple {65183#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {65183#true} is VALID [2020-07-17 22:26:44,305 INFO L280 TraceCheckUtils]: 5: Hoare triple {65183#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {65183#true} is VALID [2020-07-17 22:26:44,305 INFO L280 TraceCheckUtils]: 6: Hoare triple {65183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {65183#true} is VALID [2020-07-17 22:26:44,305 INFO L280 TraceCheckUtils]: 7: Hoare triple {65183#true} assume !(0 != ~p1~0); {65183#true} is VALID [2020-07-17 22:26:44,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {65183#true} assume !(0 != ~p2~0); {65183#true} is VALID [2020-07-17 22:26:44,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {65183#true} assume !(0 != ~p3~0); {65183#true} is VALID [2020-07-17 22:26:44,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {65183#true} assume !(0 != ~p4~0); {65183#true} is VALID [2020-07-17 22:26:44,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {65183#true} assume !(0 != ~p5~0); {65183#true} is VALID [2020-07-17 22:26:44,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {65183#true} assume !(0 != ~p6~0); {65183#true} is VALID [2020-07-17 22:26:44,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {65183#true} assume 0 != ~p7~0;~lk7~0 := 1; {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,307 INFO L280 TraceCheckUtils]: 14: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,307 INFO L280 TraceCheckUtils]: 15: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,308 INFO L280 TraceCheckUtils]: 16: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,309 INFO L280 TraceCheckUtils]: 18: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,309 INFO L280 TraceCheckUtils]: 19: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,310 INFO L280 TraceCheckUtils]: 20: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:44,310 INFO L280 TraceCheckUtils]: 21: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {65184#false} is VALID [2020-07-17 22:26:44,310 INFO L280 TraceCheckUtils]: 22: Hoare triple {65184#false} assume 0 != ~p8~0; {65184#false} is VALID [2020-07-17 22:26:44,311 INFO L280 TraceCheckUtils]: 23: Hoare triple {65184#false} assume 1 != ~lk8~0; {65184#false} is VALID [2020-07-17 22:26:44,311 INFO L280 TraceCheckUtils]: 24: Hoare triple {65184#false} assume !false; {65184#false} is VALID [2020-07-17 22:26:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:44,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815034001] [2020-07-17 22:26:44,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:44,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:44,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070339351] [2020-07-17 22:26:44,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:44,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:44,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:44,343 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-17 22:26:44,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:44,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:44,345 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2020-07-17 22:26:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:45,717 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2020-07-17 22:26:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:45,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-17 22:26:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-17 22:26:45,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2020-07-17 22:26:45,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:46,114 INFO L225 Difference]: With dead ends: 4428 [2020-07-17 22:26:46,114 INFO L226 Difference]: Without dead ends: 3018 [2020-07-17 22:26:46,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-07-17 22:26:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2020-07-17 22:26:46,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:46,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3018 states. Second operand 3016 states. [2020-07-17 22:26:46,845 INFO L74 IsIncluded]: Start isIncluded. First operand 3018 states. Second operand 3016 states. [2020-07-17 22:26:46,845 INFO L87 Difference]: Start difference. First operand 3018 states. Second operand 3016 states. [2020-07-17 22:26:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:47,089 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-17 22:26:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-17 22:26:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:47,093 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3018 states. [2020-07-17 22:26:47,093 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3018 states. [2020-07-17 22:26:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:47,348 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-17 22:26:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-17 22:26:47,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:47,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:47,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:47,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-17 22:26:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2020-07-17 22:26:47,629 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2020-07-17 22:26:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:47,629 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2020-07-17 22:26:47,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2020-07-17 22:26:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:47,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:47,631 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-17 22:26:47,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 22:26:47,632 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2020-07-17 22:26:47,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:47,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894122217] [2020-07-17 22:26:47,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:47,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-17 22:26:47,658 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-17 22:26:47,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {79004#true} call ULTIMATE.init(); {79004#true} is VALID [2020-07-17 22:26:47,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-17 22:26:47,659 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-17 22:26:47,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {79004#true} call #t~ret9 := main(); {79004#true} is VALID [2020-07-17 22:26:47,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {79004#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {79004#true} is VALID [2020-07-17 22:26:47,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {79004#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {79004#true} is VALID [2020-07-17 22:26:47,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {79004#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {79004#true} assume !(0 != ~p1~0); {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {79004#true} assume !(0 != ~p2~0); {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {79004#true} assume !(0 != ~p3~0); {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {79004#true} assume !(0 != ~p4~0); {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {79004#true} assume !(0 != ~p5~0); {79004#true} is VALID [2020-07-17 22:26:47,660 INFO L280 TraceCheckUtils]: 12: Hoare triple {79004#true} assume !(0 != ~p6~0); {79004#true} is VALID [2020-07-17 22:26:47,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {79004#true} assume !(0 != ~p7~0); {79004#true} is VALID [2020-07-17 22:26:47,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {79004#true} assume !(0 != ~p8~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,662 INFO L280 TraceCheckUtils]: 15: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,662 INFO L280 TraceCheckUtils]: 16: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,663 INFO L280 TraceCheckUtils]: 17: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,663 INFO L280 TraceCheckUtils]: 18: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:47,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {79008#(= 0 main_~p8~0)} assume 0 != ~p8~0; {79005#false} is VALID [2020-07-17 22:26:47,683 INFO L280 TraceCheckUtils]: 23: Hoare triple {79005#false} assume 1 != ~lk8~0; {79005#false} is VALID [2020-07-17 22:26:47,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {79005#false} assume !false; {79005#false} is VALID [2020-07-17 22:26:47,683 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-17 22:26:47,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894122217] [2020-07-17 22:26:47,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:47,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:47,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466464515] [2020-07-17 22:26:47,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:47,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:47,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:47,718 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-17 22:26:47,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:47,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:47,719 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2020-07-17 22:26:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:51,493 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2020-07-17 22:26:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:51,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:51,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-17 22:26:51,618 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-17 22:26:51,914 INFO L225 Difference]: With dead ends: 8650 [2020-07-17 22:26:51,914 INFO L226 Difference]: Without dead ends: 3016 [2020-07-17 22:26:51,919 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-17 22:26:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-07-17 22:26:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2020-07-17 22:26:52,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:52,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3016 states. Second operand 3016 states. [2020-07-17 22:26:52,715 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-17 22:26:52,716 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-17 22:26:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:52,959 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-17 22:26:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-17 22:26:52,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:52,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:52,962 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-17 22:26:52,962 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-17 22:26:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:53,204 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-17 22:26:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-17 22:26:53,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:53,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:53,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:53,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-17 22:26:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2020-07-17 22:26:53,462 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2020-07-17 22:26:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:53,462 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2020-07-17 22:26:53,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-17 22:26:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:53,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:53,464 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-17 22:26:53,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 22:26:53,465 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2020-07-17 22:26:53,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:53,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219406546] [2020-07-17 22:26:53,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:53,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-17 22:26:53,506 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-17 22:26:53,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {97234#true} call ULTIMATE.init(); {97234#true} is VALID [2020-07-17 22:26:53,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-17 22:26:53,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L263 TraceCheckUtils]: 3: Hoare triple {97234#true} call #t~ret9 := main(); {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {97234#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {97234#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L280 TraceCheckUtils]: 6: Hoare triple {97234#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L280 TraceCheckUtils]: 7: Hoare triple {97234#true} assume !(0 != ~p1~0); {97234#true} is VALID [2020-07-17 22:26:53,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {97234#true} assume !(0 != ~p2~0); {97234#true} is VALID [2020-07-17 22:26:53,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {97234#true} assume !(0 != ~p3~0); {97234#true} is VALID [2020-07-17 22:26:53,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {97234#true} assume !(0 != ~p4~0); {97234#true} is VALID [2020-07-17 22:26:53,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {97234#true} assume !(0 != ~p5~0); {97234#true} is VALID [2020-07-17 22:26:53,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {97234#true} assume !(0 != ~p6~0); {97234#true} is VALID [2020-07-17 22:26:53,509 INFO L280 TraceCheckUtils]: 13: Hoare triple {97234#true} assume !(0 != ~p7~0); {97234#true} is VALID [2020-07-17 22:26:53,509 INFO L280 TraceCheckUtils]: 14: Hoare triple {97234#true} assume 0 != ~p8~0;~lk8~0 := 1; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,510 INFO L280 TraceCheckUtils]: 15: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {97238#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:53,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {97238#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {97235#false} is VALID [2020-07-17 22:26:53,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {97235#false} assume !false; {97235#false} is VALID [2020-07-17 22:26:53,514 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-17 22:26:53,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219406546] [2020-07-17 22:26:53,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:53,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:53,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296976623] [2020-07-17 22:26:53,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:53,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:53,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:53,538 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-17 22:26:53,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:53,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:53,540 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2020-07-17 22:26:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:54,523 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-17 22:26:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:54,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-17 22:26:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-17 22:26:54,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2020-07-17 22:26:54,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:54,571 INFO L225 Difference]: With dead ends: 3016 [2020-07-17 22:26:54,572 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:26:54,577 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-17 22:26:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:26:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:26:54,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:54,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:54,578 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:54,578 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:54,578 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:54,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:54,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:54,578 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:54,578 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:54,579 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:54,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:54,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:54,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:54,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:26:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:26:54,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-17 22:26:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:54,580 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:26:54,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:54,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:54,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 22:26:54,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:26:54,615 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:26:54,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:54,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:54,616 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:26:54,616 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:26:54,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,617 INFO L268 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,618 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2020-07-17 22:26:54,618 INFO L268 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2020-07-17 22:26:54,618 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2020-07-17 22:26:54,618 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-17 22:26:54,618 INFO L268 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2020-07-17 22:26:54,619 INFO L268 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,619 INFO L268 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,619 INFO L268 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,619 INFO L268 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-07-17 22:26:54,620 INFO L268 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,621 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-17 22:26:54,621 INFO L268 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,621 INFO L268 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,621 INFO L268 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-07-17 22:26:54,621 INFO L268 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2020-07-17 22:26:54,621 INFO L268 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2020-07-17 22:26:54,626 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:54,626 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:54,626 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:26:54,627 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-17 22:26:54,628 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-17 22:26:54,629 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-17 22:26:54,630 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-17 22:26:54,631 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-17 22:26:54,632 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-17 22:26:54,633 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-17 22:26:54,633 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:26:54,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:26:54 BoogieIcfgContainer [2020-07-17 22:26:54,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:26:54,645 INFO L168 Benchmark]: Toolchain (without parser) took 29936.28 ms. Allocated memory was 140.0 MB in the beginning and 446.2 MB in the end (delta: 306.2 MB). Free memory was 103.3 MB in the beginning and 131.3 MB in the end (delta: -28.0 MB). Peak memory consumption was 278.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,646 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 140.0 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.97 ms. Allocated memory is still 140.0 MB. Free memory was 103.1 MB in the beginning and 92.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,650 INFO L168 Benchmark]: Boogie Preprocessor took 121.32 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 92.3 MB in the beginning and 182.3 MB in the end (delta: -90.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,650 INFO L168 Benchmark]: RCFGBuilder took 531.30 ms. Allocated memory is still 204.5 MB. Free memory was 182.3 MB in the beginning and 155.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,650 INFO L168 Benchmark]: TraceAbstraction took 28947.90 ms. Allocated memory was 204.5 MB in the beginning and 446.2 MB in the end (delta: 241.7 MB). Free memory was 155.3 MB in the beginning and 131.3 MB in the end (delta: 24.0 MB). Peak memory consumption was 265.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:54,652 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 140.0 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.97 ms. Allocated memory is still 140.0 MB. Free memory was 103.1 MB in the beginning and 92.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.32 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 92.3 MB in the beginning and 182.3 MB in the end (delta: -90.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.30 ms. Allocated memory is still 204.5 MB. Free memory was 182.3 MB in the beginning and 155.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28947.90 ms. Allocated memory was 204.5 MB in the beginning and 446.2 MB in the end (delta: 241.7 MB). Free memory was 155.3 MB in the beginning and 131.3 MB in the end (delta: 24.0 MB). Peak memory consumption was 265.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...