/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:17:18,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:17:18,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:17:19,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:17:19,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:17:19,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:17:19,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:17:19,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:17:19,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:17:19,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:17:19,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:17:19,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:17:19,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:17:19,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:17:19,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:17:19,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:17:19,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:17:19,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:17:19,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:17:19,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:17:19,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:17:19,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:17:19,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:17:19,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:17:19,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:17:19,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:17:19,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:17:19,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:17:19,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:17:19,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:17:19,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:17:19,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:17:19,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:17:19,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:17:19,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:17:19,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:17:19,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:17:19,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:17:19,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:17:19,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:17:19,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:17:19,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:17:19,075 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:17:19,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:17:19,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:17:19,077 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:17:19,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:17:19,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:17:19,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:17:19,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:17:19,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:17:19,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:17:19,079 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:17:19,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:17:19,079 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:17:19,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:17:19,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:17:19,080 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:17:19,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:17:19,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:17:19,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:17:19,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:17:19,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:17:19,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:17:19,081 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:17:19,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:17:19,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:17:19,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:17:19,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:17:19,372 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:17:19,372 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-08 16:17:19,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549fb9dce/7ffcfb256de54ca1ad7f4535b6f84899/FLAGfe77e1008 [2020-07-08 16:17:19,924 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:17:19,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-08 16:17:19,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549fb9dce/7ffcfb256de54ca1ad7f4535b6f84899/FLAGfe77e1008 [2020-07-08 16:17:20,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549fb9dce/7ffcfb256de54ca1ad7f4535b6f84899 [2020-07-08 16:17:20,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:17:20,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:17:20,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:17:20,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:17:20,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:17:20,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b5cd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20, skipping insertion in model container [2020-07-08 16:17:20,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:17:20,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:17:20,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:17:20,573 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:17:20,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:17:20,611 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:17:20,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20 WrapperNode [2020-07-08 16:17:20,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:17:20,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:17:20,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:17:20,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:17:20,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (1/1) ... [2020-07-08 16:17:20,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:17:20,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:17:20,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:17:20,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:17:20,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (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 16:17:20,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:17:20,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:17:20,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:17:20,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:17:20,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 16:17:20,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:17:20,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:17:20,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:17:21,257 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:17:21,258 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 16:17:21,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:17:21 BoogieIcfgContainer [2020-07-08 16:17:21,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:17:21,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:17:21,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:17:21,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:17:21,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:17:20" (1/3) ... [2020-07-08 16:17:21,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:17:21, skipping insertion in model container [2020-07-08 16:17:21,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:20" (2/3) ... [2020-07-08 16:17:21,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:17:21, skipping insertion in model container [2020-07-08 16:17:21,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:17:21" (3/3) ... [2020-07-08 16:17:21,275 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-08 16:17:21,285 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:17:21,294 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:17:21,307 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:17:21,329 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:17:21,329 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:17:21,330 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:17:21,330 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:17:21,330 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:17:21,330 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:17:21,330 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:17:21,330 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:17:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-08 16:17:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 16:17:21,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:21,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:21,360 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-08 16:17:21,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:21,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538601872] [2020-07-08 16:17:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:21,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-08 16:17:21,605 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-08 16:17:21,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {81#true} is VALID [2020-07-08 16:17:21,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-08 16:17:21,609 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-08 16:17:21,610 INFO L263 TraceCheckUtils]: 3: Hoare triple {81#true} call #t~ret7 := main(); {81#true} is VALID [2020-07-08 16:17:21,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#true} ~p1~0 := #t~nondet0; {81#true} is VALID [2020-07-08 16:17:21,611 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#true} havoc #t~nondet0; {81#true} is VALID [2020-07-08 16:17:21,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} havoc ~lk1~0; {81#true} is VALID [2020-07-08 16:17:21,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,613 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} ~p2~0 := #t~nondet1; {81#true} is VALID [2020-07-08 16:17:21,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {81#true} havoc #t~nondet1; {81#true} is VALID [2020-07-08 16:17:21,614 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} havoc ~lk2~0; {81#true} is VALID [2020-07-08 16:17:21,614 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,615 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} ~p3~0 := #t~nondet2; {81#true} is VALID [2020-07-08 16:17:21,615 INFO L280 TraceCheckUtils]: 14: Hoare triple {81#true} havoc #t~nondet2; {81#true} is VALID [2020-07-08 16:17:21,616 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} havoc ~lk3~0; {81#true} is VALID [2020-07-08 16:17:21,616 INFO L280 TraceCheckUtils]: 16: Hoare triple {81#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,617 INFO L280 TraceCheckUtils]: 17: Hoare triple {81#true} ~p4~0 := #t~nondet3; {81#true} is VALID [2020-07-08 16:17:21,617 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} havoc #t~nondet3; {81#true} is VALID [2020-07-08 16:17:21,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {81#true} havoc ~lk4~0; {81#true} is VALID [2020-07-08 16:17:21,618 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {81#true} ~p5~0 := #t~nondet4; {81#true} is VALID [2020-07-08 16:17:21,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {81#true} havoc #t~nondet4; {81#true} is VALID [2020-07-08 16:17:21,620 INFO L280 TraceCheckUtils]: 23: Hoare triple {81#true} havoc ~lk5~0; {81#true} is VALID [2020-07-08 16:17:21,620 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,620 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#true} ~p6~0 := #t~nondet5; {81#true} is VALID [2020-07-08 16:17:21,621 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#true} havoc #t~nondet5; {81#true} is VALID [2020-07-08 16:17:21,622 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#true} havoc ~lk6~0; {81#true} is VALID [2020-07-08 16:17:21,622 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#true} havoc ~cond~0; {81#true} is VALID [2020-07-08 16:17:21,622 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#true} assume !false; {81#true} is VALID [2020-07-08 16:17:21,623 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {81#true} is VALID [2020-07-08 16:17:21,623 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#true} ~cond~0 := #t~nondet6; {81#true} is VALID [2020-07-08 16:17:21,624 INFO L280 TraceCheckUtils]: 32: Hoare triple {81#true} havoc #t~nondet6; {81#true} is VALID [2020-07-08 16:17:21,624 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#true} assume !(0 == ~cond~0); {81#true} is VALID [2020-07-08 16:17:21,625 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#true} ~lk1~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,625 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#true} ~lk2~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,625 INFO L280 TraceCheckUtils]: 36: Hoare triple {81#true} ~lk3~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,626 INFO L280 TraceCheckUtils]: 37: Hoare triple {81#true} ~lk4~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,626 INFO L280 TraceCheckUtils]: 38: Hoare triple {81#true} ~lk5~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,627 INFO L280 TraceCheckUtils]: 39: Hoare triple {81#true} ~lk6~0 := 0; {81#true} is VALID [2020-07-08 16:17:21,630 INFO L280 TraceCheckUtils]: 40: Hoare triple {81#true} assume !(0 != ~p1~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,632 INFO L280 TraceCheckUtils]: 41: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,633 INFO L280 TraceCheckUtils]: 42: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,636 INFO L280 TraceCheckUtils]: 43: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,638 INFO L280 TraceCheckUtils]: 44: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,640 INFO L280 TraceCheckUtils]: 45: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:21,641 INFO L280 TraceCheckUtils]: 46: Hoare triple {85#(= 0 main_~p1~0)} assume 0 != ~p1~0; {82#false} is VALID [2020-07-08 16:17:21,641 INFO L280 TraceCheckUtils]: 47: Hoare triple {82#false} assume 1 != ~lk1~0; {82#false} is VALID [2020-07-08 16:17:21,642 INFO L280 TraceCheckUtils]: 48: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-08 16:17:21,657 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 16:17:21,658 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:21,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538601872] [2020-07-08 16:17:21,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:21,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:21,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038723463] [2020-07-08 16:17:21,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-08 16:17:21,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:21,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:21,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:21,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:21,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:21,776 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-08 16:17:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:22,307 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-08 16:17:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:22,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-08 16:17:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-08 16:17:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-08 16:17:22,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2020-07-08 16:17:22,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:22,675 INFO L225 Difference]: With dead ends: 169 [2020-07-08 16:17:22,675 INFO L226 Difference]: Without dead ends: 112 [2020-07-08 16:17:22,681 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 16:17:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-08 16:17:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-08 16:17:22,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:22,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-08 16:17:22,838 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-08 16:17:22,839 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-08 16:17:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:22,849 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-08 16:17:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-08 16:17:22,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:22,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:22,851 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-08 16:17:22,851 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-08 16:17:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:22,861 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-08 16:17:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-08 16:17:22,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:22,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:22,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:22,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-08 16:17:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-08 16:17:22,873 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-08 16:17:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:22,873 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-08 16:17:22,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:22,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2020-07-08 16:17:23,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-08 16:17:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 16:17:23,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:23,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:23,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:17:23,058 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-08 16:17:23,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:23,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223970450] [2020-07-08 16:17:23,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:23,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-08 16:17:23,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-08 16:17:23,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2020-07-08 16:17:23,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-08 16:17:23,149 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-08 16:17:23,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {870#true} call #t~ret7 := main(); {870#true} is VALID [2020-07-08 16:17:23,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {870#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,151 INFO L280 TraceCheckUtils]: 5: Hoare triple {870#true} ~p1~0 := #t~nondet0; {870#true} is VALID [2020-07-08 16:17:23,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {870#true} havoc #t~nondet0; {870#true} is VALID [2020-07-08 16:17:23,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {870#true} havoc ~lk1~0; {870#true} is VALID [2020-07-08 16:17:23,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {870#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,152 INFO L280 TraceCheckUtils]: 9: Hoare triple {870#true} ~p2~0 := #t~nondet1; {870#true} is VALID [2020-07-08 16:17:23,152 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#true} havoc #t~nondet1; {870#true} is VALID [2020-07-08 16:17:23,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {870#true} havoc ~lk2~0; {870#true} is VALID [2020-07-08 16:17:23,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {870#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#true} ~p3~0 := #t~nondet2; {870#true} is VALID [2020-07-08 16:17:23,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#true} havoc #t~nondet2; {870#true} is VALID [2020-07-08 16:17:23,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {870#true} havoc ~lk3~0; {870#true} is VALID [2020-07-08 16:17:23,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {870#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {870#true} ~p4~0 := #t~nondet3; {870#true} is VALID [2020-07-08 16:17:23,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {870#true} havoc #t~nondet3; {870#true} is VALID [2020-07-08 16:17:23,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#true} havoc ~lk4~0; {870#true} is VALID [2020-07-08 16:17:23,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {870#true} ~p5~0 := #t~nondet4; {870#true} is VALID [2020-07-08 16:17:23,157 INFO L280 TraceCheckUtils]: 22: Hoare triple {870#true} havoc #t~nondet4; {870#true} is VALID [2020-07-08 16:17:23,157 INFO L280 TraceCheckUtils]: 23: Hoare triple {870#true} havoc ~lk5~0; {870#true} is VALID [2020-07-08 16:17:23,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {870#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,158 INFO L280 TraceCheckUtils]: 25: Hoare triple {870#true} ~p6~0 := #t~nondet5; {870#true} is VALID [2020-07-08 16:17:23,158 INFO L280 TraceCheckUtils]: 26: Hoare triple {870#true} havoc #t~nondet5; {870#true} is VALID [2020-07-08 16:17:23,158 INFO L280 TraceCheckUtils]: 27: Hoare triple {870#true} havoc ~lk6~0; {870#true} is VALID [2020-07-08 16:17:23,159 INFO L280 TraceCheckUtils]: 28: Hoare triple {870#true} havoc ~cond~0; {870#true} is VALID [2020-07-08 16:17:23,159 INFO L280 TraceCheckUtils]: 29: Hoare triple {870#true} assume !false; {870#true} is VALID [2020-07-08 16:17:23,159 INFO L280 TraceCheckUtils]: 30: Hoare triple {870#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {870#true} is VALID [2020-07-08 16:17:23,160 INFO L280 TraceCheckUtils]: 31: Hoare triple {870#true} ~cond~0 := #t~nondet6; {870#true} is VALID [2020-07-08 16:17:23,160 INFO L280 TraceCheckUtils]: 32: Hoare triple {870#true} havoc #t~nondet6; {870#true} is VALID [2020-07-08 16:17:23,161 INFO L280 TraceCheckUtils]: 33: Hoare triple {870#true} assume !(0 == ~cond~0); {870#true} is VALID [2020-07-08 16:17:23,161 INFO L280 TraceCheckUtils]: 34: Hoare triple {870#true} ~lk1~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,161 INFO L280 TraceCheckUtils]: 35: Hoare triple {870#true} ~lk2~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,162 INFO L280 TraceCheckUtils]: 36: Hoare triple {870#true} ~lk3~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,162 INFO L280 TraceCheckUtils]: 37: Hoare triple {870#true} ~lk4~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,162 INFO L280 TraceCheckUtils]: 38: Hoare triple {870#true} ~lk5~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,163 INFO L280 TraceCheckUtils]: 39: Hoare triple {870#true} ~lk6~0 := 0; {870#true} is VALID [2020-07-08 16:17:23,163 INFO L280 TraceCheckUtils]: 40: Hoare triple {870#true} assume 0 != ~p1~0; {870#true} is VALID [2020-07-08 16:17:23,164 INFO L280 TraceCheckUtils]: 41: Hoare triple {870#true} ~lk1~0 := 1; {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,166 INFO L280 TraceCheckUtils]: 42: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,167 INFO L280 TraceCheckUtils]: 43: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,169 INFO L280 TraceCheckUtils]: 44: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,170 INFO L280 TraceCheckUtils]: 45: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,171 INFO L280 TraceCheckUtils]: 46: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,173 INFO L280 TraceCheckUtils]: 47: Hoare triple {874#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {874#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:23,174 INFO L280 TraceCheckUtils]: 48: Hoare triple {874#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {871#false} is VALID [2020-07-08 16:17:23,175 INFO L280 TraceCheckUtils]: 49: Hoare triple {871#false} assume !false; {871#false} is VALID [2020-07-08 16:17:23,179 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 16:17:23,180 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:23,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223970450] [2020-07-08 16:17:23,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:23,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:23,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301717766] [2020-07-08 16:17:23,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 16:17:23,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:23,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:23,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:23,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:23,246 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-08 16:17:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:23,542 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-08 16:17:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:23,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 16:17:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 16:17:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 16:17:23,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-08 16:17:23,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:23,703 INFO L225 Difference]: With dead ends: 135 [2020-07-08 16:17:23,703 INFO L226 Difference]: Without dead ends: 133 [2020-07-08 16:17:23,705 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 16:17:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-08 16:17:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-08 16:17:23,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:23,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 110 states. [2020-07-08 16:17:23,824 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 110 states. [2020-07-08 16:17:23,825 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 110 states. [2020-07-08 16:17:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:23,833 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-08 16:17:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-08 16:17:23,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:23,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:23,838 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 133 states. [2020-07-08 16:17:23,838 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 133 states. [2020-07-08 16:17:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:23,849 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-08 16:17:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-08 16:17:23,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:23,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:23,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:23,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-08 16:17:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-08 16:17:23,857 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-08 16:17:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:23,857 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-08 16:17:23,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:23,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 141 transitions. [2020-07-08 16:17:24,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-08 16:17:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 16:17:24,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:24,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:24,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:17:24,015 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-08 16:17:24,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:24,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [816628540] [2020-07-08 16:17:24,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:24,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-08 16:17:24,071 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-08 16:17:24,071 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-08 16:17:24,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-08 16:17:24,071 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-08 16:17:24,072 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret7 := main(); {1633#true} is VALID [2020-07-08 16:17:24,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,072 INFO L280 TraceCheckUtils]: 5: Hoare triple {1633#true} ~p1~0 := #t~nondet0; {1633#true} is VALID [2020-07-08 16:17:24,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} havoc #t~nondet0; {1633#true} is VALID [2020-07-08 16:17:24,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {1633#true} havoc ~lk1~0; {1633#true} is VALID [2020-07-08 16:17:24,073 INFO L280 TraceCheckUtils]: 8: Hoare triple {1633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {1633#true} ~p2~0 := #t~nondet1; {1633#true} is VALID [2020-07-08 16:17:24,074 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#true} havoc #t~nondet1; {1633#true} is VALID [2020-07-08 16:17:24,074 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#true} havoc ~lk2~0; {1633#true} is VALID [2020-07-08 16:17:24,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#true} ~p3~0 := #t~nondet2; {1633#true} is VALID [2020-07-08 16:17:24,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {1633#true} havoc #t~nondet2; {1633#true} is VALID [2020-07-08 16:17:24,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {1633#true} havoc ~lk3~0; {1633#true} is VALID [2020-07-08 16:17:24,085 INFO L280 TraceCheckUtils]: 16: Hoare triple {1633#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,085 INFO L280 TraceCheckUtils]: 17: Hoare triple {1633#true} ~p4~0 := #t~nondet3; {1633#true} is VALID [2020-07-08 16:17:24,086 INFO L280 TraceCheckUtils]: 18: Hoare triple {1633#true} havoc #t~nondet3; {1633#true} is VALID [2020-07-08 16:17:24,086 INFO L280 TraceCheckUtils]: 19: Hoare triple {1633#true} havoc ~lk4~0; {1633#true} is VALID [2020-07-08 16:17:24,086 INFO L280 TraceCheckUtils]: 20: Hoare triple {1633#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,086 INFO L280 TraceCheckUtils]: 21: Hoare triple {1633#true} ~p5~0 := #t~nondet4; {1633#true} is VALID [2020-07-08 16:17:24,087 INFO L280 TraceCheckUtils]: 22: Hoare triple {1633#true} havoc #t~nondet4; {1633#true} is VALID [2020-07-08 16:17:24,087 INFO L280 TraceCheckUtils]: 23: Hoare triple {1633#true} havoc ~lk5~0; {1633#true} is VALID [2020-07-08 16:17:24,087 INFO L280 TraceCheckUtils]: 24: Hoare triple {1633#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,088 INFO L280 TraceCheckUtils]: 25: Hoare triple {1633#true} ~p6~0 := #t~nondet5; {1633#true} is VALID [2020-07-08 16:17:24,088 INFO L280 TraceCheckUtils]: 26: Hoare triple {1633#true} havoc #t~nondet5; {1633#true} is VALID [2020-07-08 16:17:24,088 INFO L280 TraceCheckUtils]: 27: Hoare triple {1633#true} havoc ~lk6~0; {1633#true} is VALID [2020-07-08 16:17:24,089 INFO L280 TraceCheckUtils]: 28: Hoare triple {1633#true} havoc ~cond~0; {1633#true} is VALID [2020-07-08 16:17:24,089 INFO L280 TraceCheckUtils]: 29: Hoare triple {1633#true} assume !false; {1633#true} is VALID [2020-07-08 16:17:24,089 INFO L280 TraceCheckUtils]: 30: Hoare triple {1633#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1633#true} is VALID [2020-07-08 16:17:24,090 INFO L280 TraceCheckUtils]: 31: Hoare triple {1633#true} ~cond~0 := #t~nondet6; {1633#true} is VALID [2020-07-08 16:17:24,091 INFO L280 TraceCheckUtils]: 32: Hoare triple {1633#true} havoc #t~nondet6; {1633#true} is VALID [2020-07-08 16:17:24,091 INFO L280 TraceCheckUtils]: 33: Hoare triple {1633#true} assume !(0 == ~cond~0); {1633#true} is VALID [2020-07-08 16:17:24,091 INFO L280 TraceCheckUtils]: 34: Hoare triple {1633#true} ~lk1~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,095 INFO L280 TraceCheckUtils]: 35: Hoare triple {1633#true} ~lk2~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,095 INFO L280 TraceCheckUtils]: 36: Hoare triple {1633#true} ~lk3~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,095 INFO L280 TraceCheckUtils]: 37: Hoare triple {1633#true} ~lk4~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,095 INFO L280 TraceCheckUtils]: 38: Hoare triple {1633#true} ~lk5~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,096 INFO L280 TraceCheckUtils]: 39: Hoare triple {1633#true} ~lk6~0 := 0; {1633#true} is VALID [2020-07-08 16:17:24,096 INFO L280 TraceCheckUtils]: 40: Hoare triple {1633#true} assume !(0 != ~p1~0); {1633#true} is VALID [2020-07-08 16:17:24,110 INFO L280 TraceCheckUtils]: 41: Hoare triple {1633#true} assume !(0 != ~p2~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,111 INFO L280 TraceCheckUtils]: 42: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,117 INFO L280 TraceCheckUtils]: 43: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,118 INFO L280 TraceCheckUtils]: 44: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,120 INFO L280 TraceCheckUtils]: 45: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,122 INFO L280 TraceCheckUtils]: 46: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:24,124 INFO L280 TraceCheckUtils]: 47: Hoare triple {1637#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1634#false} is VALID [2020-07-08 16:17:24,125 INFO L280 TraceCheckUtils]: 48: Hoare triple {1634#false} assume 1 != ~lk2~0; {1634#false} is VALID [2020-07-08 16:17:24,125 INFO L280 TraceCheckUtils]: 49: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-08 16:17:24,128 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 16:17:24,128 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:24,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [816628540] [2020-07-08 16:17:24,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:24,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:24,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930417759] [2020-07-08 16:17:24,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 16:17:24,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:24,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:24,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:24,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:24,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:24,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:24,172 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-08 16:17:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:24,568 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-08 16:17:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:24,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 16:17:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-08 16:17:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-08 16:17:24,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-08 16:17:24,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:24,794 INFO L225 Difference]: With dead ends: 266 [2020-07-08 16:17:24,795 INFO L226 Difference]: Without dead ends: 185 [2020-07-08 16:17:24,797 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 16:17:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-08 16:17:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-08 16:17:25,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:25,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2020-07-08 16:17:25,035 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2020-07-08 16:17:25,036 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2020-07-08 16:17:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:25,046 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-08 16:17:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-08 16:17:25,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:25,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:25,047 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2020-07-08 16:17:25,047 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2020-07-08 16:17:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:25,055 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-08 16:17:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-08 16:17:25,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:25,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:25,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:25,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-08 16:17:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-08 16:17:25,068 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-08 16:17:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:25,070 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-08 16:17:25,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:25,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 240 transitions. [2020-07-08 16:17:25,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-08 16:17:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 16:17:25,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:25,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:25,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:17:25,340 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-08 16:17:25,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:25,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777813642] [2020-07-08 16:17:25,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:25,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-08 16:17:25,423 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-08 16:17:25,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2020-07-08 16:17:25,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-08 16:17:25,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-08 16:17:25,424 INFO L263 TraceCheckUtils]: 3: Hoare triple {2908#true} call #t~ret7 := main(); {2908#true} is VALID [2020-07-08 16:17:25,425 INFO L280 TraceCheckUtils]: 4: Hoare triple {2908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} ~p1~0 := #t~nondet0; {2908#true} is VALID [2020-07-08 16:17:25,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {2908#true} havoc #t~nondet0; {2908#true} is VALID [2020-07-08 16:17:25,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {2908#true} havoc ~lk1~0; {2908#true} is VALID [2020-07-08 16:17:25,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {2908#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {2908#true} ~p2~0 := #t~nondet1; {2908#true} is VALID [2020-07-08 16:17:25,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {2908#true} havoc #t~nondet1; {2908#true} is VALID [2020-07-08 16:17:25,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {2908#true} havoc ~lk2~0; {2908#true} is VALID [2020-07-08 16:17:25,427 INFO L280 TraceCheckUtils]: 12: Hoare triple {2908#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,427 INFO L280 TraceCheckUtils]: 13: Hoare triple {2908#true} ~p3~0 := #t~nondet2; {2908#true} is VALID [2020-07-08 16:17:25,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {2908#true} havoc #t~nondet2; {2908#true} is VALID [2020-07-08 16:17:25,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {2908#true} havoc ~lk3~0; {2908#true} is VALID [2020-07-08 16:17:25,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {2908#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,428 INFO L280 TraceCheckUtils]: 17: Hoare triple {2908#true} ~p4~0 := #t~nondet3; {2908#true} is VALID [2020-07-08 16:17:25,428 INFO L280 TraceCheckUtils]: 18: Hoare triple {2908#true} havoc #t~nondet3; {2908#true} is VALID [2020-07-08 16:17:25,428 INFO L280 TraceCheckUtils]: 19: Hoare triple {2908#true} havoc ~lk4~0; {2908#true} is VALID [2020-07-08 16:17:25,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {2908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,428 INFO L280 TraceCheckUtils]: 21: Hoare triple {2908#true} ~p5~0 := #t~nondet4; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 22: Hoare triple {2908#true} havoc #t~nondet4; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 23: Hoare triple {2908#true} havoc ~lk5~0; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 24: Hoare triple {2908#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {2908#true} ~p6~0 := #t~nondet5; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {2908#true} havoc #t~nondet5; {2908#true} is VALID [2020-07-08 16:17:25,429 INFO L280 TraceCheckUtils]: 27: Hoare triple {2908#true} havoc ~lk6~0; {2908#true} is VALID [2020-07-08 16:17:25,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {2908#true} havoc ~cond~0; {2908#true} is VALID [2020-07-08 16:17:25,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {2908#true} assume !false; {2908#true} is VALID [2020-07-08 16:17:25,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2908#true} is VALID [2020-07-08 16:17:25,430 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#true} ~cond~0 := #t~nondet6; {2908#true} is VALID [2020-07-08 16:17:25,430 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#true} havoc #t~nondet6; {2908#true} is VALID [2020-07-08 16:17:25,431 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#true} assume !(0 == ~cond~0); {2908#true} is VALID [2020-07-08 16:17:25,431 INFO L280 TraceCheckUtils]: 34: Hoare triple {2908#true} ~lk1~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,431 INFO L280 TraceCheckUtils]: 35: Hoare triple {2908#true} ~lk2~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,431 INFO L280 TraceCheckUtils]: 36: Hoare triple {2908#true} ~lk3~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,431 INFO L280 TraceCheckUtils]: 37: Hoare triple {2908#true} ~lk4~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,432 INFO L280 TraceCheckUtils]: 38: Hoare triple {2908#true} ~lk5~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,432 INFO L280 TraceCheckUtils]: 39: Hoare triple {2908#true} ~lk6~0 := 0; {2908#true} is VALID [2020-07-08 16:17:25,432 INFO L280 TraceCheckUtils]: 40: Hoare triple {2908#true} assume !(0 != ~p1~0); {2908#true} is VALID [2020-07-08 16:17:25,432 INFO L280 TraceCheckUtils]: 41: Hoare triple {2908#true} assume !(0 != ~p2~0); {2908#true} is VALID [2020-07-08 16:17:25,433 INFO L280 TraceCheckUtils]: 42: Hoare triple {2908#true} assume !(0 != ~p3~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,434 INFO L280 TraceCheckUtils]: 43: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,435 INFO L280 TraceCheckUtils]: 44: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,435 INFO L280 TraceCheckUtils]: 45: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,438 INFO L280 TraceCheckUtils]: 46: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,440 INFO L280 TraceCheckUtils]: 47: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:25,441 INFO L280 TraceCheckUtils]: 48: Hoare triple {2912#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2909#false} is VALID [2020-07-08 16:17:25,442 INFO L280 TraceCheckUtils]: 49: Hoare triple {2909#false} assume 1 != ~lk3~0; {2909#false} is VALID [2020-07-08 16:17:25,442 INFO L280 TraceCheckUtils]: 50: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-08 16:17:25,445 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 16:17:25,445 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:25,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777813642] [2020-07-08 16:17:25,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:25,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:25,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458905036] [2020-07-08 16:17:25,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-08 16:17:25,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:25,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:25,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:25,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:25,495 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-08 16:17:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:26,111 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-08 16:17:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:26,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-08 16:17:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-08 16:17:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-08 16:17:26,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-08 16:17:26,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:26,311 INFO L225 Difference]: With dead ends: 479 [2020-07-08 16:17:26,311 INFO L226 Difference]: Without dead ends: 325 [2020-07-08 16:17:26,312 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 16:17:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-08 16:17:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-08 16:17:26,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:26,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 323 states. [2020-07-08 16:17:26,706 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 323 states. [2020-07-08 16:17:26,707 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 323 states. [2020-07-08 16:17:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:26,720 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-08 16:17:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-08 16:17:26,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:26,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:26,721 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 325 states. [2020-07-08 16:17:26,722 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 325 states. [2020-07-08 16:17:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:26,734 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-08 16:17:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-08 16:17:26,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:26,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:26,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:26,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-08 16:17:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-08 16:17:26,747 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-08 16:17:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:26,747 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-08 16:17:26,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:26,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 426 transitions. [2020-07-08 16:17:27,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-08 16:17:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 16:17:27,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:27,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:27,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 16:17:27,208 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-08 16:17:27,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:27,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439869297] [2020-07-08 16:17:27,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:27,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-08 16:17:27,259 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-08 16:17:27,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2020-07-08 16:17:27,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-08 16:17:27,260 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-08 16:17:27,260 INFO L263 TraceCheckUtils]: 3: Hoare triple {5169#true} call #t~ret7 := main(); {5169#true} is VALID [2020-07-08 16:17:27,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {5169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {5169#true} ~p1~0 := #t~nondet0; {5169#true} is VALID [2020-07-08 16:17:27,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {5169#true} havoc #t~nondet0; {5169#true} is VALID [2020-07-08 16:17:27,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {5169#true} havoc ~lk1~0; {5169#true} is VALID [2020-07-08 16:17:27,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {5169#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {5169#true} ~p2~0 := #t~nondet1; {5169#true} is VALID [2020-07-08 16:17:27,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {5169#true} havoc #t~nondet1; {5169#true} is VALID [2020-07-08 16:17:27,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {5169#true} havoc ~lk2~0; {5169#true} is VALID [2020-07-08 16:17:27,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {5169#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {5169#true} ~p3~0 := #t~nondet2; {5169#true} is VALID [2020-07-08 16:17:27,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {5169#true} havoc #t~nondet2; {5169#true} is VALID [2020-07-08 16:17:27,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {5169#true} havoc ~lk3~0; {5169#true} is VALID [2020-07-08 16:17:27,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {5169#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {5169#true} ~p4~0 := #t~nondet3; {5169#true} is VALID [2020-07-08 16:17:27,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {5169#true} havoc #t~nondet3; {5169#true} is VALID [2020-07-08 16:17:27,264 INFO L280 TraceCheckUtils]: 19: Hoare triple {5169#true} havoc ~lk4~0; {5169#true} is VALID [2020-07-08 16:17:27,264 INFO L280 TraceCheckUtils]: 20: Hoare triple {5169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,264 INFO L280 TraceCheckUtils]: 21: Hoare triple {5169#true} ~p5~0 := #t~nondet4; {5169#true} is VALID [2020-07-08 16:17:27,264 INFO L280 TraceCheckUtils]: 22: Hoare triple {5169#true} havoc #t~nondet4; {5169#true} is VALID [2020-07-08 16:17:27,265 INFO L280 TraceCheckUtils]: 23: Hoare triple {5169#true} havoc ~lk5~0; {5169#true} is VALID [2020-07-08 16:17:27,265 INFO L280 TraceCheckUtils]: 24: Hoare triple {5169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,265 INFO L280 TraceCheckUtils]: 25: Hoare triple {5169#true} ~p6~0 := #t~nondet5; {5169#true} is VALID [2020-07-08 16:17:27,265 INFO L280 TraceCheckUtils]: 26: Hoare triple {5169#true} havoc #t~nondet5; {5169#true} is VALID [2020-07-08 16:17:27,265 INFO L280 TraceCheckUtils]: 27: Hoare triple {5169#true} havoc ~lk6~0; {5169#true} is VALID [2020-07-08 16:17:27,266 INFO L280 TraceCheckUtils]: 28: Hoare triple {5169#true} havoc ~cond~0; {5169#true} is VALID [2020-07-08 16:17:27,266 INFO L280 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !false; {5169#true} is VALID [2020-07-08 16:17:27,266 INFO L280 TraceCheckUtils]: 30: Hoare triple {5169#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5169#true} is VALID [2020-07-08 16:17:27,266 INFO L280 TraceCheckUtils]: 31: Hoare triple {5169#true} ~cond~0 := #t~nondet6; {5169#true} is VALID [2020-07-08 16:17:27,267 INFO L280 TraceCheckUtils]: 32: Hoare triple {5169#true} havoc #t~nondet6; {5169#true} is VALID [2020-07-08 16:17:27,267 INFO L280 TraceCheckUtils]: 33: Hoare triple {5169#true} assume !(0 == ~cond~0); {5169#true} is VALID [2020-07-08 16:17:27,267 INFO L280 TraceCheckUtils]: 34: Hoare triple {5169#true} ~lk1~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,267 INFO L280 TraceCheckUtils]: 35: Hoare triple {5169#true} ~lk2~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,267 INFO L280 TraceCheckUtils]: 36: Hoare triple {5169#true} ~lk3~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,268 INFO L280 TraceCheckUtils]: 37: Hoare triple {5169#true} ~lk4~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,268 INFO L280 TraceCheckUtils]: 38: Hoare triple {5169#true} ~lk5~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,268 INFO L280 TraceCheckUtils]: 39: Hoare triple {5169#true} ~lk6~0 := 0; {5169#true} is VALID [2020-07-08 16:17:27,268 INFO L280 TraceCheckUtils]: 40: Hoare triple {5169#true} assume !(0 != ~p1~0); {5169#true} is VALID [2020-07-08 16:17:27,269 INFO L280 TraceCheckUtils]: 41: Hoare triple {5169#true} assume 0 != ~p2~0; {5169#true} is VALID [2020-07-08 16:17:27,269 INFO L280 TraceCheckUtils]: 42: Hoare triple {5169#true} ~lk2~0 := 1; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,271 INFO L280 TraceCheckUtils]: 43: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,273 INFO L280 TraceCheckUtils]: 44: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,275 INFO L280 TraceCheckUtils]: 45: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,277 INFO L280 TraceCheckUtils]: 46: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,278 INFO L280 TraceCheckUtils]: 47: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,279 INFO L280 TraceCheckUtils]: 48: Hoare triple {5173#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:27,279 INFO L280 TraceCheckUtils]: 49: Hoare triple {5173#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {5170#false} is VALID [2020-07-08 16:17:27,279 INFO L280 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2020-07-08 16:17:27,281 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 16:17:27,281 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:27,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439869297] [2020-07-08 16:17:27,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:27,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:27,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748975636] [2020-07-08 16:17:27,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-08 16:17:27,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:27,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:27,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:27,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:27,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:27,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:27,327 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-08 16:17:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:28,013 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-08 16:17:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:28,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-08 16:17:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 16:17:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 16:17:28,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-08 16:17:28,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:28,163 INFO L225 Difference]: With dead ends: 399 [2020-07-08 16:17:28,164 INFO L226 Difference]: Without dead ends: 397 [2020-07-08 16:17:28,164 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 16:17:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-08 16:17:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-08 16:17:28,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:28,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 323 states. [2020-07-08 16:17:28,522 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 323 states. [2020-07-08 16:17:28,522 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 323 states. [2020-07-08 16:17:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:28,540 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-08 16:17:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-08 16:17:28,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:28,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:28,542 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 397 states. [2020-07-08 16:17:28,543 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 397 states. [2020-07-08 16:17:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:28,557 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-08 16:17:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-08 16:17:28,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:28,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:28,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:28,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-08 16:17:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-08 16:17:28,569 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-08 16:17:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:28,569 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-08 16:17:28,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:28,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 422 transitions. [2020-07-08 16:17:29,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-08 16:17:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 16:17:29,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:29,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:29,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 16:17:29,043 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-08 16:17:29,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:29,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514649207] [2020-07-08 16:17:29,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:29,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-08 16:17:29,098 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-08 16:17:29,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {7414#true} call ULTIMATE.init(); {7414#true} is VALID [2020-07-08 16:17:29,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-08 16:17:29,098 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-08 16:17:29,099 INFO L263 TraceCheckUtils]: 3: Hoare triple {7414#true} call #t~ret7 := main(); {7414#true} is VALID [2020-07-08 16:17:29,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {7414#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {7414#true} ~p1~0 := #t~nondet0; {7414#true} is VALID [2020-07-08 16:17:29,099 INFO L280 TraceCheckUtils]: 6: Hoare triple {7414#true} havoc #t~nondet0; {7414#true} is VALID [2020-07-08 16:17:29,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {7414#true} havoc ~lk1~0; {7414#true} is VALID [2020-07-08 16:17:29,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {7414#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {7414#true} ~p2~0 := #t~nondet1; {7414#true} is VALID [2020-07-08 16:17:29,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {7414#true} havoc #t~nondet1; {7414#true} is VALID [2020-07-08 16:17:29,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {7414#true} havoc ~lk2~0; {7414#true} is VALID [2020-07-08 16:17:29,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {7414#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {7414#true} ~p3~0 := #t~nondet2; {7414#true} is VALID [2020-07-08 16:17:29,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {7414#true} havoc #t~nondet2; {7414#true} is VALID [2020-07-08 16:17:29,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {7414#true} havoc ~lk3~0; {7414#true} is VALID [2020-07-08 16:17:29,101 INFO L280 TraceCheckUtils]: 16: Hoare triple {7414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,102 INFO L280 TraceCheckUtils]: 17: Hoare triple {7414#true} ~p4~0 := #t~nondet3; {7414#true} is VALID [2020-07-08 16:17:29,102 INFO L280 TraceCheckUtils]: 18: Hoare triple {7414#true} havoc #t~nondet3; {7414#true} is VALID [2020-07-08 16:17:29,102 INFO L280 TraceCheckUtils]: 19: Hoare triple {7414#true} havoc ~lk4~0; {7414#true} is VALID [2020-07-08 16:17:29,102 INFO L280 TraceCheckUtils]: 20: Hoare triple {7414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,102 INFO L280 TraceCheckUtils]: 21: Hoare triple {7414#true} ~p5~0 := #t~nondet4; {7414#true} is VALID [2020-07-08 16:17:29,103 INFO L280 TraceCheckUtils]: 22: Hoare triple {7414#true} havoc #t~nondet4; {7414#true} is VALID [2020-07-08 16:17:29,103 INFO L280 TraceCheckUtils]: 23: Hoare triple {7414#true} havoc ~lk5~0; {7414#true} is VALID [2020-07-08 16:17:29,103 INFO L280 TraceCheckUtils]: 24: Hoare triple {7414#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,103 INFO L280 TraceCheckUtils]: 25: Hoare triple {7414#true} ~p6~0 := #t~nondet5; {7414#true} is VALID [2020-07-08 16:17:29,103 INFO L280 TraceCheckUtils]: 26: Hoare triple {7414#true} havoc #t~nondet5; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 27: Hoare triple {7414#true} havoc ~lk6~0; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 28: Hoare triple {7414#true} havoc ~cond~0; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 29: Hoare triple {7414#true} assume !false; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 30: Hoare triple {7414#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 31: Hoare triple {7414#true} ~cond~0 := #t~nondet6; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 32: Hoare triple {7414#true} havoc #t~nondet6; {7414#true} is VALID [2020-07-08 16:17:29,104 INFO L280 TraceCheckUtils]: 33: Hoare triple {7414#true} assume !(0 == ~cond~0); {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 34: Hoare triple {7414#true} ~lk1~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 35: Hoare triple {7414#true} ~lk2~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 36: Hoare triple {7414#true} ~lk3~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 37: Hoare triple {7414#true} ~lk4~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 38: Hoare triple {7414#true} ~lk5~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,105 INFO L280 TraceCheckUtils]: 39: Hoare triple {7414#true} ~lk6~0 := 0; {7414#true} is VALID [2020-07-08 16:17:29,106 INFO L280 TraceCheckUtils]: 40: Hoare triple {7414#true} assume !(0 != ~p1~0); {7414#true} is VALID [2020-07-08 16:17:29,106 INFO L280 TraceCheckUtils]: 41: Hoare triple {7414#true} assume !(0 != ~p2~0); {7414#true} is VALID [2020-07-08 16:17:29,106 INFO L280 TraceCheckUtils]: 42: Hoare triple {7414#true} assume 0 != ~p3~0; {7414#true} is VALID [2020-07-08 16:17:29,107 INFO L280 TraceCheckUtils]: 43: Hoare triple {7414#true} ~lk3~0 := 1; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,108 INFO L280 TraceCheckUtils]: 44: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,108 INFO L280 TraceCheckUtils]: 45: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,108 INFO L280 TraceCheckUtils]: 46: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,109 INFO L280 TraceCheckUtils]: 47: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,109 INFO L280 TraceCheckUtils]: 48: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,110 INFO L280 TraceCheckUtils]: 49: Hoare triple {7418#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:29,110 INFO L280 TraceCheckUtils]: 50: Hoare triple {7418#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7415#false} is VALID [2020-07-08 16:17:29,111 INFO L280 TraceCheckUtils]: 51: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2020-07-08 16:17:29,112 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 16:17:29,113 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:29,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514649207] [2020-07-08 16:17:29,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:29,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:29,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813192825] [2020-07-08 16:17:29,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-08 16:17:29,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:29,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:29,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:29,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:29,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:29,168 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-08 16:17:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:29,833 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-08 16:17:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:29,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-08 16:17:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-08 16:17:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-08 16:17:29,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-08 16:17:29,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:29,952 INFO L225 Difference]: With dead ends: 395 [2020-07-08 16:17:29,952 INFO L226 Difference]: Without dead ends: 393 [2020-07-08 16:17:29,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-08 16:17:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-08 16:17:30,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:30,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand 323 states. [2020-07-08 16:17:30,419 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand 323 states. [2020-07-08 16:17:30,420 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 323 states. [2020-07-08 16:17:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:30,434 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-08 16:17:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-08 16:17:30,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:30,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:30,435 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 393 states. [2020-07-08 16:17:30,435 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 393 states. [2020-07-08 16:17:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:30,449 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-08 16:17:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-08 16:17:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:30,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:30,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:30,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-08 16:17:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-08 16:17:30,460 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-08 16:17:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:30,460 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-08 16:17:30,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:30,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 418 transitions. [2020-07-08 16:17:30,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-08 16:17:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 16:17:30,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:30,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:17:30,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 16:17:30,903 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-08 16:17:30,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:30,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307044915] [2020-07-08 16:17:30,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:30,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-08 16:17:30,937 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-08 16:17:30,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {9643#true} call ULTIMATE.init(); {9643#true} is VALID [2020-07-08 16:17:30,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-08 16:17:30,938 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-08 16:17:30,938 INFO L263 TraceCheckUtils]: 3: Hoare triple {9643#true} call #t~ret7 := main(); {9643#true} is VALID [2020-07-08 16:17:30,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {9643#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {9643#true} ~p1~0 := #t~nondet0; {9643#true} is VALID [2020-07-08 16:17:30,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {9643#true} havoc #t~nondet0; {9643#true} is VALID [2020-07-08 16:17:30,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {9643#true} havoc ~lk1~0; {9643#true} is VALID [2020-07-08 16:17:30,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {9643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {9643#true} ~p2~0 := #t~nondet1; {9643#true} is VALID [2020-07-08 16:17:30,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {9643#true} havoc #t~nondet1; {9643#true} is VALID [2020-07-08 16:17:30,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {9643#true} havoc ~lk2~0; {9643#true} is VALID [2020-07-08 16:17:30,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {9643#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {9643#true} ~p3~0 := #t~nondet2; {9643#true} is VALID [2020-07-08 16:17:30,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {9643#true} havoc #t~nondet2; {9643#true} is VALID [2020-07-08 16:17:30,940 INFO L280 TraceCheckUtils]: 15: Hoare triple {9643#true} havoc ~lk3~0; {9643#true} is VALID [2020-07-08 16:17:30,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {9643#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,941 INFO L280 TraceCheckUtils]: 17: Hoare triple {9643#true} ~p4~0 := #t~nondet3; {9643#true} is VALID [2020-07-08 16:17:30,941 INFO L280 TraceCheckUtils]: 18: Hoare triple {9643#true} havoc #t~nondet3; {9643#true} is VALID [2020-07-08 16:17:30,941 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#true} havoc ~lk4~0; {9643#true} is VALID [2020-07-08 16:17:30,941 INFO L280 TraceCheckUtils]: 20: Hoare triple {9643#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,942 INFO L280 TraceCheckUtils]: 21: Hoare triple {9643#true} ~p5~0 := #t~nondet4; {9643#true} is VALID [2020-07-08 16:17:30,942 INFO L280 TraceCheckUtils]: 22: Hoare triple {9643#true} havoc #t~nondet4; {9643#true} is VALID [2020-07-08 16:17:30,942 INFO L280 TraceCheckUtils]: 23: Hoare triple {9643#true} havoc ~lk5~0; {9643#true} is VALID [2020-07-08 16:17:30,942 INFO L280 TraceCheckUtils]: 24: Hoare triple {9643#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,942 INFO L280 TraceCheckUtils]: 25: Hoare triple {9643#true} ~p6~0 := #t~nondet5; {9643#true} is VALID [2020-07-08 16:17:30,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {9643#true} havoc #t~nondet5; {9643#true} is VALID [2020-07-08 16:17:30,943 INFO L280 TraceCheckUtils]: 27: Hoare triple {9643#true} havoc ~lk6~0; {9643#true} is VALID [2020-07-08 16:17:30,943 INFO L280 TraceCheckUtils]: 28: Hoare triple {9643#true} havoc ~cond~0; {9643#true} is VALID [2020-07-08 16:17:30,943 INFO L280 TraceCheckUtils]: 29: Hoare triple {9643#true} assume !false; {9643#true} is VALID [2020-07-08 16:17:30,944 INFO L280 TraceCheckUtils]: 30: Hoare triple {9643#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9643#true} is VALID [2020-07-08 16:17:30,944 INFO L280 TraceCheckUtils]: 31: Hoare triple {9643#true} ~cond~0 := #t~nondet6; {9643#true} is VALID [2020-07-08 16:17:30,944 INFO L280 TraceCheckUtils]: 32: Hoare triple {9643#true} havoc #t~nondet6; {9643#true} is VALID [2020-07-08 16:17:30,944 INFO L280 TraceCheckUtils]: 33: Hoare triple {9643#true} assume !(0 == ~cond~0); {9643#true} is VALID [2020-07-08 16:17:30,944 INFO L280 TraceCheckUtils]: 34: Hoare triple {9643#true} ~lk1~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,945 INFO L280 TraceCheckUtils]: 35: Hoare triple {9643#true} ~lk2~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,945 INFO L280 TraceCheckUtils]: 36: Hoare triple {9643#true} ~lk3~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,945 INFO L280 TraceCheckUtils]: 37: Hoare triple {9643#true} ~lk4~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,945 INFO L280 TraceCheckUtils]: 38: Hoare triple {9643#true} ~lk5~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,946 INFO L280 TraceCheckUtils]: 39: Hoare triple {9643#true} ~lk6~0 := 0; {9643#true} is VALID [2020-07-08 16:17:30,946 INFO L280 TraceCheckUtils]: 40: Hoare triple {9643#true} assume !(0 != ~p1~0); {9643#true} is VALID [2020-07-08 16:17:30,946 INFO L280 TraceCheckUtils]: 41: Hoare triple {9643#true} assume !(0 != ~p2~0); {9643#true} is VALID [2020-07-08 16:17:30,946 INFO L280 TraceCheckUtils]: 42: Hoare triple {9643#true} assume !(0 != ~p3~0); {9643#true} is VALID [2020-07-08 16:17:30,948 INFO L280 TraceCheckUtils]: 43: Hoare triple {9643#true} assume !(0 != ~p4~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,948 INFO L280 TraceCheckUtils]: 44: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,949 INFO L280 TraceCheckUtils]: 45: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,949 INFO L280 TraceCheckUtils]: 46: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,950 INFO L280 TraceCheckUtils]: 47: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,950 INFO L280 TraceCheckUtils]: 48: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:30,951 INFO L280 TraceCheckUtils]: 49: Hoare triple {9647#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9644#false} is VALID [2020-07-08 16:17:30,951 INFO L280 TraceCheckUtils]: 50: Hoare triple {9644#false} assume 1 != ~lk4~0; {9644#false} is VALID [2020-07-08 16:17:30,951 INFO L280 TraceCheckUtils]: 51: Hoare triple {9644#false} assume !false; {9644#false} is VALID [2020-07-08 16:17:30,953 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 16:17:30,954 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:30,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307044915] [2020-07-08 16:17:30,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:30,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:30,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539331144] [2020-07-08 16:17:30,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-08 16:17:30,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:30,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:30,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:30,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:30,998 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-08 16:17:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:32,359 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-08 16:17:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:32,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-08 16:17:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-08 16:17:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-08 16:17:32,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2020-07-08 16:17:32,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:32,549 INFO L225 Difference]: With dead ends: 887 [2020-07-08 16:17:32,549 INFO L226 Difference]: Without dead ends: 593 [2020-07-08 16:17:32,555 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 16:17:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-08 16:17:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-08 16:17:33,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:33,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand 591 states. [2020-07-08 16:17:33,499 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand 591 states. [2020-07-08 16:17:33,499 INFO L87 Difference]: Start difference. First operand 593 states. Second operand 591 states. [2020-07-08 16:17:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:33,530 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-08 16:17:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-08 16:17:33,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:33,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:33,532 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 593 states. [2020-07-08 16:17:33,532 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 593 states. [2020-07-08 16:17:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:33,563 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-08 16:17:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-08 16:17:33,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:33,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:33,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:33,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-08 16:17:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-08 16:17:33,599 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-08 16:17:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:33,600 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-08 16:17:33,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:33,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 758 transitions. [2020-07-08 16:17:34,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-08 16:17:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 16:17:34,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:34,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:34,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 16:17:34,397 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-08 16:17:34,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:34,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017214192] [2020-07-08 16:17:34,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:34,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-08 16:17:34,437 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-08 16:17:34,438 INFO L263 TraceCheckUtils]: 0: Hoare triple {13792#true} call ULTIMATE.init(); {13792#true} is VALID [2020-07-08 16:17:34,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-08 16:17:34,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-08 16:17:34,438 INFO L263 TraceCheckUtils]: 3: Hoare triple {13792#true} call #t~ret7 := main(); {13792#true} is VALID [2020-07-08 16:17:34,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {13792#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {13792#true} ~p1~0 := #t~nondet0; {13792#true} is VALID [2020-07-08 16:17:34,439 INFO L280 TraceCheckUtils]: 6: Hoare triple {13792#true} havoc #t~nondet0; {13792#true} is VALID [2020-07-08 16:17:34,439 INFO L280 TraceCheckUtils]: 7: Hoare triple {13792#true} havoc ~lk1~0; {13792#true} is VALID [2020-07-08 16:17:34,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {13792#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,440 INFO L280 TraceCheckUtils]: 9: Hoare triple {13792#true} ~p2~0 := #t~nondet1; {13792#true} is VALID [2020-07-08 16:17:34,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {13792#true} havoc #t~nondet1; {13792#true} is VALID [2020-07-08 16:17:34,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {13792#true} havoc ~lk2~0; {13792#true} is VALID [2020-07-08 16:17:34,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {13792#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {13792#true} ~p3~0 := #t~nondet2; {13792#true} is VALID [2020-07-08 16:17:34,441 INFO L280 TraceCheckUtils]: 14: Hoare triple {13792#true} havoc #t~nondet2; {13792#true} is VALID [2020-07-08 16:17:34,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {13792#true} havoc ~lk3~0; {13792#true} is VALID [2020-07-08 16:17:34,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {13792#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,441 INFO L280 TraceCheckUtils]: 17: Hoare triple {13792#true} ~p4~0 := #t~nondet3; {13792#true} is VALID [2020-07-08 16:17:34,441 INFO L280 TraceCheckUtils]: 18: Hoare triple {13792#true} havoc #t~nondet3; {13792#true} is VALID [2020-07-08 16:17:34,442 INFO L280 TraceCheckUtils]: 19: Hoare triple {13792#true} havoc ~lk4~0; {13792#true} is VALID [2020-07-08 16:17:34,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {13792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,442 INFO L280 TraceCheckUtils]: 21: Hoare triple {13792#true} ~p5~0 := #t~nondet4; {13792#true} is VALID [2020-07-08 16:17:34,442 INFO L280 TraceCheckUtils]: 22: Hoare triple {13792#true} havoc #t~nondet4; {13792#true} is VALID [2020-07-08 16:17:34,442 INFO L280 TraceCheckUtils]: 23: Hoare triple {13792#true} havoc ~lk5~0; {13792#true} is VALID [2020-07-08 16:17:34,443 INFO L280 TraceCheckUtils]: 24: Hoare triple {13792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,443 INFO L280 TraceCheckUtils]: 25: Hoare triple {13792#true} ~p6~0 := #t~nondet5; {13792#true} is VALID [2020-07-08 16:17:34,443 INFO L280 TraceCheckUtils]: 26: Hoare triple {13792#true} havoc #t~nondet5; {13792#true} is VALID [2020-07-08 16:17:34,443 INFO L280 TraceCheckUtils]: 27: Hoare triple {13792#true} havoc ~lk6~0; {13792#true} is VALID [2020-07-08 16:17:34,443 INFO L280 TraceCheckUtils]: 28: Hoare triple {13792#true} havoc ~cond~0; {13792#true} is VALID [2020-07-08 16:17:34,444 INFO L280 TraceCheckUtils]: 29: Hoare triple {13792#true} assume !false; {13792#true} is VALID [2020-07-08 16:17:34,444 INFO L280 TraceCheckUtils]: 30: Hoare triple {13792#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13792#true} is VALID [2020-07-08 16:17:34,444 INFO L280 TraceCheckUtils]: 31: Hoare triple {13792#true} ~cond~0 := #t~nondet6; {13792#true} is VALID [2020-07-08 16:17:34,444 INFO L280 TraceCheckUtils]: 32: Hoare triple {13792#true} havoc #t~nondet6; {13792#true} is VALID [2020-07-08 16:17:34,444 INFO L280 TraceCheckUtils]: 33: Hoare triple {13792#true} assume !(0 == ~cond~0); {13792#true} is VALID [2020-07-08 16:17:34,445 INFO L280 TraceCheckUtils]: 34: Hoare triple {13792#true} ~lk1~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,445 INFO L280 TraceCheckUtils]: 35: Hoare triple {13792#true} ~lk2~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,445 INFO L280 TraceCheckUtils]: 36: Hoare triple {13792#true} ~lk3~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,445 INFO L280 TraceCheckUtils]: 37: Hoare triple {13792#true} ~lk4~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,445 INFO L280 TraceCheckUtils]: 38: Hoare triple {13792#true} ~lk5~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,446 INFO L280 TraceCheckUtils]: 39: Hoare triple {13792#true} ~lk6~0 := 0; {13792#true} is VALID [2020-07-08 16:17:34,446 INFO L280 TraceCheckUtils]: 40: Hoare triple {13792#true} assume !(0 != ~p1~0); {13792#true} is VALID [2020-07-08 16:17:34,446 INFO L280 TraceCheckUtils]: 41: Hoare triple {13792#true} assume !(0 != ~p2~0); {13792#true} is VALID [2020-07-08 16:17:34,446 INFO L280 TraceCheckUtils]: 42: Hoare triple {13792#true} assume !(0 != ~p3~0); {13792#true} is VALID [2020-07-08 16:17:34,447 INFO L280 TraceCheckUtils]: 43: Hoare triple {13792#true} assume 0 != ~p4~0; {13792#true} is VALID [2020-07-08 16:17:34,451 INFO L280 TraceCheckUtils]: 44: Hoare triple {13792#true} ~lk4~0 := 1; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,451 INFO L280 TraceCheckUtils]: 45: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,451 INFO L280 TraceCheckUtils]: 46: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,452 INFO L280 TraceCheckUtils]: 47: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,452 INFO L280 TraceCheckUtils]: 48: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,453 INFO L280 TraceCheckUtils]: 49: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,453 INFO L280 TraceCheckUtils]: 50: Hoare triple {13796#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:34,453 INFO L280 TraceCheckUtils]: 51: Hoare triple {13796#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {13793#false} is VALID [2020-07-08 16:17:34,454 INFO L280 TraceCheckUtils]: 52: Hoare triple {13793#false} assume !false; {13793#false} is VALID [2020-07-08 16:17:34,455 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 16:17:34,455 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:34,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017214192] [2020-07-08 16:17:34,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:34,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:34,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157199126] [2020-07-08 16:17:34,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-08 16:17:34,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:34,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:34,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:34,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:34,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:34,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:34,510 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-08 16:17:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:35,971 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-08 16:17:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:35,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-08 16:17:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 16:17:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 16:17:35,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 16:17:36,085 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 16:17:36,122 INFO L225 Difference]: With dead ends: 715 [2020-07-08 16:17:36,122 INFO L226 Difference]: Without dead ends: 713 [2020-07-08 16:17:36,123 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 16:17:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-08 16:17:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-08 16:17:37,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:37,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand 591 states. [2020-07-08 16:17:37,149 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand 591 states. [2020-07-08 16:17:37,149 INFO L87 Difference]: Start difference. First operand 713 states. Second operand 591 states. [2020-07-08 16:17:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:37,189 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-08 16:17:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-08 16:17:37,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:37,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:37,191 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 713 states. [2020-07-08 16:17:37,191 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 713 states. [2020-07-08 16:17:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:37,221 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-08 16:17:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-08 16:17:37,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:37,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:37,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:37,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-08 16:17:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-08 16:17:37,248 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-08 16:17:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:37,248 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-08 16:17:37,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:37,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 750 transitions. [2020-07-08 16:17:38,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-08 16:17:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 16:17:38,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:38,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:38,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 16:17:38,104 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-08 16:17:38,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:38,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304642229] [2020-07-08 16:17:38,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:38,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-08 16:17:38,177 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-08 16:17:38,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {17837#true} call ULTIMATE.init(); {17837#true} is VALID [2020-07-08 16:17:38,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-08 16:17:38,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-08 16:17:38,178 INFO L263 TraceCheckUtils]: 3: Hoare triple {17837#true} call #t~ret7 := main(); {17837#true} is VALID [2020-07-08 16:17:38,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {17837#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {17837#true} ~p1~0 := #t~nondet0; {17837#true} is VALID [2020-07-08 16:17:38,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {17837#true} havoc #t~nondet0; {17837#true} is VALID [2020-07-08 16:17:38,179 INFO L280 TraceCheckUtils]: 7: Hoare triple {17837#true} havoc ~lk1~0; {17837#true} is VALID [2020-07-08 16:17:38,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {17837#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {17837#true} ~p2~0 := #t~nondet1; {17837#true} is VALID [2020-07-08 16:17:38,179 INFO L280 TraceCheckUtils]: 10: Hoare triple {17837#true} havoc #t~nondet1; {17837#true} is VALID [2020-07-08 16:17:38,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {17837#true} havoc ~lk2~0; {17837#true} is VALID [2020-07-08 16:17:38,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {17837#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {17837#true} ~p3~0 := #t~nondet2; {17837#true} is VALID [2020-07-08 16:17:38,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {17837#true} havoc #t~nondet2; {17837#true} is VALID [2020-07-08 16:17:38,180 INFO L280 TraceCheckUtils]: 15: Hoare triple {17837#true} havoc ~lk3~0; {17837#true} is VALID [2020-07-08 16:17:38,180 INFO L280 TraceCheckUtils]: 16: Hoare triple {17837#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {17837#true} ~p4~0 := #t~nondet3; {17837#true} is VALID [2020-07-08 16:17:38,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {17837#true} havoc #t~nondet3; {17837#true} is VALID [2020-07-08 16:17:38,181 INFO L280 TraceCheckUtils]: 19: Hoare triple {17837#true} havoc ~lk4~0; {17837#true} is VALID [2020-07-08 16:17:38,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {17837#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {17837#true} ~p5~0 := #t~nondet4; {17837#true} is VALID [2020-07-08 16:17:38,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {17837#true} havoc #t~nondet4; {17837#true} is VALID [2020-07-08 16:17:38,182 INFO L280 TraceCheckUtils]: 23: Hoare triple {17837#true} havoc ~lk5~0; {17837#true} is VALID [2020-07-08 16:17:38,182 INFO L280 TraceCheckUtils]: 24: Hoare triple {17837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,182 INFO L280 TraceCheckUtils]: 25: Hoare triple {17837#true} ~p6~0 := #t~nondet5; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 26: Hoare triple {17837#true} havoc #t~nondet5; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 27: Hoare triple {17837#true} havoc ~lk6~0; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 28: Hoare triple {17837#true} havoc ~cond~0; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 29: Hoare triple {17837#true} assume !false; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 30: Hoare triple {17837#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17837#true} is VALID [2020-07-08 16:17:38,183 INFO L280 TraceCheckUtils]: 31: Hoare triple {17837#true} ~cond~0 := #t~nondet6; {17837#true} is VALID [2020-07-08 16:17:38,184 INFO L280 TraceCheckUtils]: 32: Hoare triple {17837#true} havoc #t~nondet6; {17837#true} is VALID [2020-07-08 16:17:38,184 INFO L280 TraceCheckUtils]: 33: Hoare triple {17837#true} assume !(0 == ~cond~0); {17837#true} is VALID [2020-07-08 16:17:38,184 INFO L280 TraceCheckUtils]: 34: Hoare triple {17837#true} ~lk1~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,184 INFO L280 TraceCheckUtils]: 35: Hoare triple {17837#true} ~lk2~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,185 INFO L280 TraceCheckUtils]: 36: Hoare triple {17837#true} ~lk3~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,185 INFO L280 TraceCheckUtils]: 37: Hoare triple {17837#true} ~lk4~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,185 INFO L280 TraceCheckUtils]: 38: Hoare triple {17837#true} ~lk5~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,185 INFO L280 TraceCheckUtils]: 39: Hoare triple {17837#true} ~lk6~0 := 0; {17837#true} is VALID [2020-07-08 16:17:38,185 INFO L280 TraceCheckUtils]: 40: Hoare triple {17837#true} assume !(0 != ~p1~0); {17837#true} is VALID [2020-07-08 16:17:38,186 INFO L280 TraceCheckUtils]: 41: Hoare triple {17837#true} assume !(0 != ~p2~0); {17837#true} is VALID [2020-07-08 16:17:38,186 INFO L280 TraceCheckUtils]: 42: Hoare triple {17837#true} assume !(0 != ~p3~0); {17837#true} is VALID [2020-07-08 16:17:38,186 INFO L280 TraceCheckUtils]: 43: Hoare triple {17837#true} assume !(0 != ~p4~0); {17837#true} is VALID [2020-07-08 16:17:38,187 INFO L280 TraceCheckUtils]: 44: Hoare triple {17837#true} assume !(0 != ~p5~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,188 INFO L280 TraceCheckUtils]: 45: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,189 INFO L280 TraceCheckUtils]: 46: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,190 INFO L280 TraceCheckUtils]: 47: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,190 INFO L280 TraceCheckUtils]: 48: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,191 INFO L280 TraceCheckUtils]: 49: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:38,192 INFO L280 TraceCheckUtils]: 50: Hoare triple {17841#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17838#false} is VALID [2020-07-08 16:17:38,192 INFO L280 TraceCheckUtils]: 51: Hoare triple {17838#false} assume 1 != ~lk5~0; {17838#false} is VALID [2020-07-08 16:17:38,192 INFO L280 TraceCheckUtils]: 52: Hoare triple {17838#false} assume !false; {17838#false} is VALID [2020-07-08 16:17:38,194 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 16:17:38,194 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:38,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304642229] [2020-07-08 16:17:38,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:38,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:38,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57720822] [2020-07-08 16:17:38,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-08 16:17:38,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:38,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:38,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:38,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:38,248 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-08 16:17:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:40,880 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-08 16:17:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:40,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-08 16:17:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-08 16:17:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-08 16:17:40,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2020-07-08 16:17:41,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:41,115 INFO L225 Difference]: With dead ends: 1667 [2020-07-08 16:17:41,115 INFO L226 Difference]: Without dead ends: 1105 [2020-07-08 16:17:41,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-08 16:17:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-08 16:17:43,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:43,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1105 states. Second operand 1103 states. [2020-07-08 16:17:43,282 INFO L74 IsIncluded]: Start isIncluded. First operand 1105 states. Second operand 1103 states. [2020-07-08 16:17:43,282 INFO L87 Difference]: Start difference. First operand 1105 states. Second operand 1103 states. [2020-07-08 16:17:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:43,321 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-08 16:17:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-08 16:17:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:43,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:43,323 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1105 states. [2020-07-08 16:17:43,323 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1105 states. [2020-07-08 16:17:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:43,371 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-08 16:17:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-08 16:17:43,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:43,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:43,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:43,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-08 16:17:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-08 16:17:43,440 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-08 16:17:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:43,440 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-08 16:17:43,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:43,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1374 transitions. [2020-07-08 16:17:45,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1374 edges. 1374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-08 16:17:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 16:17:45,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:45,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:45,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 16:17:45,289 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:45,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-08 16:17:45,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:45,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283004633] [2020-07-08 16:17:45,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:45,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-08 16:17:45,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-08 16:17:45,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {25594#true} call ULTIMATE.init(); {25594#true} is VALID [2020-07-08 16:17:45,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-08 16:17:45,366 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-08 16:17:45,367 INFO L263 TraceCheckUtils]: 3: Hoare triple {25594#true} call #t~ret7 := main(); {25594#true} is VALID [2020-07-08 16:17:45,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {25594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {25594#true} ~p1~0 := #t~nondet0; {25594#true} is VALID [2020-07-08 16:17:45,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {25594#true} havoc #t~nondet0; {25594#true} is VALID [2020-07-08 16:17:45,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {25594#true} havoc ~lk1~0; {25594#true} is VALID [2020-07-08 16:17:45,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {25594#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {25594#true} ~p2~0 := #t~nondet1; {25594#true} is VALID [2020-07-08 16:17:45,368 INFO L280 TraceCheckUtils]: 10: Hoare triple {25594#true} havoc #t~nondet1; {25594#true} is VALID [2020-07-08 16:17:45,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {25594#true} havoc ~lk2~0; {25594#true} is VALID [2020-07-08 16:17:45,368 INFO L280 TraceCheckUtils]: 12: Hoare triple {25594#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {25594#true} ~p3~0 := #t~nondet2; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 14: Hoare triple {25594#true} havoc #t~nondet2; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 15: Hoare triple {25594#true} havoc ~lk3~0; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 16: Hoare triple {25594#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 17: Hoare triple {25594#true} ~p4~0 := #t~nondet3; {25594#true} is VALID [2020-07-08 16:17:45,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {25594#true} havoc #t~nondet3; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {25594#true} havoc ~lk4~0; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 20: Hoare triple {25594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 21: Hoare triple {25594#true} ~p5~0 := #t~nondet4; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 22: Hoare triple {25594#true} havoc #t~nondet4; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 23: Hoare triple {25594#true} havoc ~lk5~0; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 24: Hoare triple {25594#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,370 INFO L280 TraceCheckUtils]: 25: Hoare triple {25594#true} ~p6~0 := #t~nondet5; {25594#true} is VALID [2020-07-08 16:17:45,371 INFO L280 TraceCheckUtils]: 26: Hoare triple {25594#true} havoc #t~nondet5; {25594#true} is VALID [2020-07-08 16:17:45,371 INFO L280 TraceCheckUtils]: 27: Hoare triple {25594#true} havoc ~lk6~0; {25594#true} is VALID [2020-07-08 16:17:45,371 INFO L280 TraceCheckUtils]: 28: Hoare triple {25594#true} havoc ~cond~0; {25594#true} is VALID [2020-07-08 16:17:45,371 INFO L280 TraceCheckUtils]: 29: Hoare triple {25594#true} assume !false; {25594#true} is VALID [2020-07-08 16:17:45,371 INFO L280 TraceCheckUtils]: 30: Hoare triple {25594#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {25594#true} is VALID [2020-07-08 16:17:45,372 INFO L280 TraceCheckUtils]: 31: Hoare triple {25594#true} ~cond~0 := #t~nondet6; {25594#true} is VALID [2020-07-08 16:17:45,372 INFO L280 TraceCheckUtils]: 32: Hoare triple {25594#true} havoc #t~nondet6; {25594#true} is VALID [2020-07-08 16:17:45,372 INFO L280 TraceCheckUtils]: 33: Hoare triple {25594#true} assume !(0 == ~cond~0); {25594#true} is VALID [2020-07-08 16:17:45,372 INFO L280 TraceCheckUtils]: 34: Hoare triple {25594#true} ~lk1~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,372 INFO L280 TraceCheckUtils]: 35: Hoare triple {25594#true} ~lk2~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,373 INFO L280 TraceCheckUtils]: 36: Hoare triple {25594#true} ~lk3~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,373 INFO L280 TraceCheckUtils]: 37: Hoare triple {25594#true} ~lk4~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,373 INFO L280 TraceCheckUtils]: 38: Hoare triple {25594#true} ~lk5~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,373 INFO L280 TraceCheckUtils]: 39: Hoare triple {25594#true} ~lk6~0 := 0; {25594#true} is VALID [2020-07-08 16:17:45,373 INFO L280 TraceCheckUtils]: 40: Hoare triple {25594#true} assume !(0 != ~p1~0); {25594#true} is VALID [2020-07-08 16:17:45,374 INFO L280 TraceCheckUtils]: 41: Hoare triple {25594#true} assume !(0 != ~p2~0); {25594#true} is VALID [2020-07-08 16:17:45,374 INFO L280 TraceCheckUtils]: 42: Hoare triple {25594#true} assume !(0 != ~p3~0); {25594#true} is VALID [2020-07-08 16:17:45,374 INFO L280 TraceCheckUtils]: 43: Hoare triple {25594#true} assume !(0 != ~p4~0); {25594#true} is VALID [2020-07-08 16:17:45,374 INFO L280 TraceCheckUtils]: 44: Hoare triple {25594#true} assume 0 != ~p5~0; {25594#true} is VALID [2020-07-08 16:17:45,376 INFO L280 TraceCheckUtils]: 45: Hoare triple {25594#true} ~lk5~0 := 1; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,378 INFO L280 TraceCheckUtils]: 46: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,379 INFO L280 TraceCheckUtils]: 47: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,380 INFO L280 TraceCheckUtils]: 48: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,380 INFO L280 TraceCheckUtils]: 49: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,381 INFO L280 TraceCheckUtils]: 50: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,381 INFO L280 TraceCheckUtils]: 51: Hoare triple {25598#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:45,382 INFO L280 TraceCheckUtils]: 52: Hoare triple {25598#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {25595#false} is VALID [2020-07-08 16:17:45,382 INFO L280 TraceCheckUtils]: 53: Hoare triple {25595#false} assume !false; {25595#false} is VALID [2020-07-08 16:17:45,384 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 16:17:45,384 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:45,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283004633] [2020-07-08 16:17:45,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:45,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:45,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248108487] [2020-07-08 16:17:45,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-08 16:17:45,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:45,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:45,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:45,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:45,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:45,436 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-08 16:17:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:48,428 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-08 16:17:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:48,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-08 16:17:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 16:17:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-08 16:17:48,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-08 16:17:48,547 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 16:17:48,611 INFO L225 Difference]: With dead ends: 1315 [2020-07-08 16:17:48,611 INFO L226 Difference]: Without dead ends: 1313 [2020-07-08 16:17:48,612 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 16:17:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-08 16:17:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-08 16:17:51,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:51,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand 1103 states. [2020-07-08 16:17:51,017 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand 1103 states. [2020-07-08 16:17:51,017 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand 1103 states. [2020-07-08 16:17:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:51,070 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-08 16:17:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-08 16:17:51,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:51,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:51,073 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1313 states. [2020-07-08 16:17:51,073 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1313 states. [2020-07-08 16:17:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:51,138 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-08 16:17:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-08 16:17:51,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:51,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:51,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:51,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-08 16:17:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-08 16:17:51,180 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-08 16:17:51,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:51,180 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-08 16:17:51,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:51,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1358 transitions. [2020-07-08 16:17:52,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1358 edges. 1358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-08 16:17:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 16:17:52,851 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:52,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:52,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 16:17:52,852 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-08 16:17:52,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:52,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064963940] [2020-07-08 16:17:52,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:52,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-08 16:17:52,901 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-08 16:17:52,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2020-07-08 16:17:52,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-08 16:17:52,902 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-08 16:17:52,902 INFO L263 TraceCheckUtils]: 3: Hoare triple {33063#true} call #t~ret7 := main(); {33063#true} is VALID [2020-07-08 16:17:52,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {33063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {33063#true} ~p1~0 := #t~nondet0; {33063#true} is VALID [2020-07-08 16:17:52,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {33063#true} havoc #t~nondet0; {33063#true} is VALID [2020-07-08 16:17:52,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {33063#true} havoc ~lk1~0; {33063#true} is VALID [2020-07-08 16:17:52,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {33063#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {33063#true} ~p2~0 := #t~nondet1; {33063#true} is VALID [2020-07-08 16:17:52,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {33063#true} havoc #t~nondet1; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {33063#true} havoc ~lk2~0; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {33063#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {33063#true} ~p3~0 := #t~nondet2; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 14: Hoare triple {33063#true} havoc #t~nondet2; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 15: Hoare triple {33063#true} havoc ~lk3~0; {33063#true} is VALID [2020-07-08 16:17:52,904 INFO L280 TraceCheckUtils]: 16: Hoare triple {33063#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {33063#true} ~p4~0 := #t~nondet3; {33063#true} is VALID [2020-07-08 16:17:52,905 INFO L280 TraceCheckUtils]: 18: Hoare triple {33063#true} havoc #t~nondet3; {33063#true} is VALID [2020-07-08 16:17:52,905 INFO L280 TraceCheckUtils]: 19: Hoare triple {33063#true} havoc ~lk4~0; {33063#true} is VALID [2020-07-08 16:17:52,905 INFO L280 TraceCheckUtils]: 20: Hoare triple {33063#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,905 INFO L280 TraceCheckUtils]: 21: Hoare triple {33063#true} ~p5~0 := #t~nondet4; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 22: Hoare triple {33063#true} havoc #t~nondet4; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 23: Hoare triple {33063#true} havoc ~lk5~0; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 24: Hoare triple {33063#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 25: Hoare triple {33063#true} ~p6~0 := #t~nondet5; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 26: Hoare triple {33063#true} havoc #t~nondet5; {33063#true} is VALID [2020-07-08 16:17:52,906 INFO L280 TraceCheckUtils]: 27: Hoare triple {33063#true} havoc ~lk6~0; {33063#true} is VALID [2020-07-08 16:17:52,907 INFO L280 TraceCheckUtils]: 28: Hoare triple {33063#true} havoc ~cond~0; {33063#true} is VALID [2020-07-08 16:17:52,907 INFO L280 TraceCheckUtils]: 29: Hoare triple {33063#true} assume !false; {33063#true} is VALID [2020-07-08 16:17:52,907 INFO L280 TraceCheckUtils]: 30: Hoare triple {33063#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {33063#true} is VALID [2020-07-08 16:17:52,907 INFO L280 TraceCheckUtils]: 31: Hoare triple {33063#true} ~cond~0 := #t~nondet6; {33063#true} is VALID [2020-07-08 16:17:52,907 INFO L280 TraceCheckUtils]: 32: Hoare triple {33063#true} havoc #t~nondet6; {33063#true} is VALID [2020-07-08 16:17:52,908 INFO L280 TraceCheckUtils]: 33: Hoare triple {33063#true} assume !(0 == ~cond~0); {33063#true} is VALID [2020-07-08 16:17:52,908 INFO L280 TraceCheckUtils]: 34: Hoare triple {33063#true} ~lk1~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,908 INFO L280 TraceCheckUtils]: 35: Hoare triple {33063#true} ~lk2~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,908 INFO L280 TraceCheckUtils]: 36: Hoare triple {33063#true} ~lk3~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,908 INFO L280 TraceCheckUtils]: 37: Hoare triple {33063#true} ~lk4~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 38: Hoare triple {33063#true} ~lk5~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 39: Hoare triple {33063#true} ~lk6~0 := 0; {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 40: Hoare triple {33063#true} assume !(0 != ~p1~0); {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 41: Hoare triple {33063#true} assume !(0 != ~p2~0); {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 42: Hoare triple {33063#true} assume !(0 != ~p3~0); {33063#true} is VALID [2020-07-08 16:17:52,909 INFO L280 TraceCheckUtils]: 43: Hoare triple {33063#true} assume !(0 != ~p4~0); {33063#true} is VALID [2020-07-08 16:17:52,910 INFO L280 TraceCheckUtils]: 44: Hoare triple {33063#true} assume !(0 != ~p5~0); {33063#true} is VALID [2020-07-08 16:17:52,910 INFO L280 TraceCheckUtils]: 45: Hoare triple {33063#true} assume !(0 != ~p6~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,911 INFO L280 TraceCheckUtils]: 46: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,911 INFO L280 TraceCheckUtils]: 47: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,911 INFO L280 TraceCheckUtils]: 48: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,912 INFO L280 TraceCheckUtils]: 49: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,912 INFO L280 TraceCheckUtils]: 50: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-08 16:17:52,913 INFO L280 TraceCheckUtils]: 51: Hoare triple {33067#(= 0 main_~p6~0)} assume 0 != ~p6~0; {33064#false} is VALID [2020-07-08 16:17:52,913 INFO L280 TraceCheckUtils]: 52: Hoare triple {33064#false} assume 1 != ~lk6~0; {33064#false} is VALID [2020-07-08 16:17:52,913 INFO L280 TraceCheckUtils]: 53: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2020-07-08 16:17:52,914 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 16:17:52,914 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:52,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064963940] [2020-07-08 16:17:52,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:52,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:52,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120708937] [2020-07-08 16:17:52,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-08 16:17:52,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:52,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:52,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:52,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:52,964 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-08 16:17:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:58,421 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-08 16:17:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:58,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-08 16:17:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 16:17:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-08 16:17:58,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-08 16:17:58,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:17:58,637 INFO L225 Difference]: With dead ends: 3153 [2020-07-08 16:17:58,637 INFO L226 Difference]: Without dead ends: 1103 [2020-07-08 16:17:58,640 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 16:17:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-08 16:18:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-08 16:18:00,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:18:00,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1103 states. Second operand 1103 states. [2020-07-08 16:18:00,954 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-08 16:18:00,955 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-08 16:18:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:18:00,997 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-08 16:18:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-08 16:18:00,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:18:00,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:18:00,998 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-08 16:18:00,998 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-08 16:18:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:18:01,051 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-08 16:18:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-08 16:18:01,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:18:01,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:18:01,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:18:01,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:18:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-08 16:18:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-08 16:18:01,090 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-08 16:18:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:18:01,090 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-08 16:18:01,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:18:01,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1294 transitions. [2020-07-08 16:18:02,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1294 edges. 1294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:18:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-08 16:18:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 16:18:02,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:18:02,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:02,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 16:18:02,672 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:18:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:18:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-08 16:18:02,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:18:02,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176209446] [2020-07-08 16:18:02,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:18:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:18:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:18:02,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-08 16:18:02,737 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-08 16:18:02,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2020-07-08 16:18:02,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-08 16:18:02,738 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-08 16:18:02,738 INFO L263 TraceCheckUtils]: 3: Hoare triple {43788#true} call #t~ret7 := main(); {43788#true} is VALID [2020-07-08 16:18:02,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {43788#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {43788#true} ~p1~0 := #t~nondet0; {43788#true} is VALID [2020-07-08 16:18:02,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {43788#true} havoc #t~nondet0; {43788#true} is VALID [2020-07-08 16:18:02,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {43788#true} havoc ~lk1~0; {43788#true} is VALID [2020-07-08 16:18:02,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {43788#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {43788#true} ~p2~0 := #t~nondet1; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {43788#true} havoc #t~nondet1; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {43788#true} havoc ~lk2~0; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {43788#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {43788#true} ~p3~0 := #t~nondet2; {43788#true} is VALID [2020-07-08 16:18:02,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {43788#true} havoc #t~nondet2; {43788#true} is VALID [2020-07-08 16:18:02,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {43788#true} havoc ~lk3~0; {43788#true} is VALID [2020-07-08 16:18:02,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {43788#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {43788#true} ~p4~0 := #t~nondet3; {43788#true} is VALID [2020-07-08 16:18:02,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {43788#true} havoc #t~nondet3; {43788#true} is VALID [2020-07-08 16:18:02,741 INFO L280 TraceCheckUtils]: 19: Hoare triple {43788#true} havoc ~lk4~0; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 20: Hoare triple {43788#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 21: Hoare triple {43788#true} ~p5~0 := #t~nondet4; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 22: Hoare triple {43788#true} havoc #t~nondet4; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 23: Hoare triple {43788#true} havoc ~lk5~0; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 24: Hoare triple {43788#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,742 INFO L280 TraceCheckUtils]: 25: Hoare triple {43788#true} ~p6~0 := #t~nondet5; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {43788#true} havoc #t~nondet5; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {43788#true} havoc ~lk6~0; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 28: Hoare triple {43788#true} havoc ~cond~0; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 29: Hoare triple {43788#true} assume !false; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 30: Hoare triple {43788#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 31: Hoare triple {43788#true} ~cond~0 := #t~nondet6; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 32: Hoare triple {43788#true} havoc #t~nondet6; {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 33: Hoare triple {43788#true} assume !(0 == ~cond~0); {43788#true} is VALID [2020-07-08 16:18:02,743 INFO L280 TraceCheckUtils]: 34: Hoare triple {43788#true} ~lk1~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 35: Hoare triple {43788#true} ~lk2~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 36: Hoare triple {43788#true} ~lk3~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 37: Hoare triple {43788#true} ~lk4~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 38: Hoare triple {43788#true} ~lk5~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 39: Hoare triple {43788#true} ~lk6~0 := 0; {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 40: Hoare triple {43788#true} assume !(0 != ~p1~0); {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 41: Hoare triple {43788#true} assume !(0 != ~p2~0); {43788#true} is VALID [2020-07-08 16:18:02,744 INFO L280 TraceCheckUtils]: 42: Hoare triple {43788#true} assume !(0 != ~p3~0); {43788#true} is VALID [2020-07-08 16:18:02,745 INFO L280 TraceCheckUtils]: 43: Hoare triple {43788#true} assume !(0 != ~p4~0); {43788#true} is VALID [2020-07-08 16:18:02,745 INFO L280 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 != ~p5~0); {43788#true} is VALID [2020-07-08 16:18:02,745 INFO L280 TraceCheckUtils]: 45: Hoare triple {43788#true} assume 0 != ~p6~0; {43788#true} is VALID [2020-07-08 16:18:02,745 INFO L280 TraceCheckUtils]: 46: Hoare triple {43788#true} ~lk6~0 := 1; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,746 INFO L280 TraceCheckUtils]: 47: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,747 INFO L280 TraceCheckUtils]: 48: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,747 INFO L280 TraceCheckUtils]: 49: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,747 INFO L280 TraceCheckUtils]: 50: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,748 INFO L280 TraceCheckUtils]: 51: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,748 INFO L280 TraceCheckUtils]: 52: Hoare triple {43792#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-08 16:18:02,749 INFO L280 TraceCheckUtils]: 53: Hoare triple {43792#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {43789#false} is VALID [2020-07-08 16:18:02,749 INFO L280 TraceCheckUtils]: 54: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2020-07-08 16:18:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 16:18:02,751 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:18:02,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176209446] [2020-07-08 16:18:02,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:18:02,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:18:02,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231566301] [2020-07-08 16:18:02,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-08 16:18:02,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:18:02,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:18:02,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:18:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:18:02,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:18:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:18:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:18:02,800 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-08 16:18:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:18:05,380 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-08 16:18:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:18:05,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-08 16:18:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:18:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:18:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-08 16:18:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:18:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-08 16:18:05,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-08 16:18:05,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:18:05,469 INFO L225 Difference]: With dead ends: 1103 [2020-07-08 16:18:05,469 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 16:18:05,472 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 16:18:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 16:18:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 16:18:05,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:18:05,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 16:18:05,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:18:05,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:18:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:18:05,473 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:18:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:18:05,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:18:05,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:18:05,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:18:05,474 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:18:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:18:05,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:18:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:18:05,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:18:05,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:18:05,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:18:05,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:18:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 16:18:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 16:18:05,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-08 16:18:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:18:05,475 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 16:18:05,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:18:05,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 16:18:05,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:18:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:18:05,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:18:05,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 16:18:05,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 16:18:05,605 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 15 [2020-07-08 16:18:05,960 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-08 16:18:06,761 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:18:07,148 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 16:18:07,524 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-08 16:18:08,499 WARN L193 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-08 16:18:08,639 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:18:08,900 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:18:09,295 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-08 16:18:09,643 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 16:18:09,800 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 16:18:10,080 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 16:18:10,435 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 16:18:10,580 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,580 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,580 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,580 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,581 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,581 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:18:10,581 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-08 16:18:10,581 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-08 16:18:10,581 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 16:18:10,582 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-08 16:18:10,582 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-08 16:18:10,582 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-08 16:18:10,582 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-08 16:18:10,582 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-08 16:18:10,582 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-08 16:18:10,583 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-08 16:18:10,583 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-08 16:18:10,583 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-08 16:18:10,583 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-08 16:18:10,583 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-08 16:18:10,583 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-08 16:18:10,584 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-08 16:18:10,584 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-08 16:18:10,584 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-08 16:18:10,584 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-08 16:18:10,584 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-08 16:18:10,584 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-08 16:18:10,584 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse7) (and .cse8 .cse0 .cse6 .cse1 .cse2) (and .cse8 .cse5 .cse0 .cse7 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse0 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse0 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse2))) [2020-07-08 16:18:10,584 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-08 16:18:10,585 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-08 16:18:10,585 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-08 16:18:10,585 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-08 16:18:10,585 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-08 16:18:10,585 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-08 16:18:10,585 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-08 16:18:10,585 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-08 16:18:10,586 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-08 16:18:10,586 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-08 16:18:10,586 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-08 16:18:10,586 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-08 16:18:10,586 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-08 16:18:10,587 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-08 16:18:10,588 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-08 16:18:10,588 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-08 16:18:10,588 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-08 16:18:10,588 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-08 16:18:10,588 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-08 16:18:10,589 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-08 16:18:10,589 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-08 16:18:10,589 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 16:18:10,589 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-08 16:18:10,589 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-08 16:18:10,590 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-08 16:18:10,590 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-08 16:18:10,591 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-08 16:18:10,591 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-08 16:18:10,591 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-08 16:18:10,591 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-08 16:18:10,591 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-08 16:18:10,591 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-08 16:18:10,591 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-08 16:18:10,592 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-08 16:18:10,592 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-08 16:18:10,592 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-08 16:18:10,592 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-08 16:18:10,593 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-08 16:18:10,593 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-08 16:18:10,593 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 16:18:10,593 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-08 16:18:10,593 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-08 16:18:10,593 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 16:18:10,651 INFO L163 areAnnotationChecker]: CFG has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 16:18:10,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 04:18:10 BoogieIcfgContainer [2020-07-08 16:18:10,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 16:18:10,663 INFO L168 Benchmark]: Toolchain (without parser) took 50320.92 ms. Allocated memory was 137.9 MB in the beginning and 592.4 MB in the end (delta: 454.6 MB). Free memory was 102.7 MB in the beginning and 458.5 MB in the end (delta: -355.8 MB). Peak memory consumption was 98.8 MB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,664 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.44 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,665 INFO L168 Benchmark]: Boogie Preprocessor took 115.10 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 179.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,666 INFO L168 Benchmark]: RCFGBuilder took 537.93 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 149.5 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,667 INFO L168 Benchmark]: TraceAbstraction took 49391.79 ms. Allocated memory was 201.3 MB in the beginning and 592.4 MB in the end (delta: 391.1 MB). Free memory was 148.8 MB in the beginning and 458.5 MB in the end (delta: -309.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:18:10,669 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.84 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.44 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.10 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 179.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 537.93 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 149.5 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49391.79 ms. Allocated memory was 201.3 MB in the beginning and 592.4 MB in the end (delta: 391.1 MB). Free memory was 148.8 MB in the beginning and 458.5 MB in the end (delta: -309.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...