/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:20:47,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:20:47,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:20:47,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:20:47,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:20:47,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:20:47,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:20:47,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:20:47,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:20:47,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:20:47,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:20:47,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:20:47,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:20:47,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:20:47,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:20:47,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:20:47,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:20:47,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:20:47,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:20:47,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:20:47,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:20:47,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:20:47,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:20:47,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:20:47,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:20:47,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:20:47,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:20:47,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:20:47,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:20:47,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:20:47,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:20:47,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:20:47,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:20:47,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:20:47,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:20:47,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:20:47,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:20:47,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:20:47,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:20:47,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:20:47,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:20:47,605 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-08 12:20:47,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:20:47,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:20:47,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:20:47,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:20:47,625 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:20:47,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:20:47,625 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:20:47,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:20:47,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:20:47,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:20:47,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:20:47,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:20:47,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:20:47,627 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:20:47,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:20:47,627 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:20:47,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:20:47,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:20:47,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:20:47,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:20:47,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:20:47,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:20:47,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:20:47,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:20:47,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:20:47,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:20:47,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:20:47,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:20:47,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:20:47,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:20:47,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:20:47,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:20:47,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:20:47,956 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:20:47,956 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:20:47,957 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2020-07-08 12:20:48,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9262f1e/cd3ae2aa600c49d68d92a66bff82f937/FLAG06d2fb181 [2020-07-08 12:20:48,504 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:20:48,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2020-07-08 12:20:48,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9262f1e/cd3ae2aa600c49d68d92a66bff82f937/FLAG06d2fb181 [2020-07-08 12:20:48,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9262f1e/cd3ae2aa600c49d68d92a66bff82f937 [2020-07-08 12:20:48,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:20:48,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:20:48,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:20:48,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:20:48,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:20:48,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:20:48" (1/1) ... [2020-07-08 12:20:48,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381793df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:48, skipping insertion in model container [2020-07-08 12:20:48,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:20:48" (1/1) ... [2020-07-08 12:20:48,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:20:48,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:20:49,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:20:49,097 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:20:49,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:20:49,152 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:20:49,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49 WrapperNode [2020-07-08 12:20:49,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:20:49,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:20:49,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:20:49,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:20:49,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... [2020-07-08 12:20:49,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:20:49,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:20:49,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:20:49,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:20:49,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:20:49,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:20:49,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:20:49,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:20:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:20:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:20:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:20:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:20:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:20:49,911 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:20:49,911 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:20:49,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:20:49 BoogieIcfgContainer [2020-07-08 12:20:49,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:20:49,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:20:49,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:20:49,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:20:49,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:20:48" (1/3) ... [2020-07-08 12:20:49,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2861e2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:20:49, skipping insertion in model container [2020-07-08 12:20:49,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:20:49" (2/3) ... [2020-07-08 12:20:49,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2861e2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:20:49, skipping insertion in model container [2020-07-08 12:20:49,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:20:49" (3/3) ... [2020-07-08 12:20:49,925 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-07-08 12:20:49,937 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:20:49,946 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:20:49,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:20:49,987 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:20:49,988 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:20:49,988 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:20:49,988 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:20:49,989 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:20:49,989 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:20:49,989 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:20:49,989 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:20:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-08 12:20:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:20:50,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:50,020 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-08 12:20:50,021 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:50,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2020-07-08 12:20:50,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:50,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255354335] [2020-07-08 12:20:50,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:50,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 12:20:50,340 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-08 12:20:50,343 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-08 12:20:50,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 12:20:50,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-08 12:20:50,346 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret11 := main(); {47#true} is VALID [2020-07-08 12:20:50,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {47#true} is VALID [2020-07-08 12:20:50,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {47#true} is VALID [2020-07-08 12:20:50,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {47#true} is VALID [2020-07-08 12:20:50,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume 0 != ~p1~0;~lk1~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,369 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,371 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {51#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:20:50,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {48#false} is VALID [2020-07-08 12:20:50,373 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-08 12:20:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:20:50,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255354335] [2020-07-08 12:20:50,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:50,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:50,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827068408] [2020-07-08 12:20:50,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:20:50,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:50,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:50,475 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-08 12:20:50,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:50,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:50,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:50,490 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-08 12:20:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:50,767 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2020-07-08 12:20:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:50,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:20:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-08 12:20:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-08 12:20:50,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-08 12:20:51,011 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-08 12:20:51,049 INFO L225 Difference]: With dead ends: 87 [2020-07-08 12:20:51,050 INFO L226 Difference]: Without dead ends: 72 [2020-07-08 12:20:51,059 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-08 12:20:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-08 12:20:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-07-08 12:20:51,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:51,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 50 states. [2020-07-08 12:20:51,126 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 50 states. [2020-07-08 12:20:51,126 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 50 states. [2020-07-08 12:20:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,143 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-08 12:20:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-08 12:20:51,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:51,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:51,147 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 72 states. [2020-07-08 12:20:51,147 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 72 states. [2020-07-08 12:20:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,166 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-08 12:20:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-08 12:20:51,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:51,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:51,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:51,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-08 12:20:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2020-07-08 12:20:51,193 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2020-07-08 12:20:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:51,194 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2020-07-08 12:20:51,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2020-07-08 12:20:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:20:51,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:51,197 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-08 12:20:51,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:20:51,198 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2020-07-08 12:20:51,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:51,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188086669] [2020-07-08 12:20:51,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-08 12:20:51,331 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-08 12:20:51,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-08 12:20:51,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-08 12:20:51,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-08 12:20:51,333 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret11 := main(); {353#true} is VALID [2020-07-08 12:20:51,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {353#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {353#true} is VALID [2020-07-08 12:20:51,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {353#true} is VALID [2020-07-08 12:20:51,334 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {353#true} is VALID [2020-07-08 12:20:51,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} assume !(0 != ~p1~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,339 INFO L280 TraceCheckUtils]: 12: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {357#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,341 INFO L280 TraceCheckUtils]: 15: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-08 12:20:51,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p1~0; {354#false} is VALID [2020-07-08 12:20:51,343 INFO L280 TraceCheckUtils]: 18: Hoare triple {354#false} assume 1 != ~lk1~0; {354#false} is VALID [2020-07-08 12:20:51,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-08 12:20:51,344 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-08 12:20:51,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188086669] [2020-07-08 12:20:51,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:51,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:51,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422029238] [2020-07-08 12:20:51,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:20:51,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:51,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:51,379 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-08 12:20:51,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:51,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:51,380 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2020-07-08 12:20:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,530 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2020-07-08 12:20:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:51,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:20:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:20:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-08 12:20:51,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-08 12:20:51,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:51,759 INFO L225 Difference]: With dead ends: 117 [2020-07-08 12:20:51,760 INFO L226 Difference]: Without dead ends: 72 [2020-07-08 12:20:51,761 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-08 12:20:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-08 12:20:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-08 12:20:51,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:51,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2020-07-08 12:20:51,776 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2020-07-08 12:20:51,777 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2020-07-08 12:20:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,781 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-08 12:20:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-08 12:20:51,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:51,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:51,783 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2020-07-08 12:20:51,784 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2020-07-08 12:20:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:51,789 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-08 12:20:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-08 12:20:51,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:51,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:51,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:51,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 12:20:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2020-07-08 12:20:51,795 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2020-07-08 12:20:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:51,796 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2020-07-08 12:20:51,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2020-07-08 12:20:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:20:51,797 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:51,797 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-08 12:20:51,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:20:51,798 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2020-07-08 12:20:51,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:51,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832309602] [2020-07-08 12:20:51,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:51,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-08 12:20:51,881 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-08 12:20:51,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-08 12:20:51,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-08 12:20:51,882 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-08 12:20:51,882 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret11 := main(); {708#true} is VALID [2020-07-08 12:20:51,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {708#true} is VALID [2020-07-08 12:20:51,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {708#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {708#true} is VALID [2020-07-08 12:20:51,884 INFO L280 TraceCheckUtils]: 6: Hoare triple {708#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {708#true} is VALID [2020-07-08 12:20:51,889 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#true} assume 0 != ~p1~0;~lk1~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,901 INFO L280 TraceCheckUtils]: 15: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,905 INFO L280 TraceCheckUtils]: 16: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:20:51,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {709#false} is VALID [2020-07-08 12:20:51,906 INFO L280 TraceCheckUtils]: 18: Hoare triple {709#false} assume 0 != ~p2~0; {709#false} is VALID [2020-07-08 12:20:51,907 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#false} assume 1 != ~lk2~0; {709#false} is VALID [2020-07-08 12:20:51,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-08 12:20:51,908 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-08 12:20:51,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832309602] [2020-07-08 12:20:51,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:51,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:51,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493255736] [2020-07-08 12:20:51,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:51,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:51,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:51,941 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-08 12:20:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:51,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:51,943 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2020-07-08 12:20:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,103 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2020-07-08 12:20:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:52,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-08 12:20:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-08 12:20:52,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-08 12:20:52,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:52,308 INFO L225 Difference]: With dead ends: 108 [2020-07-08 12:20:52,308 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 12:20:52,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 12:20:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-07-08 12:20:52,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:52,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2020-07-08 12:20:52,330 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2020-07-08 12:20:52,330 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2020-07-08 12:20:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,334 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-08 12:20:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-08 12:20:52,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,335 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2020-07-08 12:20:52,336 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2020-07-08 12:20:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,340 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-08 12:20:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-08 12:20:52,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:52,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-08 12:20:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-07-08 12:20:52,345 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-07-08 12:20:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:52,345 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-07-08 12:20:52,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-07-08 12:20:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:20:52,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:52,346 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-08 12:20:52,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:20:52,347 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2020-07-08 12:20:52,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:52,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338028166] [2020-07-08 12:20:52,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-08 12:20:52,390 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-08 12:20:52,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2020-07-08 12:20:52,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-08 12:20:52,391 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-08 12:20:52,391 INFO L263 TraceCheckUtils]: 3: Hoare triple {1065#true} call #t~ret11 := main(); {1065#true} is VALID [2020-07-08 12:20:52,391 INFO L280 TraceCheckUtils]: 4: Hoare triple {1065#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1065#true} is VALID [2020-07-08 12:20:52,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {1065#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1065#true} is VALID [2020-07-08 12:20:52,392 INFO L280 TraceCheckUtils]: 6: Hoare triple {1065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1065#true} is VALID [2020-07-08 12:20:52,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {1065#true} assume !(0 != ~p1~0); {1065#true} is VALID [2020-07-08 12:20:52,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {1065#true} assume 0 != ~p2~0;~lk2~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,393 INFO L280 TraceCheckUtils]: 9: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,397 INFO L280 TraceCheckUtils]: 14: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,398 INFO L280 TraceCheckUtils]: 15: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,400 INFO L280 TraceCheckUtils]: 16: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,402 INFO L280 TraceCheckUtils]: 17: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,403 INFO L280 TraceCheckUtils]: 18: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:20:52,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {1069#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1066#false} is VALID [2020-07-08 12:20:52,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2020-07-08 12:20:52,407 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-08 12:20:52,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338028166] [2020-07-08 12:20:52,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:52,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:52,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579363919] [2020-07-08 12:20:52,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:52,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:52,430 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-08 12:20:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:52,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:52,432 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2020-07-08 12:20:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,547 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2020-07-08 12:20:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:52,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:20:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:20:52,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 12:20:52,687 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-08 12:20:52,693 INFO L225 Difference]: With dead ends: 136 [2020-07-08 12:20:52,694 INFO L226 Difference]: Without dead ends: 134 [2020-07-08 12:20:52,696 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-08 12:20:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-08 12:20:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-07-08 12:20:52,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:52,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 96 states. [2020-07-08 12:20:52,726 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 96 states. [2020-07-08 12:20:52,726 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 96 states. [2020-07-08 12:20:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,736 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-08 12:20:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-08 12:20:52,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,737 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 134 states. [2020-07-08 12:20:52,738 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 134 states. [2020-07-08 12:20:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:52,747 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-08 12:20:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-08 12:20:52,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:52,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:52,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:52,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-08 12:20:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2020-07-08 12:20:52,756 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2020-07-08 12:20:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:52,756 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2020-07-08 12:20:52,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2020-07-08 12:20:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:20:52,757 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:52,758 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-08 12:20:52,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:20:52,761 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2020-07-08 12:20:52,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:52,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122819294] [2020-07-08 12:20:52,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:52,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-08 12:20:52,835 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-08 12:20:52,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1592#true} is VALID [2020-07-08 12:20:52,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-08 12:20:52,836 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-08 12:20:52,836 INFO L263 TraceCheckUtils]: 3: Hoare triple {1592#true} call #t~ret11 := main(); {1592#true} is VALID [2020-07-08 12:20:52,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {1592#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1592#true} is VALID [2020-07-08 12:20:52,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {1592#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1592#true} is VALID [2020-07-08 12:20:52,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {1592#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1592#true} is VALID [2020-07-08 12:20:52,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {1592#true} assume !(0 != ~p1~0); {1592#true} is VALID [2020-07-08 12:20:52,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {1592#true} assume !(0 != ~p2~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,839 INFO L280 TraceCheckUtils]: 9: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,842 INFO L280 TraceCheckUtils]: 12: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,843 INFO L280 TraceCheckUtils]: 13: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-08 12:20:52,846 INFO L280 TraceCheckUtils]: 18: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1593#false} is VALID [2020-07-08 12:20:52,846 INFO L280 TraceCheckUtils]: 19: Hoare triple {1593#false} assume 1 != ~lk2~0; {1593#false} is VALID [2020-07-08 12:20:52,846 INFO L280 TraceCheckUtils]: 20: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2020-07-08 12:20:52,847 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-08 12:20:52,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122819294] [2020-07-08 12:20:52,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:52,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:52,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563877942] [2020-07-08 12:20:52,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:52,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:52,887 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-08 12:20:52,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:52,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:52,889 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2020-07-08 12:20:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,029 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2020-07-08 12:20:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:53,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:20:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-08 12:20:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-08 12:20:53,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2020-07-08 12:20:53,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:53,250 INFO L225 Difference]: With dead ends: 224 [2020-07-08 12:20:53,250 INFO L226 Difference]: Without dead ends: 136 [2020-07-08 12:20:53,252 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-08 12:20:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-08 12:20:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-08 12:20:53,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:53,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2020-07-08 12:20:53,273 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2020-07-08 12:20:53,273 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2020-07-08 12:20:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,283 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-08 12:20:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-08 12:20:53,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,284 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2020-07-08 12:20:53,284 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2020-07-08 12:20:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,291 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-08 12:20:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-08 12:20:53,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:53,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-08 12:20:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2020-07-08 12:20:53,301 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2020-07-08 12:20:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:53,301 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2020-07-08 12:20:53,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2020-07-08 12:20:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:53,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:53,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:20:53,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:20:53,304 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2020-07-08 12:20:53,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:53,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488919135] [2020-07-08 12:20:53,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-08 12:20:53,406 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-08 12:20:53,407 INFO L263 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2020-07-08 12:20:53,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-08 12:20:53,407 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-08 12:20:53,408 INFO L263 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret11 := main(); {2253#true} is VALID [2020-07-08 12:20:53,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {2253#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2253#true} is VALID [2020-07-08 12:20:53,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {2253#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2253#true} is VALID [2020-07-08 12:20:53,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {2253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2253#true} is VALID [2020-07-08 12:20:53,409 INFO L280 TraceCheckUtils]: 7: Hoare triple {2253#true} assume !(0 != ~p1~0); {2253#true} is VALID [2020-07-08 12:20:53,415 INFO L280 TraceCheckUtils]: 8: Hoare triple {2253#true} assume 0 != ~p2~0;~lk2~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,416 INFO L280 TraceCheckUtils]: 9: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,418 INFO L280 TraceCheckUtils]: 12: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,422 INFO L280 TraceCheckUtils]: 17: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:20:53,422 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2254#false} is VALID [2020-07-08 12:20:53,423 INFO L280 TraceCheckUtils]: 19: Hoare triple {2254#false} assume 0 != ~p3~0; {2254#false} is VALID [2020-07-08 12:20:53,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {2254#false} assume 1 != ~lk3~0; {2254#false} is VALID [2020-07-08 12:20:53,423 INFO L280 TraceCheckUtils]: 21: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2020-07-08 12:20:53,424 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-08 12:20:53,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488919135] [2020-07-08 12:20:53,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:53,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:53,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320758971] [2020-07-08 12:20:53,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:53,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:53,450 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-08 12:20:53,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:53,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:53,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:53,451 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2020-07-08 12:20:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,600 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2020-07-08 12:20:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:53,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-08 12:20:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-08 12:20:53,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2020-07-08 12:20:53,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:53,821 INFO L225 Difference]: With dead ends: 201 [2020-07-08 12:20:53,821 INFO L226 Difference]: Without dead ends: 138 [2020-07-08 12:20:53,822 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-08 12:20:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-08 12:20:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-08 12:20:53,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:53,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-08 12:20:53,866 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-08 12:20:53,866 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-08 12:20:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,872 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-08 12:20:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-08 12:20:53,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,873 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-08 12:20:53,873 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-08 12:20:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:53,878 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-08 12:20:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-08 12:20:53,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:53,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:53,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:53,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-08 12:20:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2020-07-08 12:20:53,885 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2020-07-08 12:20:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:53,885 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2020-07-08 12:20:53,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2020-07-08 12:20:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:53,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:53,886 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-08 12:20:53,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:20:53,887 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:53,887 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2020-07-08 12:20:53,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:53,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802117458] [2020-07-08 12:20:53,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:53,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-08 12:20:53,948 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-08 12:20:53,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2897#true} is VALID [2020-07-08 12:20:53,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-08 12:20:53,949 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-08 12:20:53,950 INFO L263 TraceCheckUtils]: 3: Hoare triple {2897#true} call #t~ret11 := main(); {2897#true} is VALID [2020-07-08 12:20:53,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {2897#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2897#true} is VALID [2020-07-08 12:20:53,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {2897#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2897#true} is VALID [2020-07-08 12:20:53,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {2897#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2897#true} is VALID [2020-07-08 12:20:53,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {2897#true} assume !(0 != ~p1~0); {2897#true} is VALID [2020-07-08 12:20:53,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {2897#true} assume !(0 != ~p2~0); {2897#true} is VALID [2020-07-08 12:20:53,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {2897#true} assume 0 != ~p3~0;~lk3~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,959 INFO L280 TraceCheckUtils]: 11: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,961 INFO L280 TraceCheckUtils]: 14: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,962 INFO L280 TraceCheckUtils]: 16: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,962 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,963 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,964 INFO L280 TraceCheckUtils]: 19: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:20:53,964 INFO L280 TraceCheckUtils]: 20: Hoare triple {2901#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2898#false} is VALID [2020-07-08 12:20:53,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {2898#false} assume !false; {2898#false} is VALID [2020-07-08 12:20:53,965 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-08 12:20:53,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802117458] [2020-07-08 12:20:53,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:53,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:53,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143677561] [2020-07-08 12:20:53,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:53,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:53,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:53,990 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-08 12:20:53,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:53,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:53,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:53,991 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2020-07-08 12:20:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,133 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2020-07-08 12:20:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:54,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 12:20:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 12:20:54,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-08 12:20:54,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:54,271 INFO L225 Difference]: With dead ends: 252 [2020-07-08 12:20:54,271 INFO L226 Difference]: Without dead ends: 250 [2020-07-08 12:20:54,272 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-08 12:20:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-07-08 12:20:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2020-07-08 12:20:54,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:54,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 184 states. [2020-07-08 12:20:54,293 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 184 states. [2020-07-08 12:20:54,294 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 184 states. [2020-07-08 12:20:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,305 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-08 12:20:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-08 12:20:54,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,306 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 250 states. [2020-07-08 12:20:54,306 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 250 states. [2020-07-08 12:20:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,316 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-08 12:20:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-08 12:20:54,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:54,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-08 12:20:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2020-07-08 12:20:54,324 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2020-07-08 12:20:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:54,324 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2020-07-08 12:20:54,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2020-07-08 12:20:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:20:54,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:54,325 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-08 12:20:54,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:20:54,325 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2020-07-08 12:20:54,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:54,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926786891] [2020-07-08 12:20:54,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-08 12:20:54,356 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-08 12:20:54,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3866#true} is VALID [2020-07-08 12:20:54,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-08 12:20:54,357 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-08 12:20:54,357 INFO L263 TraceCheckUtils]: 3: Hoare triple {3866#true} call #t~ret11 := main(); {3866#true} is VALID [2020-07-08 12:20:54,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {3866#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {3866#true} is VALID [2020-07-08 12:20:54,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {3866#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3866#true} is VALID [2020-07-08 12:20:54,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {3866#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3866#true} is VALID [2020-07-08 12:20:54,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {3866#true} assume !(0 != ~p1~0); {3866#true} is VALID [2020-07-08 12:20:54,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {3866#true} assume !(0 != ~p2~0); {3866#true} is VALID [2020-07-08 12:20:54,359 INFO L280 TraceCheckUtils]: 9: Hoare triple {3866#true} assume !(0 != ~p3~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,363 INFO L280 TraceCheckUtils]: 14: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,364 INFO L280 TraceCheckUtils]: 16: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-08 12:20:54,366 INFO L280 TraceCheckUtils]: 19: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3867#false} is VALID [2020-07-08 12:20:54,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {3867#false} assume 1 != ~lk3~0; {3867#false} is VALID [2020-07-08 12:20:54,366 INFO L280 TraceCheckUtils]: 21: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2020-07-08 12:20:54,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-08 12:20:54,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926786891] [2020-07-08 12:20:54,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:54,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:54,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263305115] [2020-07-08 12:20:54,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:54,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:54,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:54,398 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-08 12:20:54,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:54,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:54,399 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2020-07-08 12:20:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,565 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2020-07-08 12:20:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:54,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:20:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-08 12:20:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-08 12:20:54,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-08 12:20:54,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:54,785 INFO L225 Difference]: With dead ends: 432 [2020-07-08 12:20:54,786 INFO L226 Difference]: Without dead ends: 258 [2020-07-08 12:20:54,787 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-08 12:20:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-08 12:20:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-08 12:20:54,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:54,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2020-07-08 12:20:54,834 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2020-07-08 12:20:54,835 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2020-07-08 12:20:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,843 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-08 12:20:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-08 12:20:54,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,844 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2020-07-08 12:20:54,845 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2020-07-08 12:20:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:54,854 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-08 12:20:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-08 12:20:54,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:54,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:54,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:54,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-08 12:20:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2020-07-08 12:20:54,863 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2020-07-08 12:20:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:54,864 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2020-07-08 12:20:54,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2020-07-08 12:20:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:54,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:54,865 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-08 12:20:54,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:20:54,866 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2020-07-08 12:20:54,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:54,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862341262] [2020-07-08 12:20:54,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:54,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-08 12:20:54,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-08 12:20:54,899 INFO L263 TraceCheckUtils]: 0: Hoare triple {5111#true} call ULTIMATE.init(); {5111#true} is VALID [2020-07-08 12:20:54,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-08 12:20:54,899 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-08 12:20:54,900 INFO L263 TraceCheckUtils]: 3: Hoare triple {5111#true} call #t~ret11 := main(); {5111#true} is VALID [2020-07-08 12:20:54,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {5111#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {5111#true} is VALID [2020-07-08 12:20:54,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {5111#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5111#true} is VALID [2020-07-08 12:20:54,901 INFO L280 TraceCheckUtils]: 6: Hoare triple {5111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {5111#true} is VALID [2020-07-08 12:20:54,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {5111#true} assume !(0 != ~p1~0); {5111#true} is VALID [2020-07-08 12:20:54,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {5111#true} assume !(0 != ~p2~0); {5111#true} is VALID [2020-07-08 12:20:54,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {5111#true} assume 0 != ~p3~0;~lk3~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,903 INFO L280 TraceCheckUtils]: 11: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,907 INFO L280 TraceCheckUtils]: 16: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p10~0;~lk10~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,907 INFO L280 TraceCheckUtils]: 17: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,908 INFO L280 TraceCheckUtils]: 18: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:20:54,909 INFO L280 TraceCheckUtils]: 19: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5112#false} is VALID [2020-07-08 12:20:54,909 INFO L280 TraceCheckUtils]: 20: Hoare triple {5112#false} assume 0 != ~p4~0; {5112#false} is VALID [2020-07-08 12:20:54,909 INFO L280 TraceCheckUtils]: 21: Hoare triple {5112#false} assume 1 != ~lk4~0; {5112#false} is VALID [2020-07-08 12:20:54,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2020-07-08 12:20:54,910 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-08 12:20:54,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862341262] [2020-07-08 12:20:54,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:54,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:54,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740968072] [2020-07-08 12:20:54,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:54,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:54,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:54,937 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-08 12:20:54,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:54,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:54,939 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2020-07-08 12:20:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,105 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2020-07-08 12:20:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:55,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 12:20:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 12:20:55,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-08 12:20:55,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:55,302 INFO L225 Difference]: With dead ends: 384 [2020-07-08 12:20:55,302 INFO L226 Difference]: Without dead ends: 262 [2020-07-08 12:20:55,304 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-08 12:20:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-08 12:20:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-07-08 12:20:55,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:55,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2020-07-08 12:20:55,338 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2020-07-08 12:20:55,338 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2020-07-08 12:20:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,347 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-08 12:20:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-08 12:20:55,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,349 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2020-07-08 12:20:55,349 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2020-07-08 12:20:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,359 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-08 12:20:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-08 12:20:55,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:55,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-08 12:20:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2020-07-08 12:20:55,369 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2020-07-08 12:20:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:55,370 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2020-07-08 12:20:55,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2020-07-08 12:20:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:55,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:55,371 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-08 12:20:55,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:20:55,371 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2020-07-08 12:20:55,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:55,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756677729] [2020-07-08 12:20:55,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-08 12:20:55,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-08 12:20:55,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {6320#true} call ULTIMATE.init(); {6320#true} is VALID [2020-07-08 12:20:55,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-08 12:20:55,409 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-08 12:20:55,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {6320#true} call #t~ret11 := main(); {6320#true} is VALID [2020-07-08 12:20:55,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {6320#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {6320#true} is VALID [2020-07-08 12:20:55,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {6320#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {6320#true} is VALID [2020-07-08 12:20:55,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {6320#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {6320#true} is VALID [2020-07-08 12:20:55,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {6320#true} assume !(0 != ~p1~0); {6320#true} is VALID [2020-07-08 12:20:55,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {6320#true} assume !(0 != ~p2~0); {6320#true} is VALID [2020-07-08 12:20:55,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {6320#true} assume !(0 != ~p3~0); {6320#true} is VALID [2020-07-08 12:20:55,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {6320#true} assume 0 != ~p4~0;~lk4~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,417 INFO L280 TraceCheckUtils]: 19: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:20:55,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {6324#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6321#false} is VALID [2020-07-08 12:20:55,418 INFO L280 TraceCheckUtils]: 22: Hoare triple {6321#false} assume !false; {6321#false} is VALID [2020-07-08 12:20:55,419 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-08 12:20:55,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756677729] [2020-07-08 12:20:55,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:55,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:55,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730894142] [2020-07-08 12:20:55,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:55,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:55,446 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-08 12:20:55,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:55,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:55,447 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2020-07-08 12:20:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,627 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2020-07-08 12:20:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:55,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-08 12:20:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-08 12:20:55,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-08 12:20:55,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:55,777 INFO L225 Difference]: With dead ends: 476 [2020-07-08 12:20:55,777 INFO L226 Difference]: Without dead ends: 474 [2020-07-08 12:20:55,778 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-08 12:20:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-07-08 12:20:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2020-07-08 12:20:55,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:55,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand 360 states. [2020-07-08 12:20:55,819 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand 360 states. [2020-07-08 12:20:55,820 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 360 states. [2020-07-08 12:20:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,842 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-08 12:20:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-08 12:20:55,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,845 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 474 states. [2020-07-08 12:20:55,845 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 474 states. [2020-07-08 12:20:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:55,873 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-08 12:20:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-08 12:20:55,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:55,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:55,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:55,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-07-08 12:20:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2020-07-08 12:20:55,889 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2020-07-08 12:20:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:55,889 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2020-07-08 12:20:55,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2020-07-08 12:20:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:20:55,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:55,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:20:55,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:20:55,891 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2020-07-08 12:20:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:55,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730397961] [2020-07-08 12:20:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:55,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-08 12:20:55,943 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-08 12:20:55,943 INFO L263 TraceCheckUtils]: 0: Hoare triple {8149#true} call ULTIMATE.init(); {8149#true} is VALID [2020-07-08 12:20:55,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-08 12:20:55,943 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-08 12:20:55,943 INFO L263 TraceCheckUtils]: 3: Hoare triple {8149#true} call #t~ret11 := main(); {8149#true} is VALID [2020-07-08 12:20:55,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {8149#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {8149#true} is VALID [2020-07-08 12:20:55,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {8149#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {8149#true} is VALID [2020-07-08 12:20:55,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {8149#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {8149#true} is VALID [2020-07-08 12:20:55,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {8149#true} assume !(0 != ~p1~0); {8149#true} is VALID [2020-07-08 12:20:55,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {8149#true} assume !(0 != ~p2~0); {8149#true} is VALID [2020-07-08 12:20:55,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {8149#true} assume !(0 != ~p3~0); {8149#true} is VALID [2020-07-08 12:20:55,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {8149#true} assume !(0 != ~p4~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,946 INFO L280 TraceCheckUtils]: 11: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,947 INFO L280 TraceCheckUtils]: 12: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,951 INFO L280 TraceCheckUtils]: 16: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,959 INFO L280 TraceCheckUtils]: 19: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-08 12:20:55,960 INFO L280 TraceCheckUtils]: 20: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8150#false} is VALID [2020-07-08 12:20:55,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {8150#false} assume 1 != ~lk4~0; {8150#false} is VALID [2020-07-08 12:20:55,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2020-07-08 12:20:55,961 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-08 12:20:55,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730397961] [2020-07-08 12:20:55,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:55,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:55,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679312965] [2020-07-08 12:20:55,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:55,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:55,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:55,993 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-08 12:20:55,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:55,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:55,995 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2020-07-08 12:20:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,206 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2020-07-08 12:20:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:56,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:20:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-08 12:20:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-08 12:20:56,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-08 12:20:56,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:56,399 INFO L225 Difference]: With dead ends: 844 [2020-07-08 12:20:56,399 INFO L226 Difference]: Without dead ends: 498 [2020-07-08 12:20:56,400 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-08 12:20:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-07-08 12:20:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2020-07-08 12:20:56,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:56,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 496 states. [2020-07-08 12:20:56,470 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 496 states. [2020-07-08 12:20:56,470 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 496 states. [2020-07-08 12:20:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,486 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-08 12:20:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-08 12:20:56,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,488 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand 498 states. [2020-07-08 12:20:56,488 INFO L87 Difference]: Start difference. First operand 496 states. Second operand 498 states. [2020-07-08 12:20:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,508 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-08 12:20:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-08 12:20:56,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:56,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:56,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:56,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-07-08 12:20:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2020-07-08 12:20:56,529 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2020-07-08 12:20:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:56,529 INFO L479 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2020-07-08 12:20:56,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2020-07-08 12:20:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:56,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:56,531 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-08 12:20:56,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 12:20:56,532 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2020-07-08 12:20:56,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:56,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743501442] [2020-07-08 12:20:56,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:56,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-08 12:20:56,560 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-08 12:20:56,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {10546#true} call ULTIMATE.init(); {10546#true} is VALID [2020-07-08 12:20:56,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-08 12:20:56,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-08 12:20:56,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {10546#true} call #t~ret11 := main(); {10546#true} is VALID [2020-07-08 12:20:56,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {10546#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {10546#true} is VALID [2020-07-08 12:20:56,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {10546#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {10546#true} is VALID [2020-07-08 12:20:56,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {10546#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {10546#true} is VALID [2020-07-08 12:20:56,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {10546#true} assume !(0 != ~p1~0); {10546#true} is VALID [2020-07-08 12:20:56,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {10546#true} assume !(0 != ~p2~0); {10546#true} is VALID [2020-07-08 12:20:56,562 INFO L280 TraceCheckUtils]: 9: Hoare triple {10546#true} assume !(0 != ~p3~0); {10546#true} is VALID [2020-07-08 12:20:56,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {10546#true} assume 0 != ~p4~0;~lk4~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p10~0;~lk10~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,567 INFO L280 TraceCheckUtils]: 17: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:20:56,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {10547#false} is VALID [2020-07-08 12:20:56,570 INFO L280 TraceCheckUtils]: 21: Hoare triple {10547#false} assume 0 != ~p5~0; {10547#false} is VALID [2020-07-08 12:20:56,570 INFO L280 TraceCheckUtils]: 22: Hoare triple {10547#false} assume 1 != ~lk5~0; {10547#false} is VALID [2020-07-08 12:20:56,571 INFO L280 TraceCheckUtils]: 23: Hoare triple {10547#false} assume !false; {10547#false} is VALID [2020-07-08 12:20:56,571 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-08 12:20:56,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743501442] [2020-07-08 12:20:56,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:56,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:56,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210431663] [2020-07-08 12:20:56,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:56,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:56,603 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-08 12:20:56,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:56,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:56,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:56,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:56,605 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2020-07-08 12:20:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:56,861 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2020-07-08 12:20:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:56,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-08 12:20:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-08 12:20:56,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2020-07-08 12:20:57,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:57,057 INFO L225 Difference]: With dead ends: 744 [2020-07-08 12:20:57,057 INFO L226 Difference]: Without dead ends: 506 [2020-07-08 12:20:57,058 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-08 12:20:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-07-08 12:20:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2020-07-08 12:20:57,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:57,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 504 states. [2020-07-08 12:20:57,133 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 504 states. [2020-07-08 12:20:57,134 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 504 states. [2020-07-08 12:20:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,155 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-08 12:20:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-08 12:20:57,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,157 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 506 states. [2020-07-08 12:20:57,157 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 506 states. [2020-07-08 12:20:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,183 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-08 12:20:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-08 12:20:57,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:57,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-07-08 12:20:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2020-07-08 12:20:57,202 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2020-07-08 12:20:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:57,203 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2020-07-08 12:20:57,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2020-07-08 12:20:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:57,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:57,204 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-08 12:20:57,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 12:20:57,205 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2020-07-08 12:20:57,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:57,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800772615] [2020-07-08 12:20:57,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:57,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-08 12:20:57,234 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-08 12:20:57,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {12867#true} call ULTIMATE.init(); {12867#true} is VALID [2020-07-08 12:20:57,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-08 12:20:57,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-08 12:20:57,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {12867#true} call #t~ret11 := main(); {12867#true} is VALID [2020-07-08 12:20:57,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {12867#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {12867#true} is VALID [2020-07-08 12:20:57,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {12867#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {12867#true} is VALID [2020-07-08 12:20:57,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {12867#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {12867#true} is VALID [2020-07-08 12:20:57,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {12867#true} assume !(0 != ~p1~0); {12867#true} is VALID [2020-07-08 12:20:57,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {12867#true} assume !(0 != ~p2~0); {12867#true} is VALID [2020-07-08 12:20:57,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {12867#true} assume !(0 != ~p3~0); {12867#true} is VALID [2020-07-08 12:20:57,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {12867#true} assume !(0 != ~p4~0); {12867#true} is VALID [2020-07-08 12:20:57,237 INFO L280 TraceCheckUtils]: 11: Hoare triple {12867#true} assume 0 != ~p5~0;~lk5~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,238 INFO L280 TraceCheckUtils]: 12: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,239 INFO L280 TraceCheckUtils]: 14: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,240 INFO L280 TraceCheckUtils]: 16: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,243 INFO L280 TraceCheckUtils]: 20: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,244 INFO L280 TraceCheckUtils]: 21: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:20:57,245 INFO L280 TraceCheckUtils]: 22: Hoare triple {12871#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {12868#false} is VALID [2020-07-08 12:20:57,245 INFO L280 TraceCheckUtils]: 23: Hoare triple {12868#false} assume !false; {12868#false} is VALID [2020-07-08 12:20:57,246 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-08 12:20:57,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800772615] [2020-07-08 12:20:57,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:57,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:57,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789415323] [2020-07-08 12:20:57,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:57,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:57,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:57,271 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-08 12:20:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:57,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:57,272 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2020-07-08 12:20:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,548 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2020-07-08 12:20:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:57,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-08 12:20:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-08 12:20:57,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-08 12:20:57,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:57,728 INFO L225 Difference]: With dead ends: 908 [2020-07-08 12:20:57,728 INFO L226 Difference]: Without dead ends: 906 [2020-07-08 12:20:57,729 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-08 12:20:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-07-08 12:20:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2020-07-08 12:20:57,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:57,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand 712 states. [2020-07-08 12:20:57,815 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand 712 states. [2020-07-08 12:20:57,815 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 712 states. [2020-07-08 12:20:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,874 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-08 12:20:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-08 12:20:57,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,877 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand 906 states. [2020-07-08 12:20:57,877 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 906 states. [2020-07-08 12:20:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:57,931 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-08 12:20:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-08 12:20:57,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:57,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:57,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:57,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-07-08 12:20:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2020-07-08 12:20:57,990 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2020-07-08 12:20:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:57,991 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2020-07-08 12:20:57,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2020-07-08 12:20:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:20:57,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:57,993 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-08 12:20:57,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 12:20:57,993 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2020-07-08 12:20:57,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:57,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173351074] [2020-07-08 12:20:57,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:58,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-08 12:20:58,026 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-08 12:20:58,026 INFO L263 TraceCheckUtils]: 0: Hoare triple {16368#true} call ULTIMATE.init(); {16368#true} is VALID [2020-07-08 12:20:58,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-08 12:20:58,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-08 12:20:58,027 INFO L263 TraceCheckUtils]: 3: Hoare triple {16368#true} call #t~ret11 := main(); {16368#true} is VALID [2020-07-08 12:20:58,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {16368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {16368#true} is VALID [2020-07-08 12:20:58,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {16368#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {16368#true} is VALID [2020-07-08 12:20:58,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {16368#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {16368#true} is VALID [2020-07-08 12:20:58,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {16368#true} assume !(0 != ~p1~0); {16368#true} is VALID [2020-07-08 12:20:58,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {16368#true} assume !(0 != ~p2~0); {16368#true} is VALID [2020-07-08 12:20:58,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {16368#true} assume !(0 != ~p3~0); {16368#true} is VALID [2020-07-08 12:20:58,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {16368#true} assume !(0 != ~p4~0); {16368#true} is VALID [2020-07-08 12:20:58,029 INFO L280 TraceCheckUtils]: 11: Hoare triple {16368#true} assume !(0 != ~p5~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,031 INFO L280 TraceCheckUtils]: 14: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,031 INFO L280 TraceCheckUtils]: 15: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,032 INFO L280 TraceCheckUtils]: 16: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,033 INFO L280 TraceCheckUtils]: 18: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,033 INFO L280 TraceCheckUtils]: 19: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,034 INFO L280 TraceCheckUtils]: 20: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-08 12:20:58,035 INFO L280 TraceCheckUtils]: 21: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p5~0; {16369#false} is VALID [2020-07-08 12:20:58,035 INFO L280 TraceCheckUtils]: 22: Hoare triple {16369#false} assume 1 != ~lk5~0; {16369#false} is VALID [2020-07-08 12:20:58,035 INFO L280 TraceCheckUtils]: 23: Hoare triple {16369#false} assume !false; {16369#false} is VALID [2020-07-08 12:20:58,036 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-08 12:20:58,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173351074] [2020-07-08 12:20:58,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:58,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:58,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560247874] [2020-07-08 12:20:58,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:58,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:58,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:58,063 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-08 12:20:58,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:58,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:58,064 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2020-07-08 12:20:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:58,509 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2020-07-08 12:20:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:58,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:20:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-08 12:20:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-08 12:20:58,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2020-07-08 12:20:58,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:58,763 INFO L225 Difference]: With dead ends: 1660 [2020-07-08 12:20:58,763 INFO L226 Difference]: Without dead ends: 970 [2020-07-08 12:20:58,767 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-08 12:20:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2020-07-08 12:20:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2020-07-08 12:20:58,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:20:58,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 970 states. Second operand 968 states. [2020-07-08 12:20:58,937 INFO L74 IsIncluded]: Start isIncluded. First operand 970 states. Second operand 968 states. [2020-07-08 12:20:58,937 INFO L87 Difference]: Start difference. First operand 970 states. Second operand 968 states. [2020-07-08 12:20:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,006 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-08 12:20:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-08 12:20:59,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:59,010 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 970 states. [2020-07-08 12:20:59,010 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 970 states. [2020-07-08 12:20:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,071 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-08 12:20:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-08 12:20:59,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:20:59,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:20:59,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:20:59,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:20:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-07-08 12:20:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2020-07-08 12:20:59,133 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2020-07-08 12:20:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:20:59,133 INFO L479 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2020-07-08 12:20:59,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:20:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2020-07-08 12:20:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:20:59,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:20:59,135 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-08 12:20:59,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 12:20:59,135 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:20:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:20:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2020-07-08 12:20:59,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:20:59,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245287913] [2020-07-08 12:20:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:20:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:20:59,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-08 12:20:59,168 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-08 12:20:59,169 INFO L263 TraceCheckUtils]: 0: Hoare triple {21037#true} call ULTIMATE.init(); {21037#true} is VALID [2020-07-08 12:20:59,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-08 12:20:59,169 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-08 12:20:59,169 INFO L263 TraceCheckUtils]: 3: Hoare triple {21037#true} call #t~ret11 := main(); {21037#true} is VALID [2020-07-08 12:20:59,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {21037#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {21037#true} is VALID [2020-07-08 12:20:59,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {21037#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {21037#true} is VALID [2020-07-08 12:20:59,170 INFO L280 TraceCheckUtils]: 6: Hoare triple {21037#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {21037#true} is VALID [2020-07-08 12:20:59,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {21037#true} assume !(0 != ~p1~0); {21037#true} is VALID [2020-07-08 12:20:59,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {21037#true} assume !(0 != ~p2~0); {21037#true} is VALID [2020-07-08 12:20:59,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {21037#true} assume !(0 != ~p3~0); {21037#true} is VALID [2020-07-08 12:20:59,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {21037#true} assume !(0 != ~p4~0); {21037#true} is VALID [2020-07-08 12:20:59,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {21037#true} assume 0 != ~p5~0;~lk5~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,176 INFO L280 TraceCheckUtils]: 12: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,178 INFO L280 TraceCheckUtils]: 16: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p10~0;~lk10~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,179 INFO L280 TraceCheckUtils]: 17: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,179 INFO L280 TraceCheckUtils]: 18: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,180 INFO L280 TraceCheckUtils]: 20: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:20:59,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {21038#false} is VALID [2020-07-08 12:20:59,181 INFO L280 TraceCheckUtils]: 22: Hoare triple {21038#false} assume 0 != ~p6~0; {21038#false} is VALID [2020-07-08 12:20:59,182 INFO L280 TraceCheckUtils]: 23: Hoare triple {21038#false} assume 1 != ~lk6~0; {21038#false} is VALID [2020-07-08 12:20:59,182 INFO L280 TraceCheckUtils]: 24: Hoare triple {21038#false} assume !false; {21038#false} is VALID [2020-07-08 12:20:59,183 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-08 12:20:59,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245287913] [2020-07-08 12:20:59,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:20:59,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:20:59,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320101353] [2020-07-08 12:20:59,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:59,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:20:59,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:20:59,210 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-08 12:20:59,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:20:59,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:20:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:20:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:20:59,211 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2020-07-08 12:20:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:20:59,648 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2020-07-08 12:20:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:20:59,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:20:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:20:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-08 12:20:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:20:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-08 12:20:59,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2020-07-08 12:20:59,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:20:59,889 INFO L225 Difference]: With dead ends: 1452 [2020-07-08 12:20:59,889 INFO L226 Difference]: Without dead ends: 986 [2020-07-08 12:20:59,893 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-08 12:20:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-08 12:21:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2020-07-08 12:21:00,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:00,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand 984 states. [2020-07-08 12:21:00,095 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand 984 states. [2020-07-08 12:21:00,095 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 984 states. [2020-07-08 12:21:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:00,145 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-08 12:21:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-08 12:21:00,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:00,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:00,148 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand 986 states. [2020-07-08 12:21:00,148 INFO L87 Difference]: Start difference. First operand 984 states. Second operand 986 states. [2020-07-08 12:21:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:00,198 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-08 12:21:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-08 12:21:00,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:00,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:00,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:00,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-08 12:21:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2020-07-08 12:21:00,258 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2020-07-08 12:21:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:00,258 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2020-07-08 12:21:00,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2020-07-08 12:21:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:21:00,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:00,260 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-08 12:21:00,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 12:21:00,260 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2020-07-08 12:21:00,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:00,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158442730] [2020-07-08 12:21:00,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:00,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-08 12:21:00,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-08 12:21:00,303 INFO L263 TraceCheckUtils]: 0: Hoare triple {25546#true} call ULTIMATE.init(); {25546#true} is VALID [2020-07-08 12:21:00,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-08 12:21:00,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-08 12:21:00,303 INFO L263 TraceCheckUtils]: 3: Hoare triple {25546#true} call #t~ret11 := main(); {25546#true} is VALID [2020-07-08 12:21:00,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {25546#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {25546#true} is VALID [2020-07-08 12:21:00,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {25546#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {25546#true} is VALID [2020-07-08 12:21:00,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {25546#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {25546#true} is VALID [2020-07-08 12:21:00,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {25546#true} assume !(0 != ~p1~0); {25546#true} is VALID [2020-07-08 12:21:00,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {25546#true} assume !(0 != ~p2~0); {25546#true} is VALID [2020-07-08 12:21:00,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {25546#true} assume !(0 != ~p3~0); {25546#true} is VALID [2020-07-08 12:21:00,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {25546#true} assume !(0 != ~p4~0); {25546#true} is VALID [2020-07-08 12:21:00,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {25546#true} assume !(0 != ~p5~0); {25546#true} is VALID [2020-07-08 12:21:00,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {25546#true} assume 0 != ~p6~0;~lk6~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,308 INFO L280 TraceCheckUtils]: 13: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,308 INFO L280 TraceCheckUtils]: 14: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,309 INFO L280 TraceCheckUtils]: 15: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,310 INFO L280 TraceCheckUtils]: 16: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,312 INFO L280 TraceCheckUtils]: 17: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,313 INFO L280 TraceCheckUtils]: 18: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,313 INFO L280 TraceCheckUtils]: 19: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,314 INFO L280 TraceCheckUtils]: 20: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,314 INFO L280 TraceCheckUtils]: 21: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,315 INFO L280 TraceCheckUtils]: 22: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:00,315 INFO L280 TraceCheckUtils]: 23: Hoare triple {25550#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {25547#false} is VALID [2020-07-08 12:21:00,316 INFO L280 TraceCheckUtils]: 24: Hoare triple {25547#false} assume !false; {25547#false} is VALID [2020-07-08 12:21:00,316 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-08 12:21:00,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158442730] [2020-07-08 12:21:00,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:00,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:00,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649614540] [2020-07-08 12:21:00,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:00,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:00,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:00,346 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-08 12:21:00,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:00,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:00,347 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2020-07-08 12:21:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:01,027 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2020-07-08 12:21:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:01,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 12:21:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-08 12:21:01,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-08 12:21:01,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:01,445 INFO L225 Difference]: With dead ends: 1740 [2020-07-08 12:21:01,445 INFO L226 Difference]: Without dead ends: 1738 [2020-07-08 12:21:01,446 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-08 12:21:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-08 12:21:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2020-07-08 12:21:01,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:01,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1416 states. [2020-07-08 12:21:01,659 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1416 states. [2020-07-08 12:21:01,659 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1416 states. [2020-07-08 12:21:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:01,795 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-08 12:21:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-08 12:21:01,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:01,799 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand 1738 states. [2020-07-08 12:21:01,799 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand 1738 states. [2020-07-08 12:21:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:01,928 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-08 12:21:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-08 12:21:01,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:01,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:01,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:01,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-07-08 12:21:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2020-07-08 12:21:01,996 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2020-07-08 12:21:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:01,996 INFO L479 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2020-07-08 12:21:01,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2020-07-08 12:21:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:21:01,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:01,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:02,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 12:21:02,000 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2020-07-08 12:21:02,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:02,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687598891] [2020-07-08 12:21:02,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:02,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-08 12:21:02,032 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-08 12:21:02,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {32295#true} call ULTIMATE.init(); {32295#true} is VALID [2020-07-08 12:21:02,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-08 12:21:02,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-08 12:21:02,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {32295#true} call #t~ret11 := main(); {32295#true} is VALID [2020-07-08 12:21:02,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {32295#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {32295#true} is VALID [2020-07-08 12:21:02,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {32295#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {32295#true} is VALID [2020-07-08 12:21:02,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {32295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {32295#true} is VALID [2020-07-08 12:21:02,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {32295#true} assume !(0 != ~p1~0); {32295#true} is VALID [2020-07-08 12:21:02,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {32295#true} assume !(0 != ~p2~0); {32295#true} is VALID [2020-07-08 12:21:02,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {32295#true} assume !(0 != ~p3~0); {32295#true} is VALID [2020-07-08 12:21:02,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {32295#true} assume !(0 != ~p4~0); {32295#true} is VALID [2020-07-08 12:21:02,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {32295#true} assume !(0 != ~p5~0); {32295#true} is VALID [2020-07-08 12:21:02,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {32295#true} assume !(0 != ~p6~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,036 INFO L280 TraceCheckUtils]: 14: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,037 INFO L280 TraceCheckUtils]: 15: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,038 INFO L280 TraceCheckUtils]: 16: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,039 INFO L280 TraceCheckUtils]: 18: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,039 INFO L280 TraceCheckUtils]: 19: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,040 INFO L280 TraceCheckUtils]: 21: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:02,041 INFO L280 TraceCheckUtils]: 22: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p6~0; {32296#false} is VALID [2020-07-08 12:21:02,041 INFO L280 TraceCheckUtils]: 23: Hoare triple {32296#false} assume 1 != ~lk6~0; {32296#false} is VALID [2020-07-08 12:21:02,041 INFO L280 TraceCheckUtils]: 24: Hoare triple {32296#false} assume !false; {32296#false} is VALID [2020-07-08 12:21:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:02,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687598891] [2020-07-08 12:21:02,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:02,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:02,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219801997] [2020-07-08 12:21:02,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:02,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:02,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:02,068 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-08 12:21:02,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:02,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:02,069 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2020-07-08 12:21:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:02,890 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2020-07-08 12:21:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:02,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-08 12:21:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-08 12:21:02,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-08 12:21:03,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:03,237 INFO L225 Difference]: With dead ends: 3276 [2020-07-08 12:21:03,238 INFO L226 Difference]: Without dead ends: 1898 [2020-07-08 12:21:03,241 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-08 12:21:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-07-08 12:21:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2020-07-08 12:21:03,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:03,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand 1896 states. [2020-07-08 12:21:03,580 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand 1896 states. [2020-07-08 12:21:03,580 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 1896 states. [2020-07-08 12:21:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:03,726 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-08 12:21:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-08 12:21:03,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:03,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:03,728 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand 1898 states. [2020-07-08 12:21:03,728 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand 1898 states. [2020-07-08 12:21:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:03,862 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-08 12:21:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-08 12:21:03,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:03,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:03,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:03,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-07-08 12:21:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2020-07-08 12:21:03,997 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2020-07-08 12:21:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:03,997 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2020-07-08 12:21:03,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2020-07-08 12:21:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:03,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:03,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:03,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 12:21:04,000 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:04,000 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2020-07-08 12:21:04,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:04,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129971342] [2020-07-08 12:21:04,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:04,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-08 12:21:04,027 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-08 12:21:04,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {41444#true} call ULTIMATE.init(); {41444#true} is VALID [2020-07-08 12:21:04,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-08 12:21:04,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-08 12:21:04,028 INFO L263 TraceCheckUtils]: 3: Hoare triple {41444#true} call #t~ret11 := main(); {41444#true} is VALID [2020-07-08 12:21:04,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {41444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 5: Hoare triple {41444#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 6: Hoare triple {41444#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 7: Hoare triple {41444#true} assume !(0 != ~p1~0); {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 8: Hoare triple {41444#true} assume !(0 != ~p2~0); {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {41444#true} assume !(0 != ~p3~0); {41444#true} is VALID [2020-07-08 12:21:04,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {41444#true} assume !(0 != ~p4~0); {41444#true} is VALID [2020-07-08 12:21:04,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {41444#true} assume !(0 != ~p5~0); {41444#true} is VALID [2020-07-08 12:21:04,031 INFO L280 TraceCheckUtils]: 12: Hoare triple {41444#true} assume 0 != ~p6~0;~lk6~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,031 INFO L280 TraceCheckUtils]: 13: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,032 INFO L280 TraceCheckUtils]: 15: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p10~0;~lk10~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,033 INFO L280 TraceCheckUtils]: 17: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,034 INFO L280 TraceCheckUtils]: 18: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,034 INFO L280 TraceCheckUtils]: 19: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,035 INFO L280 TraceCheckUtils]: 20: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,035 INFO L280 TraceCheckUtils]: 21: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:04,036 INFO L280 TraceCheckUtils]: 22: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {41445#false} is VALID [2020-07-08 12:21:04,036 INFO L280 TraceCheckUtils]: 23: Hoare triple {41445#false} assume 0 != ~p7~0; {41445#false} is VALID [2020-07-08 12:21:04,036 INFO L280 TraceCheckUtils]: 24: Hoare triple {41445#false} assume 1 != ~lk7~0; {41445#false} is VALID [2020-07-08 12:21:04,036 INFO L280 TraceCheckUtils]: 25: Hoare triple {41445#false} assume !false; {41445#false} is VALID [2020-07-08 12:21:04,037 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-08 12:21:04,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129971342] [2020-07-08 12:21:04,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:04,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:04,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435939809] [2020-07-08 12:21:04,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:04,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:04,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:04,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:04,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:04,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:04,069 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2020-07-08 12:21:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:04,778 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2020-07-08 12:21:04,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:04,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 12:21:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 12:21:04,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-08 12:21:04,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:05,116 INFO L225 Difference]: With dead ends: 2844 [2020-07-08 12:21:05,116 INFO L226 Difference]: Without dead ends: 1930 [2020-07-08 12:21:05,118 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-08 12:21:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-08 12:21:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2020-07-08 12:21:05,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:05,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1928 states. [2020-07-08 12:21:05,482 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1928 states. [2020-07-08 12:21:05,482 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1928 states. [2020-07-08 12:21:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:05,613 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-08 12:21:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-08 12:21:05,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:05,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:05,615 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 1930 states. [2020-07-08 12:21:05,615 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 1930 states. [2020-07-08 12:21:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:05,755 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-08 12:21:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-08 12:21:05,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:05,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:05,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:05,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-07-08 12:21:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2020-07-08 12:21:05,889 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2020-07-08 12:21:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:05,889 INFO L479 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2020-07-08 12:21:05,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2020-07-08 12:21:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:05,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:05,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:05,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 12:21:05,891 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2020-07-08 12:21:05,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:05,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43121973] [2020-07-08 12:21:05,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:05,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-08 12:21:05,931 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-08 12:21:05,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {50257#true} call ULTIMATE.init(); {50257#true} is VALID [2020-07-08 12:21:05,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-08 12:21:05,932 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-08 12:21:05,932 INFO L263 TraceCheckUtils]: 3: Hoare triple {50257#true} call #t~ret11 := main(); {50257#true} is VALID [2020-07-08 12:21:05,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {50257#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {50257#true} is VALID [2020-07-08 12:21:05,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {50257#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {50257#true} is VALID [2020-07-08 12:21:05,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {50257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {50257#true} is VALID [2020-07-08 12:21:05,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {50257#true} assume !(0 != ~p1~0); {50257#true} is VALID [2020-07-08 12:21:05,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {50257#true} assume !(0 != ~p2~0); {50257#true} is VALID [2020-07-08 12:21:05,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {50257#true} assume !(0 != ~p3~0); {50257#true} is VALID [2020-07-08 12:21:05,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {50257#true} assume !(0 != ~p4~0); {50257#true} is VALID [2020-07-08 12:21:05,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {50257#true} assume !(0 != ~p5~0); {50257#true} is VALID [2020-07-08 12:21:05,934 INFO L280 TraceCheckUtils]: 12: Hoare triple {50257#true} assume !(0 != ~p6~0); {50257#true} is VALID [2020-07-08 12:21:05,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {50257#true} assume 0 != ~p7~0;~lk7~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,938 INFO L280 TraceCheckUtils]: 19: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,939 INFO L280 TraceCheckUtils]: 20: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,939 INFO L280 TraceCheckUtils]: 21: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,940 INFO L280 TraceCheckUtils]: 22: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p7~0; {50261#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:05,941 INFO L280 TraceCheckUtils]: 24: Hoare triple {50261#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {50258#false} is VALID [2020-07-08 12:21:05,941 INFO L280 TraceCheckUtils]: 25: Hoare triple {50258#false} assume !false; {50258#false} is VALID [2020-07-08 12:21:05,942 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-08 12:21:05,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43121973] [2020-07-08 12:21:05,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:05,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:05,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158198594] [2020-07-08 12:21:05,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:05,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:05,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:05,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:05,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:05,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:05,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:05,981 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2020-07-08 12:21:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:07,277 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2020-07-08 12:21:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:07,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 12:21:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 12:21:07,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-08 12:21:07,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:07,783 INFO L225 Difference]: With dead ends: 3340 [2020-07-08 12:21:07,783 INFO L226 Difference]: Without dead ends: 3338 [2020-07-08 12:21:07,784 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-08 12:21:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-08 12:21:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2020-07-08 12:21:08,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:08,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 2824 states. [2020-07-08 12:21:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 2824 states. [2020-07-08 12:21:08,156 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 2824 states. [2020-07-08 12:21:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:08,514 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-08 12:21:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-08 12:21:08,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:08,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:08,518 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand 3338 states. [2020-07-08 12:21:08,518 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand 3338 states. [2020-07-08 12:21:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:08,850 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-08 12:21:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-08 12:21:08,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:08,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:08,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:08,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2020-07-08 12:21:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2020-07-08 12:21:09,090 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2020-07-08 12:21:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:09,091 INFO L479 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2020-07-08 12:21:09,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2020-07-08 12:21:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:21:09,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:09,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:09,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 12:21:09,093 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2020-07-08 12:21:09,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:09,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291356546] [2020-07-08 12:21:09,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:09,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-08 12:21:09,125 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-08 12:21:09,125 INFO L263 TraceCheckUtils]: 0: Hoare triple {63310#true} call ULTIMATE.init(); {63310#true} is VALID [2020-07-08 12:21:09,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-08 12:21:09,126 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-08 12:21:09,126 INFO L263 TraceCheckUtils]: 3: Hoare triple {63310#true} call #t~ret11 := main(); {63310#true} is VALID [2020-07-08 12:21:09,126 INFO L280 TraceCheckUtils]: 4: Hoare triple {63310#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {63310#true} is VALID [2020-07-08 12:21:09,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {63310#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {63310#true} is VALID [2020-07-08 12:21:09,127 INFO L280 TraceCheckUtils]: 6: Hoare triple {63310#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {63310#true} is VALID [2020-07-08 12:21:09,127 INFO L280 TraceCheckUtils]: 7: Hoare triple {63310#true} assume !(0 != ~p1~0); {63310#true} is VALID [2020-07-08 12:21:09,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {63310#true} assume !(0 != ~p2~0); {63310#true} is VALID [2020-07-08 12:21:09,127 INFO L280 TraceCheckUtils]: 9: Hoare triple {63310#true} assume !(0 != ~p3~0); {63310#true} is VALID [2020-07-08 12:21:09,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {63310#true} assume !(0 != ~p4~0); {63310#true} is VALID [2020-07-08 12:21:09,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {63310#true} assume !(0 != ~p5~0); {63310#true} is VALID [2020-07-08 12:21:09,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {63310#true} assume !(0 != ~p6~0); {63310#true} is VALID [2020-07-08 12:21:09,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {63310#true} assume !(0 != ~p7~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,130 INFO L280 TraceCheckUtils]: 16: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p10~0;~lk10~0 := 1; {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,131 INFO L280 TraceCheckUtils]: 17: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,131 INFO L280 TraceCheckUtils]: 18: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,132 INFO L280 TraceCheckUtils]: 19: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,132 INFO L280 TraceCheckUtils]: 20: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,133 INFO L280 TraceCheckUtils]: 21: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,133 INFO L280 TraceCheckUtils]: 22: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:09,134 INFO L280 TraceCheckUtils]: 23: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p7~0; {63311#false} is VALID [2020-07-08 12:21:09,134 INFO L280 TraceCheckUtils]: 24: Hoare triple {63311#false} assume 1 != ~lk7~0; {63311#false} is VALID [2020-07-08 12:21:09,134 INFO L280 TraceCheckUtils]: 25: Hoare triple {63311#false} assume !false; {63311#false} is VALID [2020-07-08 12:21:09,135 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-08 12:21:09,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291356546] [2020-07-08 12:21:09,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:09,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:09,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617642016] [2020-07-08 12:21:09,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:09,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:09,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:09,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:09,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:09,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:09,163 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2020-07-08 12:21:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:11,392 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2020-07-08 12:21:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:11,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:21:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-08 12:21:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-08 12:21:11,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2020-07-08 12:21:11,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:12,084 INFO L225 Difference]: With dead ends: 6476 [2020-07-08 12:21:12,084 INFO L226 Difference]: Without dead ends: 3722 [2020-07-08 12:21:12,089 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-08 12:21:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-08 12:21:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2020-07-08 12:21:12,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:12,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3720 states. [2020-07-08 12:21:12,901 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3720 states. [2020-07-08 12:21:12,901 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3720 states. [2020-07-08 12:21:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:13,325 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-08 12:21:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-08 12:21:13,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:13,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:13,330 INFO L74 IsIncluded]: Start isIncluded. First operand 3720 states. Second operand 3722 states. [2020-07-08 12:21:13,330 INFO L87 Difference]: Start difference. First operand 3720 states. Second operand 3722 states. [2020-07-08 12:21:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:13,757 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-08 12:21:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-08 12:21:13,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:13,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:13,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:13,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2020-07-08 12:21:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2020-07-08 12:21:14,229 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2020-07-08 12:21:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:14,229 INFO L479 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2020-07-08 12:21:14,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2020-07-08 12:21:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:14,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:14,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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:14,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-08 12:21:14,233 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2020-07-08 12:21:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:14,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577905881] [2020-07-08 12:21:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:14,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-08 12:21:14,271 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-08 12:21:14,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {81291#true} call ULTIMATE.init(); {81291#true} is VALID [2020-07-08 12:21:14,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-08 12:21:14,271 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-08 12:21:14,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {81291#true} call #t~ret11 := main(); {81291#true} is VALID [2020-07-08 12:21:14,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {81291#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {81291#true} is VALID [2020-07-08 12:21:14,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {81291#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {81291#true} is VALID [2020-07-08 12:21:14,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {81291#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {81291#true} is VALID [2020-07-08 12:21:14,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {81291#true} assume !(0 != ~p1~0); {81291#true} is VALID [2020-07-08 12:21:14,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {81291#true} assume !(0 != ~p2~0); {81291#true} is VALID [2020-07-08 12:21:14,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {81291#true} assume !(0 != ~p3~0); {81291#true} is VALID [2020-07-08 12:21:14,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {81291#true} assume !(0 != ~p4~0); {81291#true} is VALID [2020-07-08 12:21:14,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {81291#true} assume !(0 != ~p5~0); {81291#true} is VALID [2020-07-08 12:21:14,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {81291#true} assume !(0 != ~p6~0); {81291#true} is VALID [2020-07-08 12:21:14,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {81291#true} assume 0 != ~p7~0;~lk7~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {81295#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,281 INFO L280 TraceCheckUtils]: 16: Hoare triple {81295#(not (= 0 main_~p7~0))} assume 0 != ~p10~0;~lk10~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,282 INFO L280 TraceCheckUtils]: 17: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,282 INFO L280 TraceCheckUtils]: 18: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,283 INFO L280 TraceCheckUtils]: 19: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,283 INFO L280 TraceCheckUtils]: 20: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,284 INFO L280 TraceCheckUtils]: 22: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:14,285 INFO L280 TraceCheckUtils]: 23: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {81292#false} is VALID [2020-07-08 12:21:14,285 INFO L280 TraceCheckUtils]: 24: Hoare triple {81292#false} assume 0 != ~p8~0; {81292#false} is VALID [2020-07-08 12:21:14,285 INFO L280 TraceCheckUtils]: 25: Hoare triple {81292#false} assume 1 != ~lk8~0; {81292#false} is VALID [2020-07-08 12:21:14,286 INFO L280 TraceCheckUtils]: 26: Hoare triple {81292#false} assume !false; {81292#false} is VALID [2020-07-08 12:21:14,286 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-08 12:21:14,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577905881] [2020-07-08 12:21:14,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:14,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:14,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759892269] [2020-07-08 12:21:14,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:14,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:14,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:14,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:14,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:14,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:14,314 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2020-07-08 12:21:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:16,117 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2020-07-08 12:21:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:16,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 12:21:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 12:21:16,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-08 12:21:16,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:16,819 INFO L225 Difference]: With dead ends: 5580 [2020-07-08 12:21:16,820 INFO L226 Difference]: Without dead ends: 3786 [2020-07-08 12:21:16,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2020-07-08 12:21:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2020-07-08 12:21:17,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:17,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3786 states. Second operand 3784 states. [2020-07-08 12:21:17,688 INFO L74 IsIncluded]: Start isIncluded. First operand 3786 states. Second operand 3784 states. [2020-07-08 12:21:17,689 INFO L87 Difference]: Start difference. First operand 3786 states. Second operand 3784 states. [2020-07-08 12:21:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:18,148 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-08 12:21:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-08 12:21:18,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:18,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:18,153 INFO L74 IsIncluded]: Start isIncluded. First operand 3784 states. Second operand 3786 states. [2020-07-08 12:21:18,153 INFO L87 Difference]: Start difference. First operand 3784 states. Second operand 3786 states. [2020-07-08 12:21:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:18,590 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-08 12:21:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-08 12:21:18,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:18,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:18,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:18,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2020-07-08 12:21:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2020-07-08 12:21:19,064 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2020-07-08 12:21:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:19,064 INFO L479 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2020-07-08 12:21:19,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2020-07-08 12:21:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:19,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:19,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:19,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-08 12:21:19,067 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2020-07-08 12:21:19,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:19,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595769025] [2020-07-08 12:21:19,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:19,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-08 12:21:19,102 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-08 12:21:19,102 INFO L263 TraceCheckUtils]: 0: Hoare triple {98568#true} call ULTIMATE.init(); {98568#true} is VALID [2020-07-08 12:21:19,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-08 12:21:19,102 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-08 12:21:19,102 INFO L263 TraceCheckUtils]: 3: Hoare triple {98568#true} call #t~ret11 := main(); {98568#true} is VALID [2020-07-08 12:21:19,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {98568#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {98568#true} is VALID [2020-07-08 12:21:19,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {98568#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {98568#true} is VALID [2020-07-08 12:21:19,103 INFO L280 TraceCheckUtils]: 6: Hoare triple {98568#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {98568#true} is VALID [2020-07-08 12:21:19,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {98568#true} assume !(0 != ~p1~0); {98568#true} is VALID [2020-07-08 12:21:19,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {98568#true} assume !(0 != ~p2~0); {98568#true} is VALID [2020-07-08 12:21:19,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {98568#true} assume !(0 != ~p3~0); {98568#true} is VALID [2020-07-08 12:21:19,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {98568#true} assume !(0 != ~p4~0); {98568#true} is VALID [2020-07-08 12:21:19,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {98568#true} assume !(0 != ~p5~0); {98568#true} is VALID [2020-07-08 12:21:19,104 INFO L280 TraceCheckUtils]: 12: Hoare triple {98568#true} assume !(0 != ~p6~0); {98568#true} is VALID [2020-07-08 12:21:19,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {98568#true} assume !(0 != ~p7~0); {98568#true} is VALID [2020-07-08 12:21:19,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {98568#true} assume !(0 != ~p8~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,105 INFO L280 TraceCheckUtils]: 15: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,106 INFO L280 TraceCheckUtils]: 17: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,107 INFO L280 TraceCheckUtils]: 18: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,107 INFO L280 TraceCheckUtils]: 19: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,108 INFO L280 TraceCheckUtils]: 20: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:19,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p8~0; {98569#false} is VALID [2020-07-08 12:21:19,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {98569#false} assume 1 != ~lk8~0; {98569#false} is VALID [2020-07-08 12:21:19,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {98569#false} assume !false; {98569#false} is VALID [2020-07-08 12:21:19,111 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-08 12:21:19,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595769025] [2020-07-08 12:21:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589890655] [2020-07-08 12:21:19,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:19,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:19,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:19,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:19,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:19,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:19,144 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2020-07-08 12:21:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,471 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2020-07-08 12:21:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:24,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 12:21:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 12:21:24,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-08 12:21:24,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:26,701 INFO L225 Difference]: With dead ends: 10956 [2020-07-08 12:21:26,701 INFO L226 Difference]: Without dead ends: 7306 [2020-07-08 12:21:26,706 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-08 12:21:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2020-07-08 12:21:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2020-07-08 12:21:28,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:28,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7306 states. Second operand 7304 states. [2020-07-08 12:21:28,364 INFO L74 IsIncluded]: Start isIncluded. First operand 7306 states. Second operand 7304 states. [2020-07-08 12:21:28,365 INFO L87 Difference]: Start difference. First operand 7306 states. Second operand 7304 states. [2020-07-08 12:21:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,171 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-08 12:21:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-08 12:21:30,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:30,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:30,180 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 7306 states. [2020-07-08 12:21:30,180 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 7306 states. [2020-07-08 12:21:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:31,990 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-08 12:21:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-08 12:21:32,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:32,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:32,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:32,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-08 12:21:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2020-07-08 12:21:33,874 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2020-07-08 12:21:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:33,874 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2020-07-08 12:21:33,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2020-07-08 12:21:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:21:33,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:33,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:33,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-08 12:21:33,879 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:33,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2020-07-08 12:21:33,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:33,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878011360] [2020-07-08 12:21:33,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:33,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-08 12:21:33,911 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-08 12:21:33,911 INFO L263 TraceCheckUtils]: 0: Hoare triple {132101#true} call ULTIMATE.init(); {132101#true} is VALID [2020-07-08 12:21:33,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-08 12:21:33,911 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-08 12:21:33,912 INFO L263 TraceCheckUtils]: 3: Hoare triple {132101#true} call #t~ret11 := main(); {132101#true} is VALID [2020-07-08 12:21:33,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {132101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {132101#true} is VALID [2020-07-08 12:21:33,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {132101#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {132101#true} is VALID [2020-07-08 12:21:33,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {132101#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {132101#true} is VALID [2020-07-08 12:21:33,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {132101#true} assume !(0 != ~p1~0); {132101#true} is VALID [2020-07-08 12:21:33,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {132101#true} assume !(0 != ~p2~0); {132101#true} is VALID [2020-07-08 12:21:33,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {132101#true} assume !(0 != ~p3~0); {132101#true} is VALID [2020-07-08 12:21:33,915 INFO L280 TraceCheckUtils]: 10: Hoare triple {132101#true} assume !(0 != ~p4~0); {132101#true} is VALID [2020-07-08 12:21:33,915 INFO L280 TraceCheckUtils]: 11: Hoare triple {132101#true} assume !(0 != ~p5~0); {132101#true} is VALID [2020-07-08 12:21:33,915 INFO L280 TraceCheckUtils]: 12: Hoare triple {132101#true} assume !(0 != ~p6~0); {132101#true} is VALID [2020-07-08 12:21:33,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {132101#true} assume !(0 != ~p7~0); {132101#true} is VALID [2020-07-08 12:21:33,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {132101#true} assume 0 != ~p8~0;~lk8~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,918 INFO L280 TraceCheckUtils]: 16: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,919 INFO L280 TraceCheckUtils]: 20: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,920 INFO L280 TraceCheckUtils]: 22: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,921 INFO L280 TraceCheckUtils]: 23: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,921 INFO L280 TraceCheckUtils]: 24: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:33,922 INFO L280 TraceCheckUtils]: 25: Hoare triple {132105#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {132102#false} is VALID [2020-07-08 12:21:33,922 INFO L280 TraceCheckUtils]: 26: Hoare triple {132102#false} assume !false; {132102#false} is VALID [2020-07-08 12:21:33,923 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-08 12:21:33,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878011360] [2020-07-08 12:21:33,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:33,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:33,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933727129] [2020-07-08 12:21:33,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:33,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:33,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:33,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:33,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:33,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:33,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:33,956 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2020-07-08 12:21:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:38,531 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2020-07-08 12:21:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:38,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:21:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-08 12:21:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-08 12:21:38,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2020-07-08 12:21:38,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:41,015 INFO L225 Difference]: With dead ends: 8076 [2020-07-08 12:21:41,016 INFO L226 Difference]: Without dead ends: 8074 [2020-07-08 12:21:41,017 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-08 12:21:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-08 12:21:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2020-07-08 12:21:42,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:42,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 7304 states. [2020-07-08 12:21:42,831 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 7304 states. [2020-07-08 12:21:42,831 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 7304 states. [2020-07-08 12:21:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:44,688 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-08 12:21:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-08 12:21:44,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:44,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:44,693 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 8074 states. [2020-07-08 12:21:44,693 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 8074 states. [2020-07-08 12:21:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:46,742 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-08 12:21:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-08 12:21:46,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:46,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:46,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:46,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-08 12:21:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2020-07-08 12:21:48,603 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2020-07-08 12:21:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:48,604 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2020-07-08 12:21:48,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2020-07-08 12:21:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:21:48,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:48,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:48,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-08 12:21:48,608 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2020-07-08 12:21:48,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:48,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272010853] [2020-07-08 12:21:48,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:48,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-08 12:21:48,649 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L263 TraceCheckUtils]: 0: Hoare triple {164290#true} call ULTIMATE.init(); {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L263 TraceCheckUtils]: 3: Hoare triple {164290#true} call #t~ret11 := main(); {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {164290#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {164290#true} is VALID [2020-07-08 12:21:48,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {164290#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {164290#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {164290#true} assume !(0 != ~p1~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {164290#true} assume !(0 != ~p2~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {164290#true} assume !(0 != ~p3~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {164290#true} assume !(0 != ~p4~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 11: Hoare triple {164290#true} assume !(0 != ~p5~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 12: Hoare triple {164290#true} assume !(0 != ~p6~0); {164290#true} is VALID [2020-07-08 12:21:48,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {164290#true} assume !(0 != ~p7~0); {164290#true} is VALID [2020-07-08 12:21:48,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {164290#true} assume !(0 != ~p8~0); {164290#true} is VALID [2020-07-08 12:21:48,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {164290#true} assume 0 != ~p9~0;~lk9~0 := 1; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,653 INFO L280 TraceCheckUtils]: 16: Hoare triple {164294#(= 1 main_~lk9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,653 INFO L280 TraceCheckUtils]: 18: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,654 INFO L280 TraceCheckUtils]: 19: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,654 INFO L280 TraceCheckUtils]: 20: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,656 INFO L280 TraceCheckUtils]: 24: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,663 INFO L280 TraceCheckUtils]: 25: Hoare triple {164294#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-08 12:21:48,663 INFO L280 TraceCheckUtils]: 26: Hoare triple {164294#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {164291#false} is VALID [2020-07-08 12:21:48,664 INFO L280 TraceCheckUtils]: 27: Hoare triple {164291#false} assume !false; {164291#false} is VALID [2020-07-08 12:21:48,664 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-08 12:21:48,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272010853] [2020-07-08 12:21:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085110368] [2020-07-08 12:21:48,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:48,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:48,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:48,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:48,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:48,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:48,695 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2020-07-08 12:21:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:56,493 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2020-07-08 12:21:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:56,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:21:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-08 12:21:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-08 12:21:56,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-08 12:21:56,596 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-08 12:22:01,753 INFO L225 Difference]: With dead ends: 12172 [2020-07-08 12:22:01,754 INFO L226 Difference]: Without dead ends: 12170 [2020-07-08 12:22:01,755 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-08 12:22:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2020-07-08 12:22:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2020-07-08 12:22:03,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:03,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 11144 states. [2020-07-08 12:22:03,676 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 11144 states. [2020-07-08 12:22:03,676 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 11144 states. [2020-07-08 12:22:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:08,278 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-08 12:22:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-08 12:22:08,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:08,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:08,288 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 12170 states. [2020-07-08 12:22:08,288 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 12170 states. [2020-07-08 12:22:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:12,984 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-08 12:22:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-08 12:22:12,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:12,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:12,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:12,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2020-07-08 12:22:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2020-07-08 12:22:17,528 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2020-07-08 12:22:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:17,528 INFO L479 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2020-07-08 12:22:17,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:22:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2020-07-08 12:22:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:22:17,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:17,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:22:17,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-08 12:22:17,535 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2020-07-08 12:22:17,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:17,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454822256] [2020-07-08 12:22:17,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:17,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L263 TraceCheckUtils]: 0: Hoare triple {212735#true} call ULTIMATE.init(); {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {212735#true} call #t~ret11 := main(); {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {212735#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {212735#true} is VALID [2020-07-08 12:22:17,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {212735#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {212735#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {212735#true} assume !(0 != ~p1~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {212735#true} assume !(0 != ~p2~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {212735#true} assume !(0 != ~p3~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {212735#true} assume !(0 != ~p4~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {212735#true} assume !(0 != ~p5~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 12: Hoare triple {212735#true} assume !(0 != ~p6~0); {212735#true} is VALID [2020-07-08 12:22:17,594 INFO L280 TraceCheckUtils]: 13: Hoare triple {212735#true} assume !(0 != ~p7~0); {212735#true} is VALID [2020-07-08 12:22:17,595 INFO L280 TraceCheckUtils]: 14: Hoare triple {212735#true} assume !(0 != ~p8~0); {212735#true} is VALID [2020-07-08 12:22:17,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {212735#true} assume !(0 != ~p9~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {212739#(= 0 main_~p9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,596 INFO L280 TraceCheckUtils]: 17: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,597 INFO L280 TraceCheckUtils]: 19: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,597 INFO L280 TraceCheckUtils]: 21: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,598 INFO L280 TraceCheckUtils]: 22: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,598 INFO L280 TraceCheckUtils]: 23: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,599 INFO L280 TraceCheckUtils]: 24: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-08 12:22:17,599 INFO L280 TraceCheckUtils]: 25: Hoare triple {212739#(= 0 main_~p9~0)} assume 0 != ~p9~0; {212736#false} is VALID [2020-07-08 12:22:17,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {212736#false} assume 1 != ~lk9~0; {212736#false} is VALID [2020-07-08 12:22:17,599 INFO L280 TraceCheckUtils]: 27: Hoare triple {212736#false} assume !false; {212736#false} is VALID [2020-07-08 12:22:17,600 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-08 12:22:17,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454822256] [2020-07-08 12:22:17,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:17,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:22:17,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795263418] [2020-07-08 12:22:17,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:22:17,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:17,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:22:17,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:17,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:22:17,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:17,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:22:17,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:22:17,630 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2020-07-08 12:23:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:08,994 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2020-07-08 12:23:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:23:08,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-08 12:23:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:23:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-08 12:23:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-08 12:23:08,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2020-07-08 12:23:09,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:23:17,103 INFO L225 Difference]: With dead ends: 25228 [2020-07-08 12:23:17,104 INFO L226 Difference]: Without dead ends: 14218 [2020-07-08 12:23:17,115 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-08 12:23:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2020-07-08 12:23:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2020-07-08 12:23:20,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:23:20,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14218 states. Second operand 14216 states. [2020-07-08 12:23:20,992 INFO L74 IsIncluded]: Start isIncluded. First operand 14218 states. Second operand 14216 states. [2020-07-08 12:23:20,993 INFO L87 Difference]: Start difference. First operand 14218 states. Second operand 14216 states. [2020-07-08 12:23:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:27,907 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-08 12:23:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-08 12:23:27,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:23:27,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:23:27,917 INFO L74 IsIncluded]: Start isIncluded. First operand 14216 states. Second operand 14218 states. [2020-07-08 12:23:27,917 INFO L87 Difference]: Start difference. First operand 14216 states. Second operand 14218 states. [2020-07-08 12:23:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:34,393 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-08 12:23:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-08 12:23:34,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:23:34,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:23:34,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:23:34,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:23:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2020-07-08 12:23:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2020-07-08 12:23:40,715 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2020-07-08 12:23:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:23:40,715 INFO L479 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2020-07-08 12:23:40,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:23:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2020-07-08 12:23:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:23:40,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:23:40,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:23:40,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-08 12:23:40,721 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:23:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:23:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2020-07-08 12:23:40,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:23:40,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309220953] [2020-07-08 12:23:40,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:23:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:23:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:23:40,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-08 12:23:40,751 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-08 12:23:40,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {281916#true} call ULTIMATE.init(); {281916#true} is VALID [2020-07-08 12:23:40,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-08 12:23:40,752 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-08 12:23:40,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {281916#true} call #t~ret11 := main(); {281916#true} is VALID [2020-07-08 12:23:40,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {281916#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {281916#true} is VALID [2020-07-08 12:23:40,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {281916#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {281916#true} is VALID [2020-07-08 12:23:40,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {281916#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {281916#true} is VALID [2020-07-08 12:23:40,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {281916#true} assume !(0 != ~p1~0); {281916#true} is VALID [2020-07-08 12:23:40,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {281916#true} assume !(0 != ~p2~0); {281916#true} is VALID [2020-07-08 12:23:40,753 INFO L280 TraceCheckUtils]: 9: Hoare triple {281916#true} assume !(0 != ~p3~0); {281916#true} is VALID [2020-07-08 12:23:40,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {281916#true} assume !(0 != ~p4~0); {281916#true} is VALID [2020-07-08 12:23:40,754 INFO L280 TraceCheckUtils]: 11: Hoare triple {281916#true} assume !(0 != ~p5~0); {281916#true} is VALID [2020-07-08 12:23:40,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {281916#true} assume !(0 != ~p6~0); {281916#true} is VALID [2020-07-08 12:23:40,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {281916#true} assume !(0 != ~p7~0); {281916#true} is VALID [2020-07-08 12:23:40,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {281916#true} assume !(0 != ~p8~0); {281916#true} is VALID [2020-07-08 12:23:40,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {281916#true} assume 0 != ~p9~0;~lk9~0 := 1; {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {281920#(not (= 0 main_~p9~0))} assume 0 != ~p10~0;~lk10~0 := 1; {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p1~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p2~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p3~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p4~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p5~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p6~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p7~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p8~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-08 12:23:40,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {281917#false} is VALID [2020-07-08 12:23:40,760 INFO L280 TraceCheckUtils]: 26: Hoare triple {281917#false} assume 0 != ~p10~0; {281917#false} is VALID [2020-07-08 12:23:40,760 INFO L280 TraceCheckUtils]: 27: Hoare triple {281917#false} assume 1 != ~lk10~0; {281917#false} is VALID [2020-07-08 12:23:40,761 INFO L280 TraceCheckUtils]: 28: Hoare triple {281917#false} assume !false; {281917#false} is VALID [2020-07-08 12:23:40,762 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-08 12:23:40,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309220953] [2020-07-08 12:23:40,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:23:40,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:23:40,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054397635] [2020-07-08 12:23:40,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:23:40,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:23:40,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:23:40,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:23:40,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:23:40,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:23:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:23:40,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:23:40,795 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2020-07-08 12:23:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:23:59,774 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2020-07-08 12:23:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:23:59,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:23:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:23:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:23:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:23:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:23:59,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-08 12:23:59,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:08,216 INFO L225 Difference]: With dead ends: 21516 [2020-07-08 12:24:08,216 INFO L226 Difference]: Without dead ends: 14602 [2020-07-08 12:24:08,226 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-08 12:24:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-07-08 12:24:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2020-07-08 12:24:12,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:24:12,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14602 states. Second operand 14600 states. [2020-07-08 12:24:12,221 INFO L74 IsIncluded]: Start isIncluded. First operand 14602 states. Second operand 14600 states. [2020-07-08 12:24:12,221 INFO L87 Difference]: Start difference. First operand 14602 states. Second operand 14600 states. [2020-07-08 12:24:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:19,369 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-08 12:24:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-08 12:24:19,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:19,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:19,379 INFO L74 IsIncluded]: Start isIncluded. First operand 14600 states. Second operand 14602 states. [2020-07-08 12:24:19,379 INFO L87 Difference]: Start difference. First operand 14600 states. Second operand 14602 states. [2020-07-08 12:24:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:24:27,006 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-08 12:24:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-08 12:24:27,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:24:27,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:24:27,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:24:27,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:24:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-07-08 12:24:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2020-07-08 12:24:35,382 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2020-07-08 12:24:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:24:35,382 INFO L479 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2020-07-08 12:24:35,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:24:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2020-07-08 12:24:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:24:35,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:24:35,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:24:35,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-08 12:24:35,389 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:24:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:24:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2020-07-08 12:24:35,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:24:35,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266193378] [2020-07-08 12:24:35,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:24:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:24:35,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-08 12:24:35,425 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-08 12:24:35,425 INFO L263 TraceCheckUtils]: 0: Hoare triple {348537#true} call ULTIMATE.init(); {348537#true} is VALID [2020-07-08 12:24:35,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-08 12:24:35,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L263 TraceCheckUtils]: 3: Hoare triple {348537#true} call #t~ret11 := main(); {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {348537#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 5: Hoare triple {348537#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 6: Hoare triple {348537#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {348537#true} assume !(0 != ~p1~0); {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {348537#true} assume !(0 != ~p2~0); {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {348537#true} assume !(0 != ~p3~0); {348537#true} is VALID [2020-07-08 12:24:35,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {348537#true} assume !(0 != ~p4~0); {348537#true} is VALID [2020-07-08 12:24:35,427 INFO L280 TraceCheckUtils]: 11: Hoare triple {348537#true} assume !(0 != ~p5~0); {348537#true} is VALID [2020-07-08 12:24:35,427 INFO L280 TraceCheckUtils]: 12: Hoare triple {348537#true} assume !(0 != ~p6~0); {348537#true} is VALID [2020-07-08 12:24:35,427 INFO L280 TraceCheckUtils]: 13: Hoare triple {348537#true} assume !(0 != ~p7~0); {348537#true} is VALID [2020-07-08 12:24:35,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {348537#true} assume !(0 != ~p8~0); {348537#true} is VALID [2020-07-08 12:24:35,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {348537#true} assume !(0 != ~p9~0); {348537#true} is VALID [2020-07-08 12:24:35,428 INFO L280 TraceCheckUtils]: 16: Hoare triple {348537#true} assume 0 != ~p10~0;~lk10~0 := 1; {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,428 INFO L280 TraceCheckUtils]: 17: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,428 INFO L280 TraceCheckUtils]: 18: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,429 INFO L280 TraceCheckUtils]: 19: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,429 INFO L280 TraceCheckUtils]: 20: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,430 INFO L280 TraceCheckUtils]: 22: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,430 INFO L280 TraceCheckUtils]: 23: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,431 INFO L280 TraceCheckUtils]: 24: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,431 INFO L280 TraceCheckUtils]: 25: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,432 INFO L280 TraceCheckUtils]: 26: Hoare triple {348541#(= main_~lk10~0 1)} assume 0 != ~p10~0; {348541#(= main_~lk10~0 1)} is VALID [2020-07-08 12:24:35,432 INFO L280 TraceCheckUtils]: 27: Hoare triple {348541#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {348538#false} is VALID [2020-07-08 12:24:35,432 INFO L280 TraceCheckUtils]: 28: Hoare triple {348538#false} assume !false; {348538#false} is VALID [2020-07-08 12:24:35,433 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-08 12:24:35,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266193378] [2020-07-08 12:24:35,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:24:35,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:24:35,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086936971] [2020-07-08 12:24:35,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:24:35,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:24:35,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:24:35,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:24:35,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:24:35,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:24:35,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:24:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:24:35,464 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2020-07-08 12:25:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:07,207 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2020-07-08 12:25:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:25:07,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:25:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:25:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:25:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:25:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:25:07,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-08 12:25:07,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:36,002 INFO L225 Difference]: With dead ends: 23562 [2020-07-08 12:25:36,002 INFO L226 Difference]: Without dead ends: 23560 [2020-07-08 12:25:36,007 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-08 12:25:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2020-07-08 12:25:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2020-07-08 12:25:40,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:40,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23560 states. Second operand 22536 states. [2020-07-08 12:25:40,279 INFO L74 IsIncluded]: Start isIncluded. First operand 23560 states. Second operand 22536 states. [2020-07-08 12:25:40,279 INFO L87 Difference]: Start difference. First operand 23560 states. Second operand 22536 states. [2020-07-08 12:26:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:26:18,851 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-08 12:26:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-08 12:26:18,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:26:18,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:26:18,866 INFO L74 IsIncluded]: Start isIncluded. First operand 22536 states. Second operand 23560 states. [2020-07-08 12:26:18,866 INFO L87 Difference]: Start difference. First operand 22536 states. Second operand 23560 states. [2020-07-08 12:27:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:05,491 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-08 12:27:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-08 12:27:05,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:05,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:05,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:05,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2020-07-08 12:27:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2020-07-08 12:27:44,486 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2020-07-08 12:27:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:44,486 INFO L479 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2020-07-08 12:27:44,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:27:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2020-07-08 12:27:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:27:44,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:44,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:44,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-08 12:27:44,497 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2020-07-08 12:27:44,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:44,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221183079] [2020-07-08 12:27:44,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:44,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-08 12:27:44,545 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-08 12:27:44,545 INFO L263 TraceCheckUtils]: 0: Hoare triple {443311#true} call ULTIMATE.init(); {443311#true} is VALID [2020-07-08 12:27:44,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L263 TraceCheckUtils]: 3: Hoare triple {443311#true} call #t~ret11 := main(); {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L280 TraceCheckUtils]: 4: Hoare triple {443311#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L280 TraceCheckUtils]: 5: Hoare triple {443311#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {443311#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {443311#true} assume !(0 != ~p1~0); {443311#true} is VALID [2020-07-08 12:27:44,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {443311#true} assume !(0 != ~p2~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {443311#true} assume !(0 != ~p3~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {443311#true} assume !(0 != ~p4~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {443311#true} assume !(0 != ~p5~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 12: Hoare triple {443311#true} assume !(0 != ~p6~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 13: Hoare triple {443311#true} assume !(0 != ~p7~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 14: Hoare triple {443311#true} assume !(0 != ~p8~0); {443311#true} is VALID [2020-07-08 12:27:44,547 INFO L280 TraceCheckUtils]: 15: Hoare triple {443311#true} assume !(0 != ~p9~0); {443311#true} is VALID [2020-07-08 12:27:44,548 INFO L280 TraceCheckUtils]: 16: Hoare triple {443311#true} assume !(0 != ~p10~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,548 INFO L280 TraceCheckUtils]: 17: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,549 INFO L280 TraceCheckUtils]: 18: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,549 INFO L280 TraceCheckUtils]: 20: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,550 INFO L280 TraceCheckUtils]: 21: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,550 INFO L280 TraceCheckUtils]: 22: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,551 INFO L280 TraceCheckUtils]: 23: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,551 INFO L280 TraceCheckUtils]: 24: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,552 INFO L280 TraceCheckUtils]: 25: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-08 12:27:44,552 INFO L280 TraceCheckUtils]: 26: Hoare triple {443315#(= 0 main_~p10~0)} assume 0 != ~p10~0; {443312#false} is VALID [2020-07-08 12:27:44,552 INFO L280 TraceCheckUtils]: 27: Hoare triple {443312#false} assume 1 != ~lk10~0; {443312#false} is VALID [2020-07-08 12:27:44,553 INFO L280 TraceCheckUtils]: 28: Hoare triple {443312#false} assume !false; {443312#false} is VALID [2020-07-08 12:27:44,554 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-08 12:27:44,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221183079] [2020-07-08 12:27:44,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:44,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:27:44,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001868424] [2020-07-08 12:27:44,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:27:44,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:44,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:27:44,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:44,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:27:44,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:27:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:44,593 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2020-07-08 12:31:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:31:30,498 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2020-07-08 12:31:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:31:30,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:31:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:31:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:31:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:31:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:31:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 12:31:30,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-08 12:31:30,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:31:30,659 INFO L225 Difference]: With dead ends: 50184 [2020-07-08 12:31:30,659 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:31:30,719 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-08 12:31:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:31:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:31:30,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:31:30,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:31:30,720 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:31:30,720 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:31:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:31:30,720 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:31:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:31:30,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:31:30,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:31:30,721 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:31:30,721 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:31:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:31:30,721 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:31:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:31:30,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:31:30,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:31:30,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:31:30,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:31:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:31:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:31:30,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-08 12:31:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:31:30,723 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:31:30,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:31:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:31:30,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:31:30,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-08 12:31:30,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:31:30,774 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:31:30,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:31:30,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:31:30,774 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:31:30,774 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L271 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-07-08 12:31:30,775 INFO L268 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L271 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-07-08 12:31:30,776 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L264 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,777 INFO L268 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2020-07-08 12:31:30,778 INFO L268 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,779 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-08 12:31:30,779 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-07-08 12:31:30,779 INFO L268 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,780 INFO L268 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2020-07-08 12:31:30,780 INFO L268 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2020-07-08 12:31:30,780 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-07-08 12:31:30,784 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:31:30,785 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-08 12:31:30,786 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-08 12:31:30,787 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-08 12:31:30,788 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-08 12:31:30,789 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-08 12:31:30,790 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-08 12:31:30,791 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-08 12:31:30,792 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-08 12:31:30,793 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-08 12:31:30,793 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-08 12:31:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:31:30 BoogieIcfgContainer [2020-07-08 12:31:30,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:31:30,815 INFO L168 Benchmark]: Toolchain (without parser) took 641953.26 ms. Allocated memory was 144.7 MB in the beginning and 998.8 MB in the end (delta: 854.1 MB). Free memory was 103.2 MB in the beginning and 231.1 MB in the end (delta: -127.9 MB). Peak memory consumption was 726.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,818 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.12 ms. Allocated memory is still 144.7 MB. Free memory was 103.0 MB in the beginning and 91.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,819 INFO L168 Benchmark]: Boogie Preprocessor took 148.48 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.6 MB in the beginning and 180.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,820 INFO L168 Benchmark]: RCFGBuilder took 612.85 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 149.5 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,820 INFO L168 Benchmark]: TraceAbstraction took 640895.56 ms. Allocated memory was 202.4 MB in the beginning and 998.8 MB in the end (delta: 796.4 MB). Free memory was 149.5 MB in the beginning and 231.1 MB in the end (delta: -81.7 MB). Peak memory consumption was 714.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:31:30,822 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.12 ms. Allocated memory is still 144.7 MB. Free memory was 103.0 MB in the beginning and 91.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.48 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 91.6 MB in the beginning and 180.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 612.85 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 149.5 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 640895.56 ms. Allocated memory was 202.4 MB in the beginning and 998.8 MB in the end (delta: 796.4 MB). Free memory was 149.5 MB in the beginning and 231.1 MB in the end (delta: -81.7 MB). Peak memory consumption was 714.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 640.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 418.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 219.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...