/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:00:02,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:00:02,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:00:02,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:00:02,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:00:02,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:00:02,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:00:02,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:00:02,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:00:02,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:00:02,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:00:02,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:00:02,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:00:02,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:00:02,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:00:02,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:00:02,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:00:02,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:00:02,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:00:02,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:00:02,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:00:02,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:00:02,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:00:02,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:00:02,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:00:02,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:00:02,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:00:02,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:00:02,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:00:02,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:00:02,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:00:02,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:00:02,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:00:02,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:00:02,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:00:02,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:00:02,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:00:02,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:00:02,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:00:02,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:00:02,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:00:02,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:00:02,666 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:00:02,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:00:02,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:00:02,669 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:00:02,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:00:02,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:00:02,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:00:02,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:00:02,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:00:02,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:00:02,671 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:00:02,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:00:02,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:00:02,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:00:02,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:00:02,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:00:02,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:00:02,672 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:00:02,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:00:02,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:00:02,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:00:02,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:00:02,982 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:00:02,983 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-11 01:00:03,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae04beb3f/2c2836151fa04b13a88195bf0fe30b39/FLAG738effb84 [2020-07-11 01:00:03,529 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:00:03,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-11 01:00:03,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae04beb3f/2c2836151fa04b13a88195bf0fe30b39/FLAG738effb84 [2020-07-11 01:00:03,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae04beb3f/2c2836151fa04b13a88195bf0fe30b39 [2020-07-11 01:00:03,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:00:03,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:00:03,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:03,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:00:03,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:00:03,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:03" (1/1) ... [2020-07-11 01:00:03,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c65463b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:03, skipping insertion in model container [2020-07-11 01:00:03,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:03" (1/1) ... [2020-07-11 01:00:03,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:00:03,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:00:04,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:04,127 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:00:04,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:04,165 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:00:04,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04 WrapperNode [2020-07-11 01:00:04,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:04,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:00:04,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:00:04,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:00:04,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (1/1) ... [2020-07-11 01:00:04,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:00:04,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:00:04,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:00:04,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:00:04,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (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-11 01:00:04,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:00:04,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:00:04,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:00:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:00:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:00:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:00:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:00:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:00:04,923 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:00:04,924 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 01:00:04,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:04 BoogieIcfgContainer [2020-07-11 01:00:04,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:00:04,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:00:04,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:00:04,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:00:04,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:00:03" (1/3) ... [2020-07-11 01:00:04,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6b67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:04, skipping insertion in model container [2020-07-11 01:00:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:04" (2/3) ... [2020-07-11 01:00:04,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6b67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:04, skipping insertion in model container [2020-07-11 01:00:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:04" (3/3) ... [2020-07-11 01:00:04,937 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-11 01:00:04,948 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:00:04,956 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:00:04,970 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:00:04,991 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:00:04,991 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:00:04,991 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:00:04,991 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:00:04,992 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:00:04,992 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:00:04,992 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:00:04,992 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:00:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-11 01:00:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-11 01:00:05,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:05,022 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-11 01:00:05,022 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-11 01:00:05,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:05,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1807241460] [2020-07-11 01:00:05,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:05,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 01:00:05,244 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-11 01:00:05,247 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {81#true} is VALID [2020-07-11 01:00:05,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 01:00:05,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-11 01:00:05,248 INFO L263 TraceCheckUtils]: 3: Hoare triple {81#true} call #t~ret7 := main(); {81#true} is VALID [2020-07-11 01:00:05,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#true} ~p1~0 := #t~nondet0; {81#true} is VALID [2020-07-11 01:00:05,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#true} havoc #t~nondet0; {81#true} is VALID [2020-07-11 01:00:05,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} havoc ~lk1~0; {81#true} is VALID [2020-07-11 01:00:05,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} ~p2~0 := #t~nondet1; {81#true} is VALID [2020-07-11 01:00:05,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {81#true} havoc #t~nondet1; {81#true} is VALID [2020-07-11 01:00:05,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} havoc ~lk2~0; {81#true} is VALID [2020-07-11 01:00:05,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} ~p3~0 := #t~nondet2; {81#true} is VALID [2020-07-11 01:00:05,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {81#true} havoc #t~nondet2; {81#true} is VALID [2020-07-11 01:00:05,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} havoc ~lk3~0; {81#true} is VALID [2020-07-11 01:00:05,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {81#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {81#true} ~p4~0 := #t~nondet3; {81#true} is VALID [2020-07-11 01:00:05,254 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} havoc #t~nondet3; {81#true} is VALID [2020-07-11 01:00:05,254 INFO L280 TraceCheckUtils]: 19: Hoare triple {81#true} havoc ~lk4~0; {81#true} is VALID [2020-07-11 01:00:05,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,255 INFO L280 TraceCheckUtils]: 21: Hoare triple {81#true} ~p5~0 := #t~nondet4; {81#true} is VALID [2020-07-11 01:00:05,255 INFO L280 TraceCheckUtils]: 22: Hoare triple {81#true} havoc #t~nondet4; {81#true} is VALID [2020-07-11 01:00:05,256 INFO L280 TraceCheckUtils]: 23: Hoare triple {81#true} havoc ~lk5~0; {81#true} is VALID [2020-07-11 01:00:05,256 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,257 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#true} ~p6~0 := #t~nondet5; {81#true} is VALID [2020-07-11 01:00:05,257 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#true} havoc #t~nondet5; {81#true} is VALID [2020-07-11 01:00:05,258 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#true} havoc ~lk6~0; {81#true} is VALID [2020-07-11 01:00:05,258 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#true} havoc ~cond~0; {81#true} is VALID [2020-07-11 01:00:05,259 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#true} assume !false; {81#true} is VALID [2020-07-11 01:00:05,259 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {81#true} is VALID [2020-07-11 01:00:05,259 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#true} ~cond~0 := #t~nondet6; {81#true} is VALID [2020-07-11 01:00:05,260 INFO L280 TraceCheckUtils]: 32: Hoare triple {81#true} havoc #t~nondet6; {81#true} is VALID [2020-07-11 01:00:05,260 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#true} assume !(0 == ~cond~0); {81#true} is VALID [2020-07-11 01:00:05,260 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#true} ~lk1~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,261 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#true} ~lk2~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,261 INFO L280 TraceCheckUtils]: 36: Hoare triple {81#true} ~lk3~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,262 INFO L280 TraceCheckUtils]: 37: Hoare triple {81#true} ~lk4~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,262 INFO L280 TraceCheckUtils]: 38: Hoare triple {81#true} ~lk5~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,262 INFO L280 TraceCheckUtils]: 39: Hoare triple {81#true} ~lk6~0 := 0; {81#true} is VALID [2020-07-11 01:00:05,264 INFO L280 TraceCheckUtils]: 40: Hoare triple {81#true} assume !(0 != ~p1~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,267 INFO L280 TraceCheckUtils]: 41: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,268 INFO L280 TraceCheckUtils]: 42: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,269 INFO L280 TraceCheckUtils]: 43: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,270 INFO L280 TraceCheckUtils]: 44: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,271 INFO L280 TraceCheckUtils]: 45: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:05,272 INFO L280 TraceCheckUtils]: 46: Hoare triple {85#(= 0 main_~p1~0)} assume 0 != ~p1~0; {82#false} is VALID [2020-07-11 01:00:05,272 INFO L280 TraceCheckUtils]: 47: Hoare triple {82#false} assume 1 != ~lk1~0; {82#false} is VALID [2020-07-11 01:00:05,272 INFO L280 TraceCheckUtils]: 48: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-11 01:00:05,283 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-11 01:00:05,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1807241460] [2020-07-11 01:00:05,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:05,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:05,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369279947] [2020-07-11 01:00:05,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-11 01:00:05,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:05,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:05,383 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-11 01:00:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:05,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:05,396 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-11 01:00:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:05,852 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-11 01:00:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:05,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-11 01:00:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-11 01:00:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-11 01:00:05,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2020-07-11 01:00:06,174 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-11 01:00:06,193 INFO L225 Difference]: With dead ends: 169 [2020-07-11 01:00:06,194 INFO L226 Difference]: Without dead ends: 112 [2020-07-11 01:00:06,198 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-11 01:00:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-11 01:00:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-11 01:00:06,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:06,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-11 01:00:06,313 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-11 01:00:06,313 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-11 01:00:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:06,324 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-11 01:00:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-11 01:00:06,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:06,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:06,326 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-11 01:00:06,326 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-11 01:00:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:06,337 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-11 01:00:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-11 01:00:06,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:06,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:06,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:06,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-11 01:00:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-11 01:00:06,349 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-11 01:00:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:06,350 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-11 01:00:06,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:06,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2020-07-11 01:00:06,507 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-11 01:00:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-11 01:00:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 01:00:06,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:06,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:00:06,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:00:06,511 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-11 01:00:06,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:06,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015010432] [2020-07-11 01:00:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:06,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-11 01:00:06,593 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-11 01:00:06,594 INFO L263 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2020-07-11 01:00:06,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-11 01:00:06,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-11 01:00:06,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {870#true} call #t~ret7 := main(); {870#true} is VALID [2020-07-11 01:00:06,595 INFO L280 TraceCheckUtils]: 4: Hoare triple {870#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {870#true} ~p1~0 := #t~nondet0; {870#true} is VALID [2020-07-11 01:00:06,596 INFO L280 TraceCheckUtils]: 6: Hoare triple {870#true} havoc #t~nondet0; {870#true} is VALID [2020-07-11 01:00:06,596 INFO L280 TraceCheckUtils]: 7: Hoare triple {870#true} havoc ~lk1~0; {870#true} is VALID [2020-07-11 01:00:06,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {870#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {870#true} ~p2~0 := #t~nondet1; {870#true} is VALID [2020-07-11 01:00:06,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#true} havoc #t~nondet1; {870#true} is VALID [2020-07-11 01:00:06,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {870#true} havoc ~lk2~0; {870#true} is VALID [2020-07-11 01:00:06,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {870#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#true} ~p3~0 := #t~nondet2; {870#true} is VALID [2020-07-11 01:00:06,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#true} havoc #t~nondet2; {870#true} is VALID [2020-07-11 01:00:06,599 INFO L280 TraceCheckUtils]: 15: Hoare triple {870#true} havoc ~lk3~0; {870#true} is VALID [2020-07-11 01:00:06,599 INFO L280 TraceCheckUtils]: 16: Hoare triple {870#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,600 INFO L280 TraceCheckUtils]: 17: Hoare triple {870#true} ~p4~0 := #t~nondet3; {870#true} is VALID [2020-07-11 01:00:06,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {870#true} havoc #t~nondet3; {870#true} is VALID [2020-07-11 01:00:06,600 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#true} havoc ~lk4~0; {870#true} is VALID [2020-07-11 01:00:06,601 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,601 INFO L280 TraceCheckUtils]: 21: Hoare triple {870#true} ~p5~0 := #t~nondet4; {870#true} is VALID [2020-07-11 01:00:06,601 INFO L280 TraceCheckUtils]: 22: Hoare triple {870#true} havoc #t~nondet4; {870#true} is VALID [2020-07-11 01:00:06,602 INFO L280 TraceCheckUtils]: 23: Hoare triple {870#true} havoc ~lk5~0; {870#true} is VALID [2020-07-11 01:00:06,602 INFO L280 TraceCheckUtils]: 24: Hoare triple {870#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,602 INFO L280 TraceCheckUtils]: 25: Hoare triple {870#true} ~p6~0 := #t~nondet5; {870#true} is VALID [2020-07-11 01:00:06,603 INFO L280 TraceCheckUtils]: 26: Hoare triple {870#true} havoc #t~nondet5; {870#true} is VALID [2020-07-11 01:00:06,603 INFO L280 TraceCheckUtils]: 27: Hoare triple {870#true} havoc ~lk6~0; {870#true} is VALID [2020-07-11 01:00:06,603 INFO L280 TraceCheckUtils]: 28: Hoare triple {870#true} havoc ~cond~0; {870#true} is VALID [2020-07-11 01:00:06,604 INFO L280 TraceCheckUtils]: 29: Hoare triple {870#true} assume !false; {870#true} is VALID [2020-07-11 01:00:06,604 INFO L280 TraceCheckUtils]: 30: Hoare triple {870#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {870#true} is VALID [2020-07-11 01:00:06,604 INFO L280 TraceCheckUtils]: 31: Hoare triple {870#true} ~cond~0 := #t~nondet6; {870#true} is VALID [2020-07-11 01:00:06,604 INFO L280 TraceCheckUtils]: 32: Hoare triple {870#true} havoc #t~nondet6; {870#true} is VALID [2020-07-11 01:00:06,605 INFO L280 TraceCheckUtils]: 33: Hoare triple {870#true} assume !(0 == ~cond~0); {870#true} is VALID [2020-07-11 01:00:06,605 INFO L280 TraceCheckUtils]: 34: Hoare triple {870#true} ~lk1~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,605 INFO L280 TraceCheckUtils]: 35: Hoare triple {870#true} ~lk2~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,606 INFO L280 TraceCheckUtils]: 36: Hoare triple {870#true} ~lk3~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,606 INFO L280 TraceCheckUtils]: 37: Hoare triple {870#true} ~lk4~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,606 INFO L280 TraceCheckUtils]: 38: Hoare triple {870#true} ~lk5~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,607 INFO L280 TraceCheckUtils]: 39: Hoare triple {870#true} ~lk6~0 := 0; {870#true} is VALID [2020-07-11 01:00:06,607 INFO L280 TraceCheckUtils]: 40: Hoare triple {870#true} assume 0 != ~p1~0; {870#true} is VALID [2020-07-11 01:00:06,608 INFO L280 TraceCheckUtils]: 41: Hoare triple {870#true} ~lk1~0 := 1; {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,609 INFO L280 TraceCheckUtils]: 42: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,610 INFO L280 TraceCheckUtils]: 43: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,611 INFO L280 TraceCheckUtils]: 44: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,612 INFO L280 TraceCheckUtils]: 45: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,614 INFO L280 TraceCheckUtils]: 46: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,615 INFO L280 TraceCheckUtils]: 47: Hoare triple {874#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {874#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:06,617 INFO L280 TraceCheckUtils]: 48: Hoare triple {874#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {871#false} is VALID [2020-07-11 01:00:06,617 INFO L280 TraceCheckUtils]: 49: Hoare triple {871#false} assume !false; {871#false} is VALID [2020-07-11 01:00:06,621 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-11 01:00:06,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015010432] [2020-07-11 01:00:06,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:06,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:06,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840244572] [2020-07-11 01:00:06,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 01:00:06,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:06,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:06,686 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-11 01:00:06,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:06,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:06,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:06,687 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-11 01:00:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:06,965 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-11 01:00:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 01:00:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-11 01:00:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-11 01:00:06,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-11 01:00:07,121 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-11 01:00:07,127 INFO L225 Difference]: With dead ends: 135 [2020-07-11 01:00:07,127 INFO L226 Difference]: Without dead ends: 133 [2020-07-11 01:00:07,129 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-11 01:00:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-11 01:00:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-11 01:00:07,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:07,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 110 states. [2020-07-11 01:00:07,223 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 110 states. [2020-07-11 01:00:07,223 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 110 states. [2020-07-11 01:00:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:07,230 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-11 01:00:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-11 01:00:07,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:07,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:07,232 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 133 states. [2020-07-11 01:00:07,232 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 133 states. [2020-07-11 01:00:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:07,239 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-11 01:00:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-11 01:00:07,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:07,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:07,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:07,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-11 01:00:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-11 01:00:07,246 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-11 01:00:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:07,247 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-11 01:00:07,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:07,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 141 transitions. [2020-07-11 01:00:07,401 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-11 01:00:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-11 01:00:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 01:00:07,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:07,404 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-11 01:00:07,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:00:07,404 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-11 01:00:07,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:07,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096055474] [2020-07-11 01:00:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:07,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-11 01:00:07,457 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-11 01:00:07,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-11 01:00:07,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-11 01:00:07,458 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-11 01:00:07,458 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret7 := main(); {1633#true} is VALID [2020-07-11 01:00:07,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {1633#true} ~p1~0 := #t~nondet0; {1633#true} is VALID [2020-07-11 01:00:07,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} havoc #t~nondet0; {1633#true} is VALID [2020-07-11 01:00:07,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {1633#true} havoc ~lk1~0; {1633#true} is VALID [2020-07-11 01:00:07,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {1633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,459 INFO L280 TraceCheckUtils]: 9: Hoare triple {1633#true} ~p2~0 := #t~nondet1; {1633#true} is VALID [2020-07-11 01:00:07,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#true} havoc #t~nondet1; {1633#true} is VALID [2020-07-11 01:00:07,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#true} havoc ~lk2~0; {1633#true} is VALID [2020-07-11 01:00:07,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#true} ~p3~0 := #t~nondet2; {1633#true} is VALID [2020-07-11 01:00:07,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {1633#true} havoc #t~nondet2; {1633#true} is VALID [2020-07-11 01:00:07,461 INFO L280 TraceCheckUtils]: 15: Hoare triple {1633#true} havoc ~lk3~0; {1633#true} is VALID [2020-07-11 01:00:07,461 INFO L280 TraceCheckUtils]: 16: Hoare triple {1633#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,461 INFO L280 TraceCheckUtils]: 17: Hoare triple {1633#true} ~p4~0 := #t~nondet3; {1633#true} is VALID [2020-07-11 01:00:07,462 INFO L280 TraceCheckUtils]: 18: Hoare triple {1633#true} havoc #t~nondet3; {1633#true} is VALID [2020-07-11 01:00:07,462 INFO L280 TraceCheckUtils]: 19: Hoare triple {1633#true} havoc ~lk4~0; {1633#true} is VALID [2020-07-11 01:00:07,462 INFO L280 TraceCheckUtils]: 20: Hoare triple {1633#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,463 INFO L280 TraceCheckUtils]: 21: Hoare triple {1633#true} ~p5~0 := #t~nondet4; {1633#true} is VALID [2020-07-11 01:00:07,463 INFO L280 TraceCheckUtils]: 22: Hoare triple {1633#true} havoc #t~nondet4; {1633#true} is VALID [2020-07-11 01:00:07,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {1633#true} havoc ~lk5~0; {1633#true} is VALID [2020-07-11 01:00:07,463 INFO L280 TraceCheckUtils]: 24: Hoare triple {1633#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,464 INFO L280 TraceCheckUtils]: 25: Hoare triple {1633#true} ~p6~0 := #t~nondet5; {1633#true} is VALID [2020-07-11 01:00:07,464 INFO L280 TraceCheckUtils]: 26: Hoare triple {1633#true} havoc #t~nondet5; {1633#true} is VALID [2020-07-11 01:00:07,464 INFO L280 TraceCheckUtils]: 27: Hoare triple {1633#true} havoc ~lk6~0; {1633#true} is VALID [2020-07-11 01:00:07,464 INFO L280 TraceCheckUtils]: 28: Hoare triple {1633#true} havoc ~cond~0; {1633#true} is VALID [2020-07-11 01:00:07,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {1633#true} assume !false; {1633#true} is VALID [2020-07-11 01:00:07,465 INFO L280 TraceCheckUtils]: 30: Hoare triple {1633#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1633#true} is VALID [2020-07-11 01:00:07,465 INFO L280 TraceCheckUtils]: 31: Hoare triple {1633#true} ~cond~0 := #t~nondet6; {1633#true} is VALID [2020-07-11 01:00:07,465 INFO L280 TraceCheckUtils]: 32: Hoare triple {1633#true} havoc #t~nondet6; {1633#true} is VALID [2020-07-11 01:00:07,466 INFO L280 TraceCheckUtils]: 33: Hoare triple {1633#true} assume !(0 == ~cond~0); {1633#true} is VALID [2020-07-11 01:00:07,466 INFO L280 TraceCheckUtils]: 34: Hoare triple {1633#true} ~lk1~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,466 INFO L280 TraceCheckUtils]: 35: Hoare triple {1633#true} ~lk2~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,466 INFO L280 TraceCheckUtils]: 36: Hoare triple {1633#true} ~lk3~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,467 INFO L280 TraceCheckUtils]: 37: Hoare triple {1633#true} ~lk4~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,467 INFO L280 TraceCheckUtils]: 38: Hoare triple {1633#true} ~lk5~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,467 INFO L280 TraceCheckUtils]: 39: Hoare triple {1633#true} ~lk6~0 := 0; {1633#true} is VALID [2020-07-11 01:00:07,467 INFO L280 TraceCheckUtils]: 40: Hoare triple {1633#true} assume !(0 != ~p1~0); {1633#true} is VALID [2020-07-11 01:00:07,468 INFO L280 TraceCheckUtils]: 41: Hoare triple {1633#true} assume !(0 != ~p2~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,469 INFO L280 TraceCheckUtils]: 42: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,477 INFO L280 TraceCheckUtils]: 43: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,481 INFO L280 TraceCheckUtils]: 44: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,482 INFO L280 TraceCheckUtils]: 45: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,483 INFO L280 TraceCheckUtils]: 46: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:07,483 INFO L280 TraceCheckUtils]: 47: Hoare triple {1637#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1634#false} is VALID [2020-07-11 01:00:07,484 INFO L280 TraceCheckUtils]: 48: Hoare triple {1634#false} assume 1 != ~lk2~0; {1634#false} is VALID [2020-07-11 01:00:07,484 INFO L280 TraceCheckUtils]: 49: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-11 01:00:07,492 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-11 01:00:07,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096055474] [2020-07-11 01:00:07,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:07,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:07,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306577703] [2020-07-11 01:00:07,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 01:00:07,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:07,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:07,549 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-11 01:00:07,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:07,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:07,551 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-11 01:00:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:07,931 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-11 01:00:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:07,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 01:00:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-11 01:00:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-11 01:00:07,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-11 01:00:08,127 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-11 01:00:08,136 INFO L225 Difference]: With dead ends: 266 [2020-07-11 01:00:08,136 INFO L226 Difference]: Without dead ends: 185 [2020-07-11 01:00:08,138 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-11 01:00:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-11 01:00:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-11 01:00:08,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:08,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2020-07-11 01:00:08,351 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2020-07-11 01:00:08,352 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2020-07-11 01:00:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:08,360 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-11 01:00:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-11 01:00:08,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:08,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:08,361 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2020-07-11 01:00:08,361 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2020-07-11 01:00:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:08,370 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-11 01:00:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-11 01:00:08,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:08,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:08,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:08,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-11 01:00:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-11 01:00:08,379 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-11 01:00:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:08,381 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-11 01:00:08,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:08,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 240 transitions. [2020-07-11 01:00:08,641 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-11 01:00:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-11 01:00:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-11 01:00:08,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:08,643 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-11 01:00:08,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:00:08,644 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-11 01:00:08,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:08,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [456742953] [2020-07-11 01:00:08,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:08,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-11 01:00:08,694 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-11 01:00:08,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2020-07-11 01:00:08,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-11 01:00:08,695 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-11 01:00:08,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {2908#true} call #t~ret7 := main(); {2908#true} is VALID [2020-07-11 01:00:08,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {2908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,696 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} ~p1~0 := #t~nondet0; {2908#true} is VALID [2020-07-11 01:00:08,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {2908#true} havoc #t~nondet0; {2908#true} is VALID [2020-07-11 01:00:08,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {2908#true} havoc ~lk1~0; {2908#true} is VALID [2020-07-11 01:00:08,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {2908#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {2908#true} ~p2~0 := #t~nondet1; {2908#true} is VALID [2020-07-11 01:00:08,697 INFO L280 TraceCheckUtils]: 10: Hoare triple {2908#true} havoc #t~nondet1; {2908#true} is VALID [2020-07-11 01:00:08,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {2908#true} havoc ~lk2~0; {2908#true} is VALID [2020-07-11 01:00:08,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {2908#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {2908#true} ~p3~0 := #t~nondet2; {2908#true} is VALID [2020-07-11 01:00:08,698 INFO L280 TraceCheckUtils]: 14: Hoare triple {2908#true} havoc #t~nondet2; {2908#true} is VALID [2020-07-11 01:00:08,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {2908#true} havoc ~lk3~0; {2908#true} is VALID [2020-07-11 01:00:08,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {2908#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {2908#true} ~p4~0 := #t~nondet3; {2908#true} is VALID [2020-07-11 01:00:08,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {2908#true} havoc #t~nondet3; {2908#true} is VALID [2020-07-11 01:00:08,699 INFO L280 TraceCheckUtils]: 19: Hoare triple {2908#true} havoc ~lk4~0; {2908#true} is VALID [2020-07-11 01:00:08,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {2908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,700 INFO L280 TraceCheckUtils]: 21: Hoare triple {2908#true} ~p5~0 := #t~nondet4; {2908#true} is VALID [2020-07-11 01:00:08,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {2908#true} havoc #t~nondet4; {2908#true} is VALID [2020-07-11 01:00:08,700 INFO L280 TraceCheckUtils]: 23: Hoare triple {2908#true} havoc ~lk5~0; {2908#true} is VALID [2020-07-11 01:00:08,700 INFO L280 TraceCheckUtils]: 24: Hoare triple {2908#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,701 INFO L280 TraceCheckUtils]: 25: Hoare triple {2908#true} ~p6~0 := #t~nondet5; {2908#true} is VALID [2020-07-11 01:00:08,701 INFO L280 TraceCheckUtils]: 26: Hoare triple {2908#true} havoc #t~nondet5; {2908#true} is VALID [2020-07-11 01:00:08,701 INFO L280 TraceCheckUtils]: 27: Hoare triple {2908#true} havoc ~lk6~0; {2908#true} is VALID [2020-07-11 01:00:08,702 INFO L280 TraceCheckUtils]: 28: Hoare triple {2908#true} havoc ~cond~0; {2908#true} is VALID [2020-07-11 01:00:08,702 INFO L280 TraceCheckUtils]: 29: Hoare triple {2908#true} assume !false; {2908#true} is VALID [2020-07-11 01:00:08,702 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2908#true} is VALID [2020-07-11 01:00:08,703 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#true} ~cond~0 := #t~nondet6; {2908#true} is VALID [2020-07-11 01:00:08,703 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#true} havoc #t~nondet6; {2908#true} is VALID [2020-07-11 01:00:08,703 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#true} assume !(0 == ~cond~0); {2908#true} is VALID [2020-07-11 01:00:08,704 INFO L280 TraceCheckUtils]: 34: Hoare triple {2908#true} ~lk1~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,704 INFO L280 TraceCheckUtils]: 35: Hoare triple {2908#true} ~lk2~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,705 INFO L280 TraceCheckUtils]: 36: Hoare triple {2908#true} ~lk3~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,705 INFO L280 TraceCheckUtils]: 37: Hoare triple {2908#true} ~lk4~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,705 INFO L280 TraceCheckUtils]: 38: Hoare triple {2908#true} ~lk5~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,706 INFO L280 TraceCheckUtils]: 39: Hoare triple {2908#true} ~lk6~0 := 0; {2908#true} is VALID [2020-07-11 01:00:08,706 INFO L280 TraceCheckUtils]: 40: Hoare triple {2908#true} assume !(0 != ~p1~0); {2908#true} is VALID [2020-07-11 01:00:08,706 INFO L280 TraceCheckUtils]: 41: Hoare triple {2908#true} assume !(0 != ~p2~0); {2908#true} is VALID [2020-07-11 01:00:08,707 INFO L280 TraceCheckUtils]: 42: Hoare triple {2908#true} assume !(0 != ~p3~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,708 INFO L280 TraceCheckUtils]: 43: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,708 INFO L280 TraceCheckUtils]: 44: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,709 INFO L280 TraceCheckUtils]: 45: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,710 INFO L280 TraceCheckUtils]: 46: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,710 INFO L280 TraceCheckUtils]: 47: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:08,711 INFO L280 TraceCheckUtils]: 48: Hoare triple {2912#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2909#false} is VALID [2020-07-11 01:00:08,711 INFO L280 TraceCheckUtils]: 49: Hoare triple {2909#false} assume 1 != ~lk3~0; {2909#false} is VALID [2020-07-11 01:00:08,712 INFO L280 TraceCheckUtils]: 50: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-11 01:00:08,714 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-11 01:00:08,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [456742953] [2020-07-11 01:00:08,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:08,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:08,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899374889] [2020-07-11 01:00:08,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-11 01:00:08,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:08,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:08,763 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-11 01:00:08,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:08,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:08,764 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-11 01:00:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:09,423 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-11 01:00:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:09,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-11 01:00:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-11 01:00:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-11 01:00:09,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-11 01:00:09,635 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-11 01:00:09,645 INFO L225 Difference]: With dead ends: 479 [2020-07-11 01:00:09,645 INFO L226 Difference]: Without dead ends: 325 [2020-07-11 01:00:09,651 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-11 01:00:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-11 01:00:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-11 01:00:10,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:10,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 323 states. [2020-07-11 01:00:10,052 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 323 states. [2020-07-11 01:00:10,052 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 323 states. [2020-07-11 01:00:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:10,066 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-11 01:00:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-11 01:00:10,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:10,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:10,067 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 325 states. [2020-07-11 01:00:10,068 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 325 states. [2020-07-11 01:00:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:10,080 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-11 01:00:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-11 01:00:10,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:10,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:10,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:10,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-11 01:00:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-11 01:00:10,094 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-11 01:00:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:10,095 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-11 01:00:10,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:10,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 426 transitions. [2020-07-11 01:00:10,554 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-11 01:00:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-11 01:00:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-11 01:00:10,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:10,556 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-11 01:00:10,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:00:10,557 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-11 01:00:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:10,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028508567] [2020-07-11 01:00:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:10,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-11 01:00:10,620 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-11 01:00:10,620 INFO L263 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2020-07-11 01:00:10,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-11 01:00:10,621 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-11 01:00:10,621 INFO L263 TraceCheckUtils]: 3: Hoare triple {5169#true} call #t~ret7 := main(); {5169#true} is VALID [2020-07-11 01:00:10,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {5169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,621 INFO L280 TraceCheckUtils]: 5: Hoare triple {5169#true} ~p1~0 := #t~nondet0; {5169#true} is VALID [2020-07-11 01:00:10,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {5169#true} havoc #t~nondet0; {5169#true} is VALID [2020-07-11 01:00:10,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {5169#true} havoc ~lk1~0; {5169#true} is VALID [2020-07-11 01:00:10,622 INFO L280 TraceCheckUtils]: 8: Hoare triple {5169#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,622 INFO L280 TraceCheckUtils]: 9: Hoare triple {5169#true} ~p2~0 := #t~nondet1; {5169#true} is VALID [2020-07-11 01:00:10,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {5169#true} havoc #t~nondet1; {5169#true} is VALID [2020-07-11 01:00:10,623 INFO L280 TraceCheckUtils]: 11: Hoare triple {5169#true} havoc ~lk2~0; {5169#true} is VALID [2020-07-11 01:00:10,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {5169#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {5169#true} ~p3~0 := #t~nondet2; {5169#true} is VALID [2020-07-11 01:00:10,624 INFO L280 TraceCheckUtils]: 14: Hoare triple {5169#true} havoc #t~nondet2; {5169#true} is VALID [2020-07-11 01:00:10,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {5169#true} havoc ~lk3~0; {5169#true} is VALID [2020-07-11 01:00:10,624 INFO L280 TraceCheckUtils]: 16: Hoare triple {5169#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,624 INFO L280 TraceCheckUtils]: 17: Hoare triple {5169#true} ~p4~0 := #t~nondet3; {5169#true} is VALID [2020-07-11 01:00:10,625 INFO L280 TraceCheckUtils]: 18: Hoare triple {5169#true} havoc #t~nondet3; {5169#true} is VALID [2020-07-11 01:00:10,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {5169#true} havoc ~lk4~0; {5169#true} is VALID [2020-07-11 01:00:10,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {5169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,625 INFO L280 TraceCheckUtils]: 21: Hoare triple {5169#true} ~p5~0 := #t~nondet4; {5169#true} is VALID [2020-07-11 01:00:10,626 INFO L280 TraceCheckUtils]: 22: Hoare triple {5169#true} havoc #t~nondet4; {5169#true} is VALID [2020-07-11 01:00:10,626 INFO L280 TraceCheckUtils]: 23: Hoare triple {5169#true} havoc ~lk5~0; {5169#true} is VALID [2020-07-11 01:00:10,626 INFO L280 TraceCheckUtils]: 24: Hoare triple {5169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {5169#true} ~p6~0 := #t~nondet5; {5169#true} is VALID [2020-07-11 01:00:10,626 INFO L280 TraceCheckUtils]: 26: Hoare triple {5169#true} havoc #t~nondet5; {5169#true} is VALID [2020-07-11 01:00:10,627 INFO L280 TraceCheckUtils]: 27: Hoare triple {5169#true} havoc ~lk6~0; {5169#true} is VALID [2020-07-11 01:00:10,627 INFO L280 TraceCheckUtils]: 28: Hoare triple {5169#true} havoc ~cond~0; {5169#true} is VALID [2020-07-11 01:00:10,627 INFO L280 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !false; {5169#true} is VALID [2020-07-11 01:00:10,627 INFO L280 TraceCheckUtils]: 30: Hoare triple {5169#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5169#true} is VALID [2020-07-11 01:00:10,628 INFO L280 TraceCheckUtils]: 31: Hoare triple {5169#true} ~cond~0 := #t~nondet6; {5169#true} is VALID [2020-07-11 01:00:10,628 INFO L280 TraceCheckUtils]: 32: Hoare triple {5169#true} havoc #t~nondet6; {5169#true} is VALID [2020-07-11 01:00:10,628 INFO L280 TraceCheckUtils]: 33: Hoare triple {5169#true} assume !(0 == ~cond~0); {5169#true} is VALID [2020-07-11 01:00:10,628 INFO L280 TraceCheckUtils]: 34: Hoare triple {5169#true} ~lk1~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,628 INFO L280 TraceCheckUtils]: 35: Hoare triple {5169#true} ~lk2~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,629 INFO L280 TraceCheckUtils]: 36: Hoare triple {5169#true} ~lk3~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,629 INFO L280 TraceCheckUtils]: 37: Hoare triple {5169#true} ~lk4~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,629 INFO L280 TraceCheckUtils]: 38: Hoare triple {5169#true} ~lk5~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,629 INFO L280 TraceCheckUtils]: 39: Hoare triple {5169#true} ~lk6~0 := 0; {5169#true} is VALID [2020-07-11 01:00:10,630 INFO L280 TraceCheckUtils]: 40: Hoare triple {5169#true} assume !(0 != ~p1~0); {5169#true} is VALID [2020-07-11 01:00:10,630 INFO L280 TraceCheckUtils]: 41: Hoare triple {5169#true} assume 0 != ~p2~0; {5169#true} is VALID [2020-07-11 01:00:10,631 INFO L280 TraceCheckUtils]: 42: Hoare triple {5169#true} ~lk2~0 := 1; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,632 INFO L280 TraceCheckUtils]: 43: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,635 INFO L280 TraceCheckUtils]: 44: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,638 INFO L280 TraceCheckUtils]: 45: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,642 INFO L280 TraceCheckUtils]: 46: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,643 INFO L280 TraceCheckUtils]: 47: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,643 INFO L280 TraceCheckUtils]: 48: Hoare triple {5173#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:10,644 INFO L280 TraceCheckUtils]: 49: Hoare triple {5173#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {5170#false} is VALID [2020-07-11 01:00:10,644 INFO L280 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2020-07-11 01:00:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:10,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028508567] [2020-07-11 01:00:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:10,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:10,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872099051] [2020-07-11 01:00:10,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-11 01:00:10,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:10,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:10,699 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-11 01:00:10,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:10,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:10,701 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-11 01:00:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:11,358 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-11 01:00:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:11,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-11 01:00:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-11 01:00:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-11 01:00:11,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-11 01:00:11,491 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-11 01:00:11,505 INFO L225 Difference]: With dead ends: 399 [2020-07-11 01:00:11,505 INFO L226 Difference]: Without dead ends: 397 [2020-07-11 01:00:11,506 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-11 01:00:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-11 01:00:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-11 01:00:11,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:11,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 323 states. [2020-07-11 01:00:11,931 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 323 states. [2020-07-11 01:00:11,931 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 323 states. [2020-07-11 01:00:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:11,949 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-11 01:00:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-11 01:00:11,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:11,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:11,951 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 397 states. [2020-07-11 01:00:11,951 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 397 states. [2020-07-11 01:00:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:11,968 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-11 01:00:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-11 01:00:11,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:11,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:11,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:11,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-11 01:00:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-11 01:00:11,983 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-11 01:00:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:11,983 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-11 01:00:11,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:11,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 422 transitions. [2020-07-11 01:00:12,457 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-11 01:00:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-11 01:00:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 01:00:12,459 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:12,459 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-11 01:00:12,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:00:12,460 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-11 01:00:12,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:12,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [40701072] [2020-07-11 01:00:12,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:12,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-11 01:00:12,503 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-11 01:00:12,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {7414#true} call ULTIMATE.init(); {7414#true} is VALID [2020-07-11 01:00:12,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-11 01:00:12,504 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-11 01:00:12,504 INFO L263 TraceCheckUtils]: 3: Hoare triple {7414#true} call #t~ret7 := main(); {7414#true} is VALID [2020-07-11 01:00:12,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {7414#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {7414#true} ~p1~0 := #t~nondet0; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {7414#true} havoc #t~nondet0; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 7: Hoare triple {7414#true} havoc ~lk1~0; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {7414#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {7414#true} ~p2~0 := #t~nondet1; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {7414#true} havoc #t~nondet1; {7414#true} is VALID [2020-07-11 01:00:12,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {7414#true} havoc ~lk2~0; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {7414#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {7414#true} ~p3~0 := #t~nondet2; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {7414#true} havoc #t~nondet2; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {7414#true} havoc ~lk3~0; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 16: Hoare triple {7414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,506 INFO L280 TraceCheckUtils]: 17: Hoare triple {7414#true} ~p4~0 := #t~nondet3; {7414#true} is VALID [2020-07-11 01:00:12,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {7414#true} havoc #t~nondet3; {7414#true} is VALID [2020-07-11 01:00:12,507 INFO L280 TraceCheckUtils]: 19: Hoare triple {7414#true} havoc ~lk4~0; {7414#true} is VALID [2020-07-11 01:00:12,507 INFO L280 TraceCheckUtils]: 20: Hoare triple {7414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,507 INFO L280 TraceCheckUtils]: 21: Hoare triple {7414#true} ~p5~0 := #t~nondet4; {7414#true} is VALID [2020-07-11 01:00:12,507 INFO L280 TraceCheckUtils]: 22: Hoare triple {7414#true} havoc #t~nondet4; {7414#true} is VALID [2020-07-11 01:00:12,508 INFO L280 TraceCheckUtils]: 23: Hoare triple {7414#true} havoc ~lk5~0; {7414#true} is VALID [2020-07-11 01:00:12,508 INFO L280 TraceCheckUtils]: 24: Hoare triple {7414#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,508 INFO L280 TraceCheckUtils]: 25: Hoare triple {7414#true} ~p6~0 := #t~nondet5; {7414#true} is VALID [2020-07-11 01:00:12,508 INFO L280 TraceCheckUtils]: 26: Hoare triple {7414#true} havoc #t~nondet5; {7414#true} is VALID [2020-07-11 01:00:12,508 INFO L280 TraceCheckUtils]: 27: Hoare triple {7414#true} havoc ~lk6~0; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 28: Hoare triple {7414#true} havoc ~cond~0; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 29: Hoare triple {7414#true} assume !false; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 30: Hoare triple {7414#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 31: Hoare triple {7414#true} ~cond~0 := #t~nondet6; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 32: Hoare triple {7414#true} havoc #t~nondet6; {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 33: Hoare triple {7414#true} assume !(0 == ~cond~0); {7414#true} is VALID [2020-07-11 01:00:12,509 INFO L280 TraceCheckUtils]: 34: Hoare triple {7414#true} ~lk1~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,510 INFO L280 TraceCheckUtils]: 35: Hoare triple {7414#true} ~lk2~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,510 INFO L280 TraceCheckUtils]: 36: Hoare triple {7414#true} ~lk3~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,510 INFO L280 TraceCheckUtils]: 37: Hoare triple {7414#true} ~lk4~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,510 INFO L280 TraceCheckUtils]: 38: Hoare triple {7414#true} ~lk5~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,510 INFO L280 TraceCheckUtils]: 39: Hoare triple {7414#true} ~lk6~0 := 0; {7414#true} is VALID [2020-07-11 01:00:12,511 INFO L280 TraceCheckUtils]: 40: Hoare triple {7414#true} assume !(0 != ~p1~0); {7414#true} is VALID [2020-07-11 01:00:12,511 INFO L280 TraceCheckUtils]: 41: Hoare triple {7414#true} assume !(0 != ~p2~0); {7414#true} is VALID [2020-07-11 01:00:12,511 INFO L280 TraceCheckUtils]: 42: Hoare triple {7414#true} assume 0 != ~p3~0; {7414#true} is VALID [2020-07-11 01:00:12,512 INFO L280 TraceCheckUtils]: 43: Hoare triple {7414#true} ~lk3~0 := 1; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,513 INFO L280 TraceCheckUtils]: 44: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,514 INFO L280 TraceCheckUtils]: 45: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,515 INFO L280 TraceCheckUtils]: 46: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,515 INFO L280 TraceCheckUtils]: 47: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,516 INFO L280 TraceCheckUtils]: 48: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,516 INFO L280 TraceCheckUtils]: 49: Hoare triple {7418#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:12,516 INFO L280 TraceCheckUtils]: 50: Hoare triple {7418#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7415#false} is VALID [2020-07-11 01:00:12,517 INFO L280 TraceCheckUtils]: 51: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2020-07-11 01:00:12,518 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-11 01:00:12,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [40701072] [2020-07-11 01:00:12,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:12,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:12,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400799552] [2020-07-11 01:00:12,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-11 01:00:12,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:12,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:12,571 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-11 01:00:12,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:12,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:12,573 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-11 01:00:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:13,339 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-11 01:00:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:13,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-11 01:00:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-11 01:00:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-11 01:00:13,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-11 01:00:13,468 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-11 01:00:13,479 INFO L225 Difference]: With dead ends: 395 [2020-07-11 01:00:13,479 INFO L226 Difference]: Without dead ends: 393 [2020-07-11 01:00:13,480 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-11 01:00:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-11 01:00:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-11 01:00:13,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:13,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand 323 states. [2020-07-11 01:00:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand 323 states. [2020-07-11 01:00:13,939 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 323 states. [2020-07-11 01:00:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:13,952 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-11 01:00:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-11 01:00:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:13,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:13,954 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 393 states. [2020-07-11 01:00:13,954 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 393 states. [2020-07-11 01:00:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:13,967 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-11 01:00:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-11 01:00:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:13,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:13,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-11 01:00:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-11 01:00:13,978 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-11 01:00:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:13,978 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-11 01:00:13,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:13,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 418 transitions. [2020-07-11 01:00:14,424 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-11 01:00:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-11 01:00:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 01:00:14,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:14,426 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-11 01:00:14,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:00:14,427 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-11 01:00:14,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:14,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [417539443] [2020-07-11 01:00:14,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:14,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-11 01:00:14,491 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-11 01:00:14,491 INFO L263 TraceCheckUtils]: 0: Hoare triple {9643#true} call ULTIMATE.init(); {9643#true} is VALID [2020-07-11 01:00:14,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-11 01:00:14,492 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-11 01:00:14,492 INFO L263 TraceCheckUtils]: 3: Hoare triple {9643#true} call #t~ret7 := main(); {9643#true} is VALID [2020-07-11 01:00:14,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {9643#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {9643#true} ~p1~0 := #t~nondet0; {9643#true} is VALID [2020-07-11 01:00:14,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {9643#true} havoc #t~nondet0; {9643#true} is VALID [2020-07-11 01:00:14,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {9643#true} havoc ~lk1~0; {9643#true} is VALID [2020-07-11 01:00:14,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {9643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {9643#true} ~p2~0 := #t~nondet1; {9643#true} is VALID [2020-07-11 01:00:14,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {9643#true} havoc #t~nondet1; {9643#true} is VALID [2020-07-11 01:00:14,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {9643#true} havoc ~lk2~0; {9643#true} is VALID [2020-07-11 01:00:14,495 INFO L280 TraceCheckUtils]: 12: Hoare triple {9643#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {9643#true} ~p3~0 := #t~nondet2; {9643#true} is VALID [2020-07-11 01:00:14,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {9643#true} havoc #t~nondet2; {9643#true} is VALID [2020-07-11 01:00:14,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {9643#true} havoc ~lk3~0; {9643#true} is VALID [2020-07-11 01:00:14,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {9643#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {9643#true} ~p4~0 := #t~nondet3; {9643#true} is VALID [2020-07-11 01:00:14,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {9643#true} havoc #t~nondet3; {9643#true} is VALID [2020-07-11 01:00:14,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#true} havoc ~lk4~0; {9643#true} is VALID [2020-07-11 01:00:14,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {9643#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {9643#true} ~p5~0 := #t~nondet4; {9643#true} is VALID [2020-07-11 01:00:14,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {9643#true} havoc #t~nondet4; {9643#true} is VALID [2020-07-11 01:00:14,497 INFO L280 TraceCheckUtils]: 23: Hoare triple {9643#true} havoc ~lk5~0; {9643#true} is VALID [2020-07-11 01:00:14,497 INFO L280 TraceCheckUtils]: 24: Hoare triple {9643#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,497 INFO L280 TraceCheckUtils]: 25: Hoare triple {9643#true} ~p6~0 := #t~nondet5; {9643#true} is VALID [2020-07-11 01:00:14,498 INFO L280 TraceCheckUtils]: 26: Hoare triple {9643#true} havoc #t~nondet5; {9643#true} is VALID [2020-07-11 01:00:14,498 INFO L280 TraceCheckUtils]: 27: Hoare triple {9643#true} havoc ~lk6~0; {9643#true} is VALID [2020-07-11 01:00:14,498 INFO L280 TraceCheckUtils]: 28: Hoare triple {9643#true} havoc ~cond~0; {9643#true} is VALID [2020-07-11 01:00:14,499 INFO L280 TraceCheckUtils]: 29: Hoare triple {9643#true} assume !false; {9643#true} is VALID [2020-07-11 01:00:14,499 INFO L280 TraceCheckUtils]: 30: Hoare triple {9643#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9643#true} is VALID [2020-07-11 01:00:14,499 INFO L280 TraceCheckUtils]: 31: Hoare triple {9643#true} ~cond~0 := #t~nondet6; {9643#true} is VALID [2020-07-11 01:00:14,499 INFO L280 TraceCheckUtils]: 32: Hoare triple {9643#true} havoc #t~nondet6; {9643#true} is VALID [2020-07-11 01:00:14,500 INFO L280 TraceCheckUtils]: 33: Hoare triple {9643#true} assume !(0 == ~cond~0); {9643#true} is VALID [2020-07-11 01:00:14,500 INFO L280 TraceCheckUtils]: 34: Hoare triple {9643#true} ~lk1~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,500 INFO L280 TraceCheckUtils]: 35: Hoare triple {9643#true} ~lk2~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,500 INFO L280 TraceCheckUtils]: 36: Hoare triple {9643#true} ~lk3~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,501 INFO L280 TraceCheckUtils]: 37: Hoare triple {9643#true} ~lk4~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,501 INFO L280 TraceCheckUtils]: 38: Hoare triple {9643#true} ~lk5~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,501 INFO L280 TraceCheckUtils]: 39: Hoare triple {9643#true} ~lk6~0 := 0; {9643#true} is VALID [2020-07-11 01:00:14,502 INFO L280 TraceCheckUtils]: 40: Hoare triple {9643#true} assume !(0 != ~p1~0); {9643#true} is VALID [2020-07-11 01:00:14,502 INFO L280 TraceCheckUtils]: 41: Hoare triple {9643#true} assume !(0 != ~p2~0); {9643#true} is VALID [2020-07-11 01:00:14,502 INFO L280 TraceCheckUtils]: 42: Hoare triple {9643#true} assume !(0 != ~p3~0); {9643#true} is VALID [2020-07-11 01:00:14,505 INFO L280 TraceCheckUtils]: 43: Hoare triple {9643#true} assume !(0 != ~p4~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,508 INFO L280 TraceCheckUtils]: 44: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,509 INFO L280 TraceCheckUtils]: 45: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,510 INFO L280 TraceCheckUtils]: 46: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,510 INFO L280 TraceCheckUtils]: 47: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:14,512 INFO L280 TraceCheckUtils]: 49: Hoare triple {9647#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9644#false} is VALID [2020-07-11 01:00:14,512 INFO L280 TraceCheckUtils]: 50: Hoare triple {9644#false} assume 1 != ~lk4~0; {9644#false} is VALID [2020-07-11 01:00:14,512 INFO L280 TraceCheckUtils]: 51: Hoare triple {9644#false} assume !false; {9644#false} is VALID [2020-07-11 01:00:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:14,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [417539443] [2020-07-11 01:00:14,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:14,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:14,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929369046] [2020-07-11 01:00:14,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-11 01:00:14,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:14,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:14,562 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-11 01:00:14,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:14,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:14,564 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-11 01:00:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:15,817 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-11 01:00:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:15,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-11 01:00:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-11 01:00:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-11 01:00:15,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2020-07-11 01:00:16,000 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-11 01:00:16,027 INFO L225 Difference]: With dead ends: 887 [2020-07-11 01:00:16,028 INFO L226 Difference]: Without dead ends: 593 [2020-07-11 01:00:16,033 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-11 01:00:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-11 01:00:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-11 01:00:17,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:17,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand 591 states. [2020-07-11 01:00:17,080 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand 591 states. [2020-07-11 01:00:17,080 INFO L87 Difference]: Start difference. First operand 593 states. Second operand 591 states. [2020-07-11 01:00:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:17,104 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-11 01:00:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-11 01:00:17,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:17,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:17,106 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 593 states. [2020-07-11 01:00:17,106 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 593 states. [2020-07-11 01:00:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:17,131 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-11 01:00:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-11 01:00:17,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:17,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:17,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:17,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-11 01:00:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-11 01:00:17,158 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-11 01:00:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:17,158 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-11 01:00:17,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:17,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 758 transitions. [2020-07-11 01:00:18,020 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-11 01:00:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-11 01:00:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 01:00:18,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:18,025 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-11 01:00:18,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:00:18,026 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-11 01:00:18,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:18,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340790233] [2020-07-11 01:00:18,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:18,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-11 01:00:18,070 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-11 01:00:18,070 INFO L263 TraceCheckUtils]: 0: Hoare triple {13792#true} call ULTIMATE.init(); {13792#true} is VALID [2020-07-11 01:00:18,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-11 01:00:18,070 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L263 TraceCheckUtils]: 3: Hoare triple {13792#true} call #t~ret7 := main(); {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L280 TraceCheckUtils]: 4: Hoare triple {13792#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L280 TraceCheckUtils]: 5: Hoare triple {13792#true} ~p1~0 := #t~nondet0; {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {13792#true} havoc #t~nondet0; {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {13792#true} havoc ~lk1~0; {13792#true} is VALID [2020-07-11 01:00:18,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {13792#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {13792#true} ~p2~0 := #t~nondet1; {13792#true} is VALID [2020-07-11 01:00:18,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {13792#true} havoc #t~nondet1; {13792#true} is VALID [2020-07-11 01:00:18,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {13792#true} havoc ~lk2~0; {13792#true} is VALID [2020-07-11 01:00:18,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {13792#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {13792#true} ~p3~0 := #t~nondet2; {13792#true} is VALID [2020-07-11 01:00:18,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {13792#true} havoc #t~nondet2; {13792#true} is VALID [2020-07-11 01:00:18,073 INFO L280 TraceCheckUtils]: 15: Hoare triple {13792#true} havoc ~lk3~0; {13792#true} is VALID [2020-07-11 01:00:18,073 INFO L280 TraceCheckUtils]: 16: Hoare triple {13792#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,074 INFO L280 TraceCheckUtils]: 17: Hoare triple {13792#true} ~p4~0 := #t~nondet3; {13792#true} is VALID [2020-07-11 01:00:18,074 INFO L280 TraceCheckUtils]: 18: Hoare triple {13792#true} havoc #t~nondet3; {13792#true} is VALID [2020-07-11 01:00:18,074 INFO L280 TraceCheckUtils]: 19: Hoare triple {13792#true} havoc ~lk4~0; {13792#true} is VALID [2020-07-11 01:00:18,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {13792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,075 INFO L280 TraceCheckUtils]: 21: Hoare triple {13792#true} ~p5~0 := #t~nondet4; {13792#true} is VALID [2020-07-11 01:00:18,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {13792#true} havoc #t~nondet4; {13792#true} is VALID [2020-07-11 01:00:18,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {13792#true} havoc ~lk5~0; {13792#true} is VALID [2020-07-11 01:00:18,075 INFO L280 TraceCheckUtils]: 24: Hoare triple {13792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,075 INFO L280 TraceCheckUtils]: 25: Hoare triple {13792#true} ~p6~0 := #t~nondet5; {13792#true} is VALID [2020-07-11 01:00:18,076 INFO L280 TraceCheckUtils]: 26: Hoare triple {13792#true} havoc #t~nondet5; {13792#true} is VALID [2020-07-11 01:00:18,076 INFO L280 TraceCheckUtils]: 27: Hoare triple {13792#true} havoc ~lk6~0; {13792#true} is VALID [2020-07-11 01:00:18,076 INFO L280 TraceCheckUtils]: 28: Hoare triple {13792#true} havoc ~cond~0; {13792#true} is VALID [2020-07-11 01:00:18,076 INFO L280 TraceCheckUtils]: 29: Hoare triple {13792#true} assume !false; {13792#true} is VALID [2020-07-11 01:00:18,077 INFO L280 TraceCheckUtils]: 30: Hoare triple {13792#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13792#true} is VALID [2020-07-11 01:00:18,077 INFO L280 TraceCheckUtils]: 31: Hoare triple {13792#true} ~cond~0 := #t~nondet6; {13792#true} is VALID [2020-07-11 01:00:18,077 INFO L280 TraceCheckUtils]: 32: Hoare triple {13792#true} havoc #t~nondet6; {13792#true} is VALID [2020-07-11 01:00:18,077 INFO L280 TraceCheckUtils]: 33: Hoare triple {13792#true} assume !(0 == ~cond~0); {13792#true} is VALID [2020-07-11 01:00:18,078 INFO L280 TraceCheckUtils]: 34: Hoare triple {13792#true} ~lk1~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,078 INFO L280 TraceCheckUtils]: 35: Hoare triple {13792#true} ~lk2~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,078 INFO L280 TraceCheckUtils]: 36: Hoare triple {13792#true} ~lk3~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,078 INFO L280 TraceCheckUtils]: 37: Hoare triple {13792#true} ~lk4~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,079 INFO L280 TraceCheckUtils]: 38: Hoare triple {13792#true} ~lk5~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,079 INFO L280 TraceCheckUtils]: 39: Hoare triple {13792#true} ~lk6~0 := 0; {13792#true} is VALID [2020-07-11 01:00:18,079 INFO L280 TraceCheckUtils]: 40: Hoare triple {13792#true} assume !(0 != ~p1~0); {13792#true} is VALID [2020-07-11 01:00:18,079 INFO L280 TraceCheckUtils]: 41: Hoare triple {13792#true} assume !(0 != ~p2~0); {13792#true} is VALID [2020-07-11 01:00:18,080 INFO L280 TraceCheckUtils]: 42: Hoare triple {13792#true} assume !(0 != ~p3~0); {13792#true} is VALID [2020-07-11 01:00:18,080 INFO L280 TraceCheckUtils]: 43: Hoare triple {13792#true} assume 0 != ~p4~0; {13792#true} is VALID [2020-07-11 01:00:18,081 INFO L280 TraceCheckUtils]: 44: Hoare triple {13792#true} ~lk4~0 := 1; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,081 INFO L280 TraceCheckUtils]: 45: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,082 INFO L280 TraceCheckUtils]: 46: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,082 INFO L280 TraceCheckUtils]: 47: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,083 INFO L280 TraceCheckUtils]: 48: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,083 INFO L280 TraceCheckUtils]: 49: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,084 INFO L280 TraceCheckUtils]: 50: Hoare triple {13796#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:18,088 INFO L280 TraceCheckUtils]: 51: Hoare triple {13796#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {13793#false} is VALID [2020-07-11 01:00:18,088 INFO L280 TraceCheckUtils]: 52: Hoare triple {13793#false} assume !false; {13793#false} is VALID [2020-07-11 01:00:18,091 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-11 01:00:18,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340790233] [2020-07-11 01:00:18,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:18,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:18,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949819847] [2020-07-11 01:00:18,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-11 01:00:18,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:18,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:18,168 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-11 01:00:18,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:18,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:18,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:18,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:18,170 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-11 01:00:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:19,569 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-11 01:00:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:19,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-11 01:00:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-11 01:00:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-11 01:00:19,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-11 01:00:19,679 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-11 01:00:19,714 INFO L225 Difference]: With dead ends: 715 [2020-07-11 01:00:19,714 INFO L226 Difference]: Without dead ends: 713 [2020-07-11 01:00:19,715 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-11 01:00:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-11 01:00:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-11 01:00:20,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:20,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand 591 states. [2020-07-11 01:00:20,715 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand 591 states. [2020-07-11 01:00:20,715 INFO L87 Difference]: Start difference. First operand 713 states. Second operand 591 states. [2020-07-11 01:00:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:20,745 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-11 01:00:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-11 01:00:20,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:20,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:20,747 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 713 states. [2020-07-11 01:00:20,747 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 713 states. [2020-07-11 01:00:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:20,776 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-11 01:00:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-11 01:00:20,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:20,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:20,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:20,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-11 01:00:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-11 01:00:20,800 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-11 01:00:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:20,801 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-11 01:00:20,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:20,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 750 transitions. [2020-07-11 01:00:21,616 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-11 01:00:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-11 01:00:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 01:00:21,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:21,618 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-11 01:00:21,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:00:21,619 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-11 01:00:21,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:21,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360524100] [2020-07-11 01:00:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:21,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-11 01:00:21,653 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-11 01:00:21,653 INFO L263 TraceCheckUtils]: 0: Hoare triple {17837#true} call ULTIMATE.init(); {17837#true} is VALID [2020-07-11 01:00:21,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L263 TraceCheckUtils]: 3: Hoare triple {17837#true} call #t~ret7 := main(); {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {17837#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L280 TraceCheckUtils]: 5: Hoare triple {17837#true} ~p1~0 := #t~nondet0; {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L280 TraceCheckUtils]: 6: Hoare triple {17837#true} havoc #t~nondet0; {17837#true} is VALID [2020-07-11 01:00:21,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {17837#true} havoc ~lk1~0; {17837#true} is VALID [2020-07-11 01:00:21,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {17837#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,655 INFO L280 TraceCheckUtils]: 9: Hoare triple {17837#true} ~p2~0 := #t~nondet1; {17837#true} is VALID [2020-07-11 01:00:21,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {17837#true} havoc #t~nondet1; {17837#true} is VALID [2020-07-11 01:00:21,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {17837#true} havoc ~lk2~0; {17837#true} is VALID [2020-07-11 01:00:21,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {17837#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {17837#true} ~p3~0 := #t~nondet2; {17837#true} is VALID [2020-07-11 01:00:21,656 INFO L280 TraceCheckUtils]: 14: Hoare triple {17837#true} havoc #t~nondet2; {17837#true} is VALID [2020-07-11 01:00:21,656 INFO L280 TraceCheckUtils]: 15: Hoare triple {17837#true} havoc ~lk3~0; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 16: Hoare triple {17837#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {17837#true} ~p4~0 := #t~nondet3; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {17837#true} havoc #t~nondet3; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 19: Hoare triple {17837#true} havoc ~lk4~0; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 20: Hoare triple {17837#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,657 INFO L280 TraceCheckUtils]: 21: Hoare triple {17837#true} ~p5~0 := #t~nondet4; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 22: Hoare triple {17837#true} havoc #t~nondet4; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 23: Hoare triple {17837#true} havoc ~lk5~0; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 24: Hoare triple {17837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 25: Hoare triple {17837#true} ~p6~0 := #t~nondet5; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 26: Hoare triple {17837#true} havoc #t~nondet5; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 27: Hoare triple {17837#true} havoc ~lk6~0; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 28: Hoare triple {17837#true} havoc ~cond~0; {17837#true} is VALID [2020-07-11 01:00:21,658 INFO L280 TraceCheckUtils]: 29: Hoare triple {17837#true} assume !false; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {17837#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 31: Hoare triple {17837#true} ~cond~0 := #t~nondet6; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 32: Hoare triple {17837#true} havoc #t~nondet6; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 33: Hoare triple {17837#true} assume !(0 == ~cond~0); {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 34: Hoare triple {17837#true} ~lk1~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 35: Hoare triple {17837#true} ~lk2~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,659 INFO L280 TraceCheckUtils]: 36: Hoare triple {17837#true} ~lk3~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 37: Hoare triple {17837#true} ~lk4~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 38: Hoare triple {17837#true} ~lk5~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 39: Hoare triple {17837#true} ~lk6~0 := 0; {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 40: Hoare triple {17837#true} assume !(0 != ~p1~0); {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 41: Hoare triple {17837#true} assume !(0 != ~p2~0); {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 42: Hoare triple {17837#true} assume !(0 != ~p3~0); {17837#true} is VALID [2020-07-11 01:00:21,660 INFO L280 TraceCheckUtils]: 43: Hoare triple {17837#true} assume !(0 != ~p4~0); {17837#true} is VALID [2020-07-11 01:00:21,661 INFO L280 TraceCheckUtils]: 44: Hoare triple {17837#true} assume !(0 != ~p5~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,661 INFO L280 TraceCheckUtils]: 45: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,662 INFO L280 TraceCheckUtils]: 46: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,662 INFO L280 TraceCheckUtils]: 47: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,662 INFO L280 TraceCheckUtils]: 48: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,663 INFO L280 TraceCheckUtils]: 49: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:21,663 INFO L280 TraceCheckUtils]: 50: Hoare triple {17841#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17838#false} is VALID [2020-07-11 01:00:21,663 INFO L280 TraceCheckUtils]: 51: Hoare triple {17838#false} assume 1 != ~lk5~0; {17838#false} is VALID [2020-07-11 01:00:21,663 INFO L280 TraceCheckUtils]: 52: Hoare triple {17838#false} assume !false; {17838#false} is VALID [2020-07-11 01:00:21,665 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-11 01:00:21,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360524100] [2020-07-11 01:00:21,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:21,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:21,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908281104] [2020-07-11 01:00:21,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-11 01:00:21,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:21,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:21,711 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-11 01:00:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:21,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:21,712 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-11 01:00:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:24,296 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-11 01:00:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:24,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-11 01:00:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-11 01:00:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-11 01:00:24,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2020-07-11 01:00:24,490 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-11 01:00:24,543 INFO L225 Difference]: With dead ends: 1667 [2020-07-11 01:00:24,544 INFO L226 Difference]: Without dead ends: 1105 [2020-07-11 01:00:24,545 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-11 01:00:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-11 01:00:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-11 01:00:26,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:26,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1105 states. Second operand 1103 states. [2020-07-11 01:00:26,737 INFO L74 IsIncluded]: Start isIncluded. First operand 1105 states. Second operand 1103 states. [2020-07-11 01:00:26,737 INFO L87 Difference]: Start difference. First operand 1105 states. Second operand 1103 states. [2020-07-11 01:00:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:26,799 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-11 01:00:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-11 01:00:26,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:26,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:26,801 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1105 states. [2020-07-11 01:00:26,802 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1105 states. [2020-07-11 01:00:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:26,852 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-11 01:00:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-11 01:00:26,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:26,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:26,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:26,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-11 01:00:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-11 01:00:26,915 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-11 01:00:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:26,915 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-11 01:00:26,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:26,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1374 transitions. [2020-07-11 01:00:28,594 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-11 01:00:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-11 01:00:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 01:00:28,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:28,596 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-11 01:00:28,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:00:28,596 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-11 01:00:28,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:28,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370065305] [2020-07-11 01:00:28,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:28,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {25594#true} call ULTIMATE.init(); {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L263 TraceCheckUtils]: 3: Hoare triple {25594#true} call #t~ret7 := main(); {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {25594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {25594#true} ~p1~0 := #t~nondet0; {25594#true} is VALID [2020-07-11 01:00:28,647 INFO L280 TraceCheckUtils]: 6: Hoare triple {25594#true} havoc #t~nondet0; {25594#true} is VALID [2020-07-11 01:00:28,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {25594#true} havoc ~lk1~0; {25594#true} is VALID [2020-07-11 01:00:28,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {25594#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {25594#true} ~p2~0 := #t~nondet1; {25594#true} is VALID [2020-07-11 01:00:28,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {25594#true} havoc #t~nondet1; {25594#true} is VALID [2020-07-11 01:00:28,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {25594#true} havoc ~lk2~0; {25594#true} is VALID [2020-07-11 01:00:28,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {25594#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {25594#true} ~p3~0 := #t~nondet2; {25594#true} is VALID [2020-07-11 01:00:28,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {25594#true} havoc #t~nondet2; {25594#true} is VALID [2020-07-11 01:00:28,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {25594#true} havoc ~lk3~0; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 16: Hoare triple {25594#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {25594#true} ~p4~0 := #t~nondet3; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {25594#true} havoc #t~nondet3; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {25594#true} havoc ~lk4~0; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {25594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,649 INFO L280 TraceCheckUtils]: 21: Hoare triple {25594#true} ~p5~0 := #t~nondet4; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {25594#true} havoc #t~nondet4; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {25594#true} havoc ~lk5~0; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {25594#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {25594#true} ~p6~0 := #t~nondet5; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 26: Hoare triple {25594#true} havoc #t~nondet5; {25594#true} is VALID [2020-07-11 01:00:28,650 INFO L280 TraceCheckUtils]: 27: Hoare triple {25594#true} havoc ~lk6~0; {25594#true} is VALID [2020-07-11 01:00:28,651 INFO L280 TraceCheckUtils]: 28: Hoare triple {25594#true} havoc ~cond~0; {25594#true} is VALID [2020-07-11 01:00:28,651 INFO L280 TraceCheckUtils]: 29: Hoare triple {25594#true} assume !false; {25594#true} is VALID [2020-07-11 01:00:28,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {25594#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {25594#true} is VALID [2020-07-11 01:00:28,651 INFO L280 TraceCheckUtils]: 31: Hoare triple {25594#true} ~cond~0 := #t~nondet6; {25594#true} is VALID [2020-07-11 01:00:28,652 INFO L280 TraceCheckUtils]: 32: Hoare triple {25594#true} havoc #t~nondet6; {25594#true} is VALID [2020-07-11 01:00:28,652 INFO L280 TraceCheckUtils]: 33: Hoare triple {25594#true} assume !(0 == ~cond~0); {25594#true} is VALID [2020-07-11 01:00:28,652 INFO L280 TraceCheckUtils]: 34: Hoare triple {25594#true} ~lk1~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,652 INFO L280 TraceCheckUtils]: 35: Hoare triple {25594#true} ~lk2~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,652 INFO L280 TraceCheckUtils]: 36: Hoare triple {25594#true} ~lk3~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 37: Hoare triple {25594#true} ~lk4~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 38: Hoare triple {25594#true} ~lk5~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 39: Hoare triple {25594#true} ~lk6~0 := 0; {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 40: Hoare triple {25594#true} assume !(0 != ~p1~0); {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 41: Hoare triple {25594#true} assume !(0 != ~p2~0); {25594#true} is VALID [2020-07-11 01:00:28,653 INFO L280 TraceCheckUtils]: 42: Hoare triple {25594#true} assume !(0 != ~p3~0); {25594#true} is VALID [2020-07-11 01:00:28,654 INFO L280 TraceCheckUtils]: 43: Hoare triple {25594#true} assume !(0 != ~p4~0); {25594#true} is VALID [2020-07-11 01:00:28,654 INFO L280 TraceCheckUtils]: 44: Hoare triple {25594#true} assume 0 != ~p5~0; {25594#true} is VALID [2020-07-11 01:00:28,664 INFO L280 TraceCheckUtils]: 45: Hoare triple {25594#true} ~lk5~0 := 1; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,665 INFO L280 TraceCheckUtils]: 46: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,665 INFO L280 TraceCheckUtils]: 47: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,665 INFO L280 TraceCheckUtils]: 48: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,666 INFO L280 TraceCheckUtils]: 49: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,666 INFO L280 TraceCheckUtils]: 50: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,667 INFO L280 TraceCheckUtils]: 51: Hoare triple {25598#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:28,667 INFO L280 TraceCheckUtils]: 52: Hoare triple {25598#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {25595#false} is VALID [2020-07-11 01:00:28,667 INFO L280 TraceCheckUtils]: 53: Hoare triple {25595#false} assume !false; {25595#false} is VALID [2020-07-11 01:00:28,668 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-11 01:00:28,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370065305] [2020-07-11 01:00:28,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:28,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:28,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970542289] [2020-07-11 01:00:28,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-11 01:00:28,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:28,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:28,725 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-11 01:00:28,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:28,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:28,726 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-11 01:00:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:31,609 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-11 01:00:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:31,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-11 01:00:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-11 01:00:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-11 01:00:31,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-11 01:00:31,721 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-11 01:00:31,784 INFO L225 Difference]: With dead ends: 1315 [2020-07-11 01:00:31,784 INFO L226 Difference]: Without dead ends: 1313 [2020-07-11 01:00:31,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-11 01:00:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-11 01:00:34,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:34,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand 1103 states. [2020-07-11 01:00:34,075 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand 1103 states. [2020-07-11 01:00:34,075 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand 1103 states. [2020-07-11 01:00:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:34,128 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-11 01:00:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-11 01:00:34,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:34,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:34,130 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1313 states. [2020-07-11 01:00:34,130 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1313 states. [2020-07-11 01:00:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:34,208 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-11 01:00:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-11 01:00:34,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:34,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:34,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:34,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-11 01:00:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-11 01:00:34,256 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-11 01:00:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:34,256 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-11 01:00:34,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:34,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1358 transitions. [2020-07-11 01:00:35,943 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-11 01:00:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-11 01:00:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 01:00:35,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:35,945 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-11 01:00:35,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:00:35,946 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-11 01:00:35,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:35,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591991272] [2020-07-11 01:00:35,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:35,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-11 01:00:35,995 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-11 01:00:35,995 INFO L263 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2020-07-11 01:00:35,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-11 01:00:35,995 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-11 01:00:35,996 INFO L263 TraceCheckUtils]: 3: Hoare triple {33063#true} call #t~ret7 := main(); {33063#true} is VALID [2020-07-11 01:00:35,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {33063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {33063#true} ~p1~0 := #t~nondet0; {33063#true} is VALID [2020-07-11 01:00:35,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {33063#true} havoc #t~nondet0; {33063#true} is VALID [2020-07-11 01:00:35,996 INFO L280 TraceCheckUtils]: 7: Hoare triple {33063#true} havoc ~lk1~0; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {33063#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {33063#true} ~p2~0 := #t~nondet1; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 10: Hoare triple {33063#true} havoc #t~nondet1; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {33063#true} havoc ~lk2~0; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 12: Hoare triple {33063#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,997 INFO L280 TraceCheckUtils]: 13: Hoare triple {33063#true} ~p3~0 := #t~nondet2; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 14: Hoare triple {33063#true} havoc #t~nondet2; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 15: Hoare triple {33063#true} havoc ~lk3~0; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 16: Hoare triple {33063#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 17: Hoare triple {33063#true} ~p4~0 := #t~nondet3; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {33063#true} havoc #t~nondet3; {33063#true} is VALID [2020-07-11 01:00:35,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {33063#true} havoc ~lk4~0; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 20: Hoare triple {33063#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {33063#true} ~p5~0 := #t~nondet4; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {33063#true} havoc #t~nondet4; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 23: Hoare triple {33063#true} havoc ~lk5~0; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {33063#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:35,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {33063#true} ~p6~0 := #t~nondet5; {33063#true} is VALID [2020-07-11 01:00:36,000 INFO L280 TraceCheckUtils]: 26: Hoare triple {33063#true} havoc #t~nondet5; {33063#true} is VALID [2020-07-11 01:00:36,000 INFO L280 TraceCheckUtils]: 27: Hoare triple {33063#true} havoc ~lk6~0; {33063#true} is VALID [2020-07-11 01:00:36,000 INFO L280 TraceCheckUtils]: 28: Hoare triple {33063#true} havoc ~cond~0; {33063#true} is VALID [2020-07-11 01:00:36,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {33063#true} assume !false; {33063#true} is VALID [2020-07-11 01:00:36,000 INFO L280 TraceCheckUtils]: 30: Hoare triple {33063#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 31: Hoare triple {33063#true} ~cond~0 := #t~nondet6; {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 32: Hoare triple {33063#true} havoc #t~nondet6; {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 33: Hoare triple {33063#true} assume !(0 == ~cond~0); {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 34: Hoare triple {33063#true} ~lk1~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 35: Hoare triple {33063#true} ~lk2~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,001 INFO L280 TraceCheckUtils]: 36: Hoare triple {33063#true} ~lk3~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,002 INFO L280 TraceCheckUtils]: 37: Hoare triple {33063#true} ~lk4~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,002 INFO L280 TraceCheckUtils]: 38: Hoare triple {33063#true} ~lk5~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,002 INFO L280 TraceCheckUtils]: 39: Hoare triple {33063#true} ~lk6~0 := 0; {33063#true} is VALID [2020-07-11 01:00:36,002 INFO L280 TraceCheckUtils]: 40: Hoare triple {33063#true} assume !(0 != ~p1~0); {33063#true} is VALID [2020-07-11 01:00:36,002 INFO L280 TraceCheckUtils]: 41: Hoare triple {33063#true} assume !(0 != ~p2~0); {33063#true} is VALID [2020-07-11 01:00:36,003 INFO L280 TraceCheckUtils]: 42: Hoare triple {33063#true} assume !(0 != ~p3~0); {33063#true} is VALID [2020-07-11 01:00:36,003 INFO L280 TraceCheckUtils]: 43: Hoare triple {33063#true} assume !(0 != ~p4~0); {33063#true} is VALID [2020-07-11 01:00:36,003 INFO L280 TraceCheckUtils]: 44: Hoare triple {33063#true} assume !(0 != ~p5~0); {33063#true} is VALID [2020-07-11 01:00:36,003 INFO L280 TraceCheckUtils]: 45: Hoare triple {33063#true} assume !(0 != ~p6~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,004 INFO L280 TraceCheckUtils]: 46: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,004 INFO L280 TraceCheckUtils]: 47: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,004 INFO L280 TraceCheckUtils]: 48: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,005 INFO L280 TraceCheckUtils]: 49: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,005 INFO L280 TraceCheckUtils]: 50: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-11 01:00:36,006 INFO L280 TraceCheckUtils]: 51: Hoare triple {33067#(= 0 main_~p6~0)} assume 0 != ~p6~0; {33064#false} is VALID [2020-07-11 01:00:36,006 INFO L280 TraceCheckUtils]: 52: Hoare triple {33064#false} assume 1 != ~lk6~0; {33064#false} is VALID [2020-07-11 01:00:36,006 INFO L280 TraceCheckUtils]: 53: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2020-07-11 01:00:36,007 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-11 01:00:36,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591991272] [2020-07-11 01:00:36,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:36,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:36,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410658193] [2020-07-11 01:00:36,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-11 01:00:36,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:36,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:36,054 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-11 01:00:36,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:36,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:36,055 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-11 01:00:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:41,685 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-11 01:00:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:41,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-11 01:00:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-11 01:00:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-11 01:00:41,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-11 01:00:41,858 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-11 01:00:41,906 INFO L225 Difference]: With dead ends: 3153 [2020-07-11 01:00:41,907 INFO L226 Difference]: Without dead ends: 1103 [2020-07-11 01:00:41,909 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-11 01:00:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-11 01:00:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-11 01:00:44,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:44,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1103 states. Second operand 1103 states. [2020-07-11 01:00:44,263 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-11 01:00:44,263 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-11 01:00:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:44,308 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-11 01:00:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-11 01:00:44,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:44,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:44,309 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-11 01:00:44,310 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-11 01:00:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:44,357 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-11 01:00:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-11 01:00:44,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:44,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:44,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:44,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-11 01:00:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-11 01:00:44,403 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-11 01:00:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:44,403 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-11 01:00:44,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:44,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1294 transitions. [2020-07-11 01:00:46,020 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-11 01:00:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-11 01:00:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 01:00:46,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:46,022 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-11 01:00:46,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:00:46,023 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-11 01:00:46,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:46,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727143181] [2020-07-11 01:00:46,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:46,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-11 01:00:46,076 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-11 01:00:46,077 INFO L263 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2020-07-11 01:00:46,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-11 01:00:46,077 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-11 01:00:46,077 INFO L263 TraceCheckUtils]: 3: Hoare triple {43788#true} call #t~ret7 := main(); {43788#true} is VALID [2020-07-11 01:00:46,077 INFO L280 TraceCheckUtils]: 4: Hoare triple {43788#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,078 INFO L280 TraceCheckUtils]: 5: Hoare triple {43788#true} ~p1~0 := #t~nondet0; {43788#true} is VALID [2020-07-11 01:00:46,078 INFO L280 TraceCheckUtils]: 6: Hoare triple {43788#true} havoc #t~nondet0; {43788#true} is VALID [2020-07-11 01:00:46,078 INFO L280 TraceCheckUtils]: 7: Hoare triple {43788#true} havoc ~lk1~0; {43788#true} is VALID [2020-07-11 01:00:46,078 INFO L280 TraceCheckUtils]: 8: Hoare triple {43788#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,079 INFO L280 TraceCheckUtils]: 9: Hoare triple {43788#true} ~p2~0 := #t~nondet1; {43788#true} is VALID [2020-07-11 01:00:46,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {43788#true} havoc #t~nondet1; {43788#true} is VALID [2020-07-11 01:00:46,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {43788#true} havoc ~lk2~0; {43788#true} is VALID [2020-07-11 01:00:46,079 INFO L280 TraceCheckUtils]: 12: Hoare triple {43788#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,079 INFO L280 TraceCheckUtils]: 13: Hoare triple {43788#true} ~p3~0 := #t~nondet2; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 14: Hoare triple {43788#true} havoc #t~nondet2; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {43788#true} havoc ~lk3~0; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 16: Hoare triple {43788#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 17: Hoare triple {43788#true} ~p4~0 := #t~nondet3; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 18: Hoare triple {43788#true} havoc #t~nondet3; {43788#true} is VALID [2020-07-11 01:00:46,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {43788#true} havoc ~lk4~0; {43788#true} is VALID [2020-07-11 01:00:46,081 INFO L280 TraceCheckUtils]: 20: Hoare triple {43788#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,081 INFO L280 TraceCheckUtils]: 21: Hoare triple {43788#true} ~p5~0 := #t~nondet4; {43788#true} is VALID [2020-07-11 01:00:46,081 INFO L280 TraceCheckUtils]: 22: Hoare triple {43788#true} havoc #t~nondet4; {43788#true} is VALID [2020-07-11 01:00:46,081 INFO L280 TraceCheckUtils]: 23: Hoare triple {43788#true} havoc ~lk5~0; {43788#true} is VALID [2020-07-11 01:00:46,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {43788#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 25: Hoare triple {43788#true} ~p6~0 := #t~nondet5; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 26: Hoare triple {43788#true} havoc #t~nondet5; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 27: Hoare triple {43788#true} havoc ~lk6~0; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 28: Hoare triple {43788#true} havoc ~cond~0; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 29: Hoare triple {43788#true} assume !false; {43788#true} is VALID [2020-07-11 01:00:46,082 INFO L280 TraceCheckUtils]: 30: Hoare triple {43788#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {43788#true} is VALID [2020-07-11 01:00:46,083 INFO L280 TraceCheckUtils]: 31: Hoare triple {43788#true} ~cond~0 := #t~nondet6; {43788#true} is VALID [2020-07-11 01:00:46,083 INFO L280 TraceCheckUtils]: 32: Hoare triple {43788#true} havoc #t~nondet6; {43788#true} is VALID [2020-07-11 01:00:46,083 INFO L280 TraceCheckUtils]: 33: Hoare triple {43788#true} assume !(0 == ~cond~0); {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 34: Hoare triple {43788#true} ~lk1~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 35: Hoare triple {43788#true} ~lk2~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 36: Hoare triple {43788#true} ~lk3~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 37: Hoare triple {43788#true} ~lk4~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 38: Hoare triple {43788#true} ~lk5~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,084 INFO L280 TraceCheckUtils]: 39: Hoare triple {43788#true} ~lk6~0 := 0; {43788#true} is VALID [2020-07-11 01:00:46,085 INFO L280 TraceCheckUtils]: 40: Hoare triple {43788#true} assume !(0 != ~p1~0); {43788#true} is VALID [2020-07-11 01:00:46,085 INFO L280 TraceCheckUtils]: 41: Hoare triple {43788#true} assume !(0 != ~p2~0); {43788#true} is VALID [2020-07-11 01:00:46,085 INFO L280 TraceCheckUtils]: 42: Hoare triple {43788#true} assume !(0 != ~p3~0); {43788#true} is VALID [2020-07-11 01:00:46,085 INFO L280 TraceCheckUtils]: 43: Hoare triple {43788#true} assume !(0 != ~p4~0); {43788#true} is VALID [2020-07-11 01:00:46,085 INFO L280 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 != ~p5~0); {43788#true} is VALID [2020-07-11 01:00:46,086 INFO L280 TraceCheckUtils]: 45: Hoare triple {43788#true} assume 0 != ~p6~0; {43788#true} is VALID [2020-07-11 01:00:46,086 INFO L280 TraceCheckUtils]: 46: Hoare triple {43788#true} ~lk6~0 := 1; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,087 INFO L280 TraceCheckUtils]: 47: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,088 INFO L280 TraceCheckUtils]: 48: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,088 INFO L280 TraceCheckUtils]: 49: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,089 INFO L280 TraceCheckUtils]: 50: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,089 INFO L280 TraceCheckUtils]: 51: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,090 INFO L280 TraceCheckUtils]: 52: Hoare triple {43792#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:00:46,090 INFO L280 TraceCheckUtils]: 53: Hoare triple {43792#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {43789#false} is VALID [2020-07-11 01:00:46,090 INFO L280 TraceCheckUtils]: 54: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2020-07-11 01:00:46,093 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-11 01:00:46,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727143181] [2020-07-11 01:00:46,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:46,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:46,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586854085] [2020-07-11 01:00:46,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-11 01:00:46,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:46,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:46,140 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-11 01:00:46,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:46,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:46,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:46,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:46,141 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-11 01:00:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,817 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-11 01:00:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:48,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-11 01:00:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-11 01:00:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-11 01:00:48,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-11 01:00:48,895 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-11 01:00:48,895 INFO L225 Difference]: With dead ends: 1103 [2020-07-11 01:00:48,895 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:00:48,898 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-11 01:00:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:00:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:00:48,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:48,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:48,898 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:48,899 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,899 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:00:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:48,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:48,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:48,900 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:48,900 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:00:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:48,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:48,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:48,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:48,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:00:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:00:48,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-11 01:00:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:48,902 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:00:48,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:48,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:00:48,902 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-11 01:00:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:48,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:48,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:00:48,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:00:49,343 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:00:50,123 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:50,454 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:00:50,877 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:00:51,888 WARN L193 SmtUtils]: Spent 924.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:00:52,032 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:52,299 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:52,696 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:00:53,039 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:00:53,207 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:00:53,485 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:00:53,850 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,996 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:00:53,997 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-11 01:00:53,997 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-11 01:00:53,997 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 01:00:53,997 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-11 01:00:53,998 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-11 01:00:53,998 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-11 01:00:53,998 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 01:00:53,998 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-11 01:00:53,998 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-11 01:00:53,999 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-11 01:00:53,999 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 01:00:53,999 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 01:00:53,999 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 01:00:53,999 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-11 01:00:53,999 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-11 01:00:53,999 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-11 01:00:54,000 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-11 01:00:54,000 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 01:00:54,000 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-11 01:00:54,000 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 01:00:54,000 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-11 01:00:54,000 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-11 01:00:54,000 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-11 01:00:54,001 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 01:00:54,001 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-11 01:00:54,001 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-11 01:00:54,001 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-11 01:00:54,001 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-11 01:00:54,001 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-11 01:00:54,001 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-11 01:00:54,002 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-11 01:00:54,002 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-11 01:00:54,002 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 01:00:54,002 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-11 01:00:54,002 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-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-11 01:00:54,003 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-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 01:00:54,003 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 01:00:54,003 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-11 01:00:54,004 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-11 01:00:54,004 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-11 01:00:54,004 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 01:00:54,004 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-11 01:00:54,004 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-11 01:00:54,004 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-11 01:00:54,005 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-11 01:00:54,005 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 01:00:54,005 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-11 01:00:54,005 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-11 01:00:54,006 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-11 01:00:54,006 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 01:00:54,006 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-11 01:00:54,007 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-11 01:00:54,007 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-11 01:00:54,007 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-11 01:00:54,007 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-11 01:00:54,007 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-11 01:00:54,007 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-11 01:00:54,008 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-11 01:00:54,008 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-11 01:00:54,008 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-11 01:00:54,008 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-11 01:00:54,008 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-11 01:00:54,009 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:00:54,009 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 01:00:54,009 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 01:00:54,009 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 01:00:54,009 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 01:00:54,070 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-11 01:00:54,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:00:54 BoogieIcfgContainer [2020-07-11 01:00:54,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:00:54,090 INFO L168 Benchmark]: Toolchain (without parser) took 50236.82 ms. Allocated memory was 137.9 MB in the beginning and 546.3 MB in the end (delta: 408.4 MB). Free memory was 101.8 MB in the beginning and 413.8 MB in the end (delta: -312.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,091 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.84 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,092 INFO L168 Benchmark]: Boogie Preprocessor took 129.63 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 180.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,093 INFO L168 Benchmark]: RCFGBuilder took 632.13 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 150.7 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,097 INFO L168 Benchmark]: TraceAbstraction took 49154.40 ms. Allocated memory was 201.9 MB in the beginning and 546.3 MB in the end (delta: 344.5 MB). Free memory was 150.0 MB in the beginning and 413.8 MB in the end (delta: -263.8 MB). Peak memory consumption was 80.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:54,100 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.18 ms. Allocated memory is still 137.9 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.84 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.63 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 180.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 632.13 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 150.7 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49154.40 ms. Allocated memory was 201.9 MB in the beginning and 546.3 MB in the end (delta: 344.5 MB). Free memory was 150.0 MB in the beginning and 413.8 MB in the end (delta: -263.8 MB). Peak memory consumption was 80.7 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: 43.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, 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.0s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 39212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...