/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:06:48,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:06:48,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:06:48,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:06:48,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:06:48,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:06:48,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:06:48,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:06:48,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:06:48,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:06:48,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:06:48,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:06:48,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:06:48,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:06:48,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:06:48,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:06:48,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:06:48,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:06:48,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:06:48,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:06:48,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:06:48,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:06:48,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:06:48,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:06:48,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:06:48,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:06:48,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:06:48,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:06:48,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:06:48,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:06:48,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:06:48,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:06:48,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:06:48,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:06:48,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:06:48,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:06:48,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:06:48,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:06:48,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:06:48,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:06:48,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:06:48,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:06:48,767 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:06:48,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:06:48,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:06:48,769 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:06:48,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:06:48,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:06:48,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:06:48,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:06:48,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:06:48,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:06:48,770 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:06:48,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:06:48,771 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:06:48,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:06:48,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:06:48,775 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:06:48,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:06:48,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:06:48,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:06:48,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:06:48,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:06:48,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:06:48,777 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-18 05:06:49,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:06:49,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:06:49,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:06:49,150 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:06:49,150 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:06:49,151 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-07-18 05:06:49,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab97828/189ad34fb77c4412a142f4e4dfcb94f0/FLAGacb2b1d07 [2020-07-18 05:06:49,651 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:06:49,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-18 05:06:49,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab97828/189ad34fb77c4412a142f4e4dfcb94f0/FLAGacb2b1d07 [2020-07-18 05:06:50,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab97828/189ad34fb77c4412a142f4e4dfcb94f0 [2020-07-18 05:06:50,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:06:50,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:06:50,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:06:50,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:06:50,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:06:50,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a160cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50, skipping insertion in model container [2020-07-18 05:06:50,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:06:50,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:06:50,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:06:50,275 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:06:50,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:06:50,311 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:06:50,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50 WrapperNode [2020-07-18 05:06:50,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:06:50,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:06:50,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:06:50,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:06:50,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (1/1) ... [2020-07-18 05:06:50,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:06:50,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:06:50,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:06:50,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:06:50,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (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-18 05:06:50,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:06:50,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:06:50,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:06:50,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:06:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:06:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:06:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:06:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:06:50,993 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:06:50,993 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 05:06:50,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:06:50 BoogieIcfgContainer [2020-07-18 05:06:50,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:06:50,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:06:50,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:06:51,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:06:51,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:06:50" (1/3) ... [2020-07-18 05:06:51,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fba4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:06:51, skipping insertion in model container [2020-07-18 05:06:51,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:06:50" (2/3) ... [2020-07-18 05:06:51,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fba4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:06:51, skipping insertion in model container [2020-07-18 05:06:51,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:06:50" (3/3) ... [2020-07-18 05:06:51,006 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-18 05:06:51,017 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:06:51,025 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:06:51,039 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:06:51,062 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:06:51,062 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:06:51,062 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:06:51,063 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:06:51,063 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:06:51,063 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:06:51,063 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:06:51,064 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:06:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-18 05:06:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 05:06:51,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:51,098 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] [2020-07-18 05:06:51,098 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-07-18 05:06:51,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:51,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405677587] [2020-07-18 05:06:51,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:51,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 05:06:51,336 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-18 05:06:51,338 INFO L263 TraceCheckUtils]: 0: Hoare triple {71#true} call ULTIMATE.init(); {71#true} is VALID [2020-07-18 05:06:51,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 05:06:51,339 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-18 05:06:51,340 INFO L263 TraceCheckUtils]: 3: Hoare triple {71#true} call #t~ret6 := main(); {71#true} is VALID [2020-07-18 05:06:51,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#true} ~p1~0 := #t~nondet0; {71#true} is VALID [2020-07-18 05:06:51,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {71#true} havoc #t~nondet0; {71#true} is VALID [2020-07-18 05:06:51,342 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} havoc ~lk1~0; {71#true} is VALID [2020-07-18 05:06:51,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {71#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {71#true} ~p2~0 := #t~nondet1; {71#true} is VALID [2020-07-18 05:06:51,343 INFO L280 TraceCheckUtils]: 10: Hoare triple {71#true} havoc #t~nondet1; {71#true} is VALID [2020-07-18 05:06:51,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {71#true} havoc ~lk2~0; {71#true} is VALID [2020-07-18 05:06:51,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {71#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {71#true} ~p3~0 := #t~nondet2; {71#true} is VALID [2020-07-18 05:06:51,344 INFO L280 TraceCheckUtils]: 14: Hoare triple {71#true} havoc #t~nondet2; {71#true} is VALID [2020-07-18 05:06:51,345 INFO L280 TraceCheckUtils]: 15: Hoare triple {71#true} havoc ~lk3~0; {71#true} is VALID [2020-07-18 05:06:51,345 INFO L280 TraceCheckUtils]: 16: Hoare triple {71#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#true} ~p4~0 := #t~nondet3; {71#true} is VALID [2020-07-18 05:06:51,346 INFO L280 TraceCheckUtils]: 18: Hoare triple {71#true} havoc #t~nondet3; {71#true} is VALID [2020-07-18 05:06:51,346 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#true} havoc ~lk4~0; {71#true} is VALID [2020-07-18 05:06:51,346 INFO L280 TraceCheckUtils]: 20: Hoare triple {71#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {71#true} ~p5~0 := #t~nondet4; {71#true} is VALID [2020-07-18 05:06:51,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {71#true} havoc #t~nondet4; {71#true} is VALID [2020-07-18 05:06:51,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {71#true} havoc ~lk5~0; {71#true} is VALID [2020-07-18 05:06:51,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {71#true} havoc ~cond~0; {71#true} is VALID [2020-07-18 05:06:51,348 INFO L280 TraceCheckUtils]: 25: Hoare triple {71#true} assume !false; {71#true} is VALID [2020-07-18 05:06:51,349 INFO L280 TraceCheckUtils]: 26: Hoare triple {71#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {71#true} is VALID [2020-07-18 05:06:51,349 INFO L280 TraceCheckUtils]: 27: Hoare triple {71#true} ~cond~0 := #t~nondet5; {71#true} is VALID [2020-07-18 05:06:51,349 INFO L280 TraceCheckUtils]: 28: Hoare triple {71#true} havoc #t~nondet5; {71#true} is VALID [2020-07-18 05:06:51,350 INFO L280 TraceCheckUtils]: 29: Hoare triple {71#true} assume !(0 == ~cond~0); {71#true} is VALID [2020-07-18 05:06:51,350 INFO L280 TraceCheckUtils]: 30: Hoare triple {71#true} ~lk1~0 := 0; {71#true} is VALID [2020-07-18 05:06:51,350 INFO L280 TraceCheckUtils]: 31: Hoare triple {71#true} ~lk2~0 := 0; {71#true} is VALID [2020-07-18 05:06:51,351 INFO L280 TraceCheckUtils]: 32: Hoare triple {71#true} ~lk3~0 := 0; {71#true} is VALID [2020-07-18 05:06:51,351 INFO L280 TraceCheckUtils]: 33: Hoare triple {71#true} ~lk4~0 := 0; {71#true} is VALID [2020-07-18 05:06:51,351 INFO L280 TraceCheckUtils]: 34: Hoare triple {71#true} ~lk5~0 := 0; {71#true} is VALID [2020-07-18 05:06:51,353 INFO L280 TraceCheckUtils]: 35: Hoare triple {71#true} assume !(0 != ~p1~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 05:06:51,353 INFO L280 TraceCheckUtils]: 36: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 05:06:51,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 05:06:51,366 INFO L280 TraceCheckUtils]: 38: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 05:06:51,367 INFO L280 TraceCheckUtils]: 39: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 05:06:51,369 INFO L280 TraceCheckUtils]: 40: Hoare triple {75#(= 0 main_~p1~0)} assume 0 != ~p1~0; {72#false} is VALID [2020-07-18 05:06:51,369 INFO L280 TraceCheckUtils]: 41: Hoare triple {72#false} assume 1 != ~lk1~0; {72#false} is VALID [2020-07-18 05:06:51,370 INFO L280 TraceCheckUtils]: 42: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-18 05:06:51,380 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-18 05:06:51,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405677587] [2020-07-18 05:06:51,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:51,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:51,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605919715] [2020-07-18 05:06:51,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-18 05:06:51,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:51,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:51,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:51,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:51,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:51,490 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-07-18 05:06:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:51,842 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-07-18 05:06:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:51,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-18 05:06:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-18 05:06:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-18 05:06:51,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-18 05:06:52,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:52,114 INFO L225 Difference]: With dead ends: 147 [2020-07-18 05:06:52,114 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 05:06:52,119 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-18 05:06:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 05:06:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-07-18 05:06:52,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:52,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2020-07-18 05:06:52,238 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2020-07-18 05:06:52,239 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2020-07-18 05:06:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:52,248 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-18 05:06:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-18 05:06:52,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:52,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:52,250 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2020-07-18 05:06:52,250 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2020-07-18 05:06:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:52,258 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-18 05:06:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-18 05:06:52,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:52,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:52,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:52,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 05:06:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-07-18 05:06:52,268 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-07-18 05:06:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:52,269 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-07-18 05:06:52,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:52,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 120 transitions. [2020-07-18 05:06:52,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-07-18 05:06:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 05:06:52,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:52,414 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] [2020-07-18 05:06:52,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:06:52,415 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-07-18 05:06:52,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:52,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928841242] [2020-07-18 05:06:52,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:52,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-18 05:06:52,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-18 05:06:52,476 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-18 05:06:52,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-18 05:06:52,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-18 05:06:52,477 INFO L263 TraceCheckUtils]: 3: Hoare triple {752#true} call #t~ret6 := main(); {752#true} is VALID [2020-07-18 05:06:52,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {752#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,477 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} ~p1~0 := #t~nondet0; {752#true} is VALID [2020-07-18 05:06:52,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} havoc #t~nondet0; {752#true} is VALID [2020-07-18 05:06:52,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} havoc ~lk1~0; {752#true} is VALID [2020-07-18 05:06:52,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} ~p2~0 := #t~nondet1; {752#true} is VALID [2020-07-18 05:06:52,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {752#true} havoc #t~nondet1; {752#true} is VALID [2020-07-18 05:06:52,479 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} havoc ~lk2~0; {752#true} is VALID [2020-07-18 05:06:52,480 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} ~p3~0 := #t~nondet2; {752#true} is VALID [2020-07-18 05:06:52,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} havoc #t~nondet2; {752#true} is VALID [2020-07-18 05:06:52,481 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} havoc ~lk3~0; {752#true} is VALID [2020-07-18 05:06:52,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,482 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} ~p4~0 := #t~nondet3; {752#true} is VALID [2020-07-18 05:06:52,482 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} havoc #t~nondet3; {752#true} is VALID [2020-07-18 05:06:52,482 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} havoc ~lk4~0; {752#true} is VALID [2020-07-18 05:06:52,483 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,483 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} ~p5~0 := #t~nondet4; {752#true} is VALID [2020-07-18 05:06:52,483 INFO L280 TraceCheckUtils]: 22: Hoare triple {752#true} havoc #t~nondet4; {752#true} is VALID [2020-07-18 05:06:52,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {752#true} havoc ~lk5~0; {752#true} is VALID [2020-07-18 05:06:52,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {752#true} havoc ~cond~0; {752#true} is VALID [2020-07-18 05:06:52,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {752#true} assume !false; {752#true} is VALID [2020-07-18 05:06:52,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {752#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {752#true} is VALID [2020-07-18 05:06:52,485 INFO L280 TraceCheckUtils]: 27: Hoare triple {752#true} ~cond~0 := #t~nondet5; {752#true} is VALID [2020-07-18 05:06:52,485 INFO L280 TraceCheckUtils]: 28: Hoare triple {752#true} havoc #t~nondet5; {752#true} is VALID [2020-07-18 05:06:52,486 INFO L280 TraceCheckUtils]: 29: Hoare triple {752#true} assume !(0 == ~cond~0); {752#true} is VALID [2020-07-18 05:06:52,486 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~lk1~0 := 0; {752#true} is VALID [2020-07-18 05:06:52,486 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} ~lk2~0 := 0; {752#true} is VALID [2020-07-18 05:06:52,487 INFO L280 TraceCheckUtils]: 32: Hoare triple {752#true} ~lk3~0 := 0; {752#true} is VALID [2020-07-18 05:06:52,487 INFO L280 TraceCheckUtils]: 33: Hoare triple {752#true} ~lk4~0 := 0; {752#true} is VALID [2020-07-18 05:06:52,487 INFO L280 TraceCheckUtils]: 34: Hoare triple {752#true} ~lk5~0 := 0; {752#true} is VALID [2020-07-18 05:06:52,488 INFO L280 TraceCheckUtils]: 35: Hoare triple {752#true} assume 0 != ~p1~0; {752#true} is VALID [2020-07-18 05:06:52,489 INFO L280 TraceCheckUtils]: 36: Hoare triple {752#true} ~lk1~0 := 1; {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,490 INFO L280 TraceCheckUtils]: 37: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,491 INFO L280 TraceCheckUtils]: 38: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,492 INFO L280 TraceCheckUtils]: 39: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,492 INFO L280 TraceCheckUtils]: 40: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,493 INFO L280 TraceCheckUtils]: 41: Hoare triple {756#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:06:52,494 INFO L280 TraceCheckUtils]: 42: Hoare triple {756#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {753#false} is VALID [2020-07-18 05:06:52,494 INFO L280 TraceCheckUtils]: 43: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-18 05:06:52,498 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-18 05:06:52,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928841242] [2020-07-18 05:06:52,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:52,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:52,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741333746] [2020-07-18 05:06:52,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 05:06:52,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:52,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:52,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:52,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:52,570 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-07-18 05:06:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:52,812 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-07-18 05:06:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:52,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 05:06:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-18 05:06:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-18 05:06:52,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-18 05:06:52,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:52,945 INFO L225 Difference]: With dead ends: 116 [2020-07-18 05:06:52,945 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 05:06:52,946 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-18 05:06:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 05:06:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-18 05:06:53,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:53,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-18 05:06:53,023 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-18 05:06:53,023 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-18 05:06:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:53,029 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-18 05:06:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-18 05:06:53,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:53,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:53,031 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-18 05:06:53,031 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-18 05:06:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:53,038 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-18 05:06:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-18 05:06:53,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:53,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:53,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:53,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 05:06:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-07-18 05:06:53,045 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-07-18 05:06:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:53,045 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-07-18 05:06:53,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:53,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2020-07-18 05:06:53,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-07-18 05:06:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 05:06:53,190 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:53,190 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] [2020-07-18 05:06:53,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:06:53,190 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-07-18 05:06:53,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:53,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958093811] [2020-07-18 05:06:53,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:53,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-18 05:06:53,255 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-18 05:06:53,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2020-07-18 05:06:53,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-18 05:06:53,256 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-18 05:06:53,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {1407#true} call #t~ret6 := main(); {1407#true} is VALID [2020-07-18 05:06:53,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {1407#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {1407#true} ~p1~0 := #t~nondet0; {1407#true} is VALID [2020-07-18 05:06:53,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {1407#true} havoc #t~nondet0; {1407#true} is VALID [2020-07-18 05:06:53,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#true} havoc ~lk1~0; {1407#true} is VALID [2020-07-18 05:06:53,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {1407#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {1407#true} ~p2~0 := #t~nondet1; {1407#true} is VALID [2020-07-18 05:06:53,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {1407#true} havoc #t~nondet1; {1407#true} is VALID [2020-07-18 05:06:53,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#true} havoc ~lk2~0; {1407#true} is VALID [2020-07-18 05:06:53,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {1407#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {1407#true} ~p3~0 := #t~nondet2; {1407#true} is VALID [2020-07-18 05:06:53,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {1407#true} havoc #t~nondet2; {1407#true} is VALID [2020-07-18 05:06:53,260 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#true} havoc ~lk3~0; {1407#true} is VALID [2020-07-18 05:06:53,260 INFO L280 TraceCheckUtils]: 16: Hoare triple {1407#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,261 INFO L280 TraceCheckUtils]: 17: Hoare triple {1407#true} ~p4~0 := #t~nondet3; {1407#true} is VALID [2020-07-18 05:06:53,261 INFO L280 TraceCheckUtils]: 18: Hoare triple {1407#true} havoc #t~nondet3; {1407#true} is VALID [2020-07-18 05:06:53,261 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#true} havoc ~lk4~0; {1407#true} is VALID [2020-07-18 05:06:53,261 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,262 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#true} ~p5~0 := #t~nondet4; {1407#true} is VALID [2020-07-18 05:06:53,262 INFO L280 TraceCheckUtils]: 22: Hoare triple {1407#true} havoc #t~nondet4; {1407#true} is VALID [2020-07-18 05:06:53,262 INFO L280 TraceCheckUtils]: 23: Hoare triple {1407#true} havoc ~lk5~0; {1407#true} is VALID [2020-07-18 05:06:53,263 INFO L280 TraceCheckUtils]: 24: Hoare triple {1407#true} havoc ~cond~0; {1407#true} is VALID [2020-07-18 05:06:53,263 INFO L280 TraceCheckUtils]: 25: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2020-07-18 05:06:53,263 INFO L280 TraceCheckUtils]: 26: Hoare triple {1407#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1407#true} is VALID [2020-07-18 05:06:53,263 INFO L280 TraceCheckUtils]: 27: Hoare triple {1407#true} ~cond~0 := #t~nondet5; {1407#true} is VALID [2020-07-18 05:06:53,264 INFO L280 TraceCheckUtils]: 28: Hoare triple {1407#true} havoc #t~nondet5; {1407#true} is VALID [2020-07-18 05:06:53,264 INFO L280 TraceCheckUtils]: 29: Hoare triple {1407#true} assume !(0 == ~cond~0); {1407#true} is VALID [2020-07-18 05:06:53,264 INFO L280 TraceCheckUtils]: 30: Hoare triple {1407#true} ~lk1~0 := 0; {1407#true} is VALID [2020-07-18 05:06:53,264 INFO L280 TraceCheckUtils]: 31: Hoare triple {1407#true} ~lk2~0 := 0; {1407#true} is VALID [2020-07-18 05:06:53,265 INFO L280 TraceCheckUtils]: 32: Hoare triple {1407#true} ~lk3~0 := 0; {1407#true} is VALID [2020-07-18 05:06:53,265 INFO L280 TraceCheckUtils]: 33: Hoare triple {1407#true} ~lk4~0 := 0; {1407#true} is VALID [2020-07-18 05:06:53,265 INFO L280 TraceCheckUtils]: 34: Hoare triple {1407#true} ~lk5~0 := 0; {1407#true} is VALID [2020-07-18 05:06:53,266 INFO L280 TraceCheckUtils]: 35: Hoare triple {1407#true} assume !(0 != ~p1~0); {1407#true} is VALID [2020-07-18 05:06:53,267 INFO L280 TraceCheckUtils]: 36: Hoare triple {1407#true} assume !(0 != ~p2~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 05:06:53,268 INFO L280 TraceCheckUtils]: 37: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 05:06:53,269 INFO L280 TraceCheckUtils]: 38: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 05:06:53,270 INFO L280 TraceCheckUtils]: 39: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 05:06:53,271 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 05:06:53,272 INFO L280 TraceCheckUtils]: 41: Hoare triple {1411#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1408#false} is VALID [2020-07-18 05:06:53,272 INFO L280 TraceCheckUtils]: 42: Hoare triple {1408#false} assume 1 != ~lk2~0; {1408#false} is VALID [2020-07-18 05:06:53,273 INFO L280 TraceCheckUtils]: 43: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2020-07-18 05:06:53,275 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-18 05:06:53,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958093811] [2020-07-18 05:06:53,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:53,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:53,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705239819] [2020-07-18 05:06:53,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 05:06:53,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:53,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:53,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:53,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:53,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:53,323 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-07-18 05:06:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:53,675 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-07-18 05:06:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:53,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 05:06:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-18 05:06:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-18 05:06:53,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-18 05:06:53,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:53,848 INFO L225 Difference]: With dead ends: 226 [2020-07-18 05:06:53,848 INFO L226 Difference]: Without dead ends: 157 [2020-07-18 05:06:53,849 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-18 05:06:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-18 05:06:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-07-18 05:06:54,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:54,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2020-07-18 05:06:54,003 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2020-07-18 05:06:54,003 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2020-07-18 05:06:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:54,016 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-18 05:06:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-18 05:06:54,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:54,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:54,018 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2020-07-18 05:06:54,018 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2020-07-18 05:06:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:54,032 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-18 05:06:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-18 05:06:54,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:54,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:54,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:54,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-18 05:06:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-07-18 05:06:54,046 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-07-18 05:06:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:54,047 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-07-18 05:06:54,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:54,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2020-07-18 05:06:54,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-07-18 05:06:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 05:06:54,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:54,259 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] [2020-07-18 05:06:54,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:06:54,259 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-07-18 05:06:54,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:54,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173142404] [2020-07-18 05:06:54,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:54,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-18 05:06:54,308 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-18 05:06:54,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2020-07-18 05:06:54,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-18 05:06:54,309 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-18 05:06:54,310 INFO L263 TraceCheckUtils]: 3: Hoare triple {2490#true} call #t~ret6 := main(); {2490#true} is VALID [2020-07-18 05:06:54,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {2490#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {2490#true} ~p1~0 := #t~nondet0; {2490#true} is VALID [2020-07-18 05:06:54,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {2490#true} havoc #t~nondet0; {2490#true} is VALID [2020-07-18 05:06:54,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {2490#true} havoc ~lk1~0; {2490#true} is VALID [2020-07-18 05:06:54,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#true} ~p2~0 := #t~nondet1; {2490#true} is VALID [2020-07-18 05:06:54,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {2490#true} havoc #t~nondet1; {2490#true} is VALID [2020-07-18 05:06:54,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {2490#true} havoc ~lk2~0; {2490#true} is VALID [2020-07-18 05:06:54,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,312 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#true} ~p3~0 := #t~nondet2; {2490#true} is VALID [2020-07-18 05:06:54,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {2490#true} havoc #t~nondet2; {2490#true} is VALID [2020-07-18 05:06:54,313 INFO L280 TraceCheckUtils]: 15: Hoare triple {2490#true} havoc ~lk3~0; {2490#true} is VALID [2020-07-18 05:06:54,313 INFO L280 TraceCheckUtils]: 16: Hoare triple {2490#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {2490#true} ~p4~0 := #t~nondet3; {2490#true} is VALID [2020-07-18 05:06:54,313 INFO L280 TraceCheckUtils]: 18: Hoare triple {2490#true} havoc #t~nondet3; {2490#true} is VALID [2020-07-18 05:06:54,314 INFO L280 TraceCheckUtils]: 19: Hoare triple {2490#true} havoc ~lk4~0; {2490#true} is VALID [2020-07-18 05:06:54,314 INFO L280 TraceCheckUtils]: 20: Hoare triple {2490#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {2490#true} ~p5~0 := #t~nondet4; {2490#true} is VALID [2020-07-18 05:06:54,319 INFO L280 TraceCheckUtils]: 22: Hoare triple {2490#true} havoc #t~nondet4; {2490#true} is VALID [2020-07-18 05:06:54,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {2490#true} havoc ~lk5~0; {2490#true} is VALID [2020-07-18 05:06:54,320 INFO L280 TraceCheckUtils]: 24: Hoare triple {2490#true} havoc ~cond~0; {2490#true} is VALID [2020-07-18 05:06:54,320 INFO L280 TraceCheckUtils]: 25: Hoare triple {2490#true} assume !false; {2490#true} is VALID [2020-07-18 05:06:54,321 INFO L280 TraceCheckUtils]: 26: Hoare triple {2490#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2490#true} is VALID [2020-07-18 05:06:54,321 INFO L280 TraceCheckUtils]: 27: Hoare triple {2490#true} ~cond~0 := #t~nondet5; {2490#true} is VALID [2020-07-18 05:06:54,321 INFO L280 TraceCheckUtils]: 28: Hoare triple {2490#true} havoc #t~nondet5; {2490#true} is VALID [2020-07-18 05:06:54,321 INFO L280 TraceCheckUtils]: 29: Hoare triple {2490#true} assume !(0 == ~cond~0); {2490#true} is VALID [2020-07-18 05:06:54,322 INFO L280 TraceCheckUtils]: 30: Hoare triple {2490#true} ~lk1~0 := 0; {2490#true} is VALID [2020-07-18 05:06:54,322 INFO L280 TraceCheckUtils]: 31: Hoare triple {2490#true} ~lk2~0 := 0; {2490#true} is VALID [2020-07-18 05:06:54,322 INFO L280 TraceCheckUtils]: 32: Hoare triple {2490#true} ~lk3~0 := 0; {2490#true} is VALID [2020-07-18 05:06:54,322 INFO L280 TraceCheckUtils]: 33: Hoare triple {2490#true} ~lk4~0 := 0; {2490#true} is VALID [2020-07-18 05:06:54,323 INFO L280 TraceCheckUtils]: 34: Hoare triple {2490#true} ~lk5~0 := 0; {2490#true} is VALID [2020-07-18 05:06:54,323 INFO L280 TraceCheckUtils]: 35: Hoare triple {2490#true} assume !(0 != ~p1~0); {2490#true} is VALID [2020-07-18 05:06:54,323 INFO L280 TraceCheckUtils]: 36: Hoare triple {2490#true} assume 0 != ~p2~0; {2490#true} is VALID [2020-07-18 05:06:54,324 INFO L280 TraceCheckUtils]: 37: Hoare triple {2490#true} ~lk2~0 := 1; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,325 INFO L280 TraceCheckUtils]: 38: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,325 INFO L280 TraceCheckUtils]: 39: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,326 INFO L280 TraceCheckUtils]: 40: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,326 INFO L280 TraceCheckUtils]: 41: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,330 INFO L280 TraceCheckUtils]: 42: Hoare triple {2494#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:06:54,332 INFO L280 TraceCheckUtils]: 43: Hoare triple {2494#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {2491#false} is VALID [2020-07-18 05:06:54,333 INFO L280 TraceCheckUtils]: 44: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2020-07-18 05:06:54,334 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-18 05:06:54,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173142404] [2020-07-18 05:06:54,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:54,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:54,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079369491] [2020-07-18 05:06:54,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 05:06:54,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:54,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:54,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:54,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:54,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:54,378 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-07-18 05:06:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:54,756 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-07-18 05:06:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:54,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 05:06:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-18 05:06:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-18 05:06:54,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-18 05:06:54,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:54,871 INFO L225 Difference]: With dead ends: 191 [2020-07-18 05:06:54,871 INFO L226 Difference]: Without dead ends: 189 [2020-07-18 05:06:54,872 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-18 05:06:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-18 05:06:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-07-18 05:06:55,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:55,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 155 states. [2020-07-18 05:06:55,053 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 155 states. [2020-07-18 05:06:55,054 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 155 states. [2020-07-18 05:06:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:55,071 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-18 05:06:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-18 05:06:55,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:55,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:55,072 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 189 states. [2020-07-18 05:06:55,072 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 189 states. [2020-07-18 05:06:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:55,079 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-18 05:06:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-18 05:06:55,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:55,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:55,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:55,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-18 05:06:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-07-18 05:06:55,085 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-07-18 05:06:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:55,086 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-07-18 05:06:55,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:55,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 198 transitions. [2020-07-18 05:06:55,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-07-18 05:06:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 05:06:55,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:55,292 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] [2020-07-18 05:06:55,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:06:55,292 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-07-18 05:06:55,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:55,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58179762] [2020-07-18 05:06:55,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:55,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-18 05:06:55,329 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-18 05:06:55,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {3567#true} call ULTIMATE.init(); {3567#true} is VALID [2020-07-18 05:06:55,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-18 05:06:55,330 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-18 05:06:55,330 INFO L263 TraceCheckUtils]: 3: Hoare triple {3567#true} call #t~ret6 := main(); {3567#true} is VALID [2020-07-18 05:06:55,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {3567#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {3567#true} ~p1~0 := #t~nondet0; {3567#true} is VALID [2020-07-18 05:06:55,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {3567#true} havoc #t~nondet0; {3567#true} is VALID [2020-07-18 05:06:55,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {3567#true} havoc ~lk1~0; {3567#true} is VALID [2020-07-18 05:06:55,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {3567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,332 INFO L280 TraceCheckUtils]: 9: Hoare triple {3567#true} ~p2~0 := #t~nondet1; {3567#true} is VALID [2020-07-18 05:06:55,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {3567#true} havoc #t~nondet1; {3567#true} is VALID [2020-07-18 05:06:55,333 INFO L280 TraceCheckUtils]: 11: Hoare triple {3567#true} havoc ~lk2~0; {3567#true} is VALID [2020-07-18 05:06:55,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {3567#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {3567#true} ~p3~0 := #t~nondet2; {3567#true} is VALID [2020-07-18 05:06:55,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {3567#true} havoc #t~nondet2; {3567#true} is VALID [2020-07-18 05:06:55,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {3567#true} havoc ~lk3~0; {3567#true} is VALID [2020-07-18 05:06:55,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {3567#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {3567#true} ~p4~0 := #t~nondet3; {3567#true} is VALID [2020-07-18 05:06:55,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {3567#true} havoc #t~nondet3; {3567#true} is VALID [2020-07-18 05:06:55,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {3567#true} havoc ~lk4~0; {3567#true} is VALID [2020-07-18 05:06:55,335 INFO L280 TraceCheckUtils]: 20: Hoare triple {3567#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,335 INFO L280 TraceCheckUtils]: 21: Hoare triple {3567#true} ~p5~0 := #t~nondet4; {3567#true} is VALID [2020-07-18 05:06:55,335 INFO L280 TraceCheckUtils]: 22: Hoare triple {3567#true} havoc #t~nondet4; {3567#true} is VALID [2020-07-18 05:06:55,336 INFO L280 TraceCheckUtils]: 23: Hoare triple {3567#true} havoc ~lk5~0; {3567#true} is VALID [2020-07-18 05:06:55,336 INFO L280 TraceCheckUtils]: 24: Hoare triple {3567#true} havoc ~cond~0; {3567#true} is VALID [2020-07-18 05:06:55,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {3567#true} assume !false; {3567#true} is VALID [2020-07-18 05:06:55,336 INFO L280 TraceCheckUtils]: 26: Hoare triple {3567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3567#true} is VALID [2020-07-18 05:06:55,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {3567#true} ~cond~0 := #t~nondet5; {3567#true} is VALID [2020-07-18 05:06:55,337 INFO L280 TraceCheckUtils]: 28: Hoare triple {3567#true} havoc #t~nondet5; {3567#true} is VALID [2020-07-18 05:06:55,337 INFO L280 TraceCheckUtils]: 29: Hoare triple {3567#true} assume !(0 == ~cond~0); {3567#true} is VALID [2020-07-18 05:06:55,337 INFO L280 TraceCheckUtils]: 30: Hoare triple {3567#true} ~lk1~0 := 0; {3567#true} is VALID [2020-07-18 05:06:55,338 INFO L280 TraceCheckUtils]: 31: Hoare triple {3567#true} ~lk2~0 := 0; {3567#true} is VALID [2020-07-18 05:06:55,338 INFO L280 TraceCheckUtils]: 32: Hoare triple {3567#true} ~lk3~0 := 0; {3567#true} is VALID [2020-07-18 05:06:55,338 INFO L280 TraceCheckUtils]: 33: Hoare triple {3567#true} ~lk4~0 := 0; {3567#true} is VALID [2020-07-18 05:06:55,338 INFO L280 TraceCheckUtils]: 34: Hoare triple {3567#true} ~lk5~0 := 0; {3567#true} is VALID [2020-07-18 05:06:55,339 INFO L280 TraceCheckUtils]: 35: Hoare triple {3567#true} assume !(0 != ~p1~0); {3567#true} is VALID [2020-07-18 05:06:55,339 INFO L280 TraceCheckUtils]: 36: Hoare triple {3567#true} assume !(0 != ~p2~0); {3567#true} is VALID [2020-07-18 05:06:55,340 INFO L280 TraceCheckUtils]: 37: Hoare triple {3567#true} assume !(0 != ~p3~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 05:06:55,340 INFO L280 TraceCheckUtils]: 38: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 05:06:55,341 INFO L280 TraceCheckUtils]: 39: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 05:06:55,342 INFO L280 TraceCheckUtils]: 40: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 05:06:55,342 INFO L280 TraceCheckUtils]: 41: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 05:06:55,343 INFO L280 TraceCheckUtils]: 42: Hoare triple {3571#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3568#false} is VALID [2020-07-18 05:06:55,343 INFO L280 TraceCheckUtils]: 43: Hoare triple {3568#false} assume 1 != ~lk3~0; {3568#false} is VALID [2020-07-18 05:06:55,343 INFO L280 TraceCheckUtils]: 44: Hoare triple {3568#false} assume !false; {3568#false} is VALID [2020-07-18 05:06:55,345 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-18 05:06:55,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58179762] [2020-07-18 05:06:55,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:55,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:55,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653197215] [2020-07-18 05:06:55,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 05:06:55,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:55,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:55,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:55,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:55,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:55,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:55,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:55,396 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-07-18 05:06:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:55,920 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-07-18 05:06:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:55,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 05:06:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:06:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:06:55,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 05:06:56,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:56,073 INFO L225 Difference]: With dead ends: 403 [2020-07-18 05:06:56,073 INFO L226 Difference]: Without dead ends: 273 [2020-07-18 05:06:56,076 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-18 05:06:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-18 05:06:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-07-18 05:06:56,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:56,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 271 states. [2020-07-18 05:06:56,447 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 271 states. [2020-07-18 05:06:56,448 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 271 states. [2020-07-18 05:06:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:56,465 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-18 05:06:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-18 05:06:56,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:56,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:56,467 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 273 states. [2020-07-18 05:06:56,467 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 273 states. [2020-07-18 05:06:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:56,477 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-18 05:06:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-18 05:06:56,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:56,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:56,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:56,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-07-18 05:06:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-07-18 05:06:56,488 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-07-18 05:06:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:56,488 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-07-18 05:06:56,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:56,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 271 states and 346 transitions. [2020-07-18 05:06:56,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-07-18 05:06:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 05:06:56,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:56,877 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] [2020-07-18 05:06:56,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:06:56,878 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:56,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-07-18 05:06:56,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:56,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141064954] [2020-07-18 05:06:56,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:56,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-18 05:06:56,932 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-18 05:06:56,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {5468#true} call ULTIMATE.init(); {5468#true} is VALID [2020-07-18 05:06:56,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-18 05:06:56,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-18 05:06:56,933 INFO L263 TraceCheckUtils]: 3: Hoare triple {5468#true} call #t~ret6 := main(); {5468#true} is VALID [2020-07-18 05:06:56,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {5468#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {5468#true} ~p1~0 := #t~nondet0; {5468#true} is VALID [2020-07-18 05:06:56,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {5468#true} havoc #t~nondet0; {5468#true} is VALID [2020-07-18 05:06:56,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {5468#true} havoc ~lk1~0; {5468#true} is VALID [2020-07-18 05:06:56,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {5468#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {5468#true} ~p2~0 := #t~nondet1; {5468#true} is VALID [2020-07-18 05:06:56,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {5468#true} havoc #t~nondet1; {5468#true} is VALID [2020-07-18 05:06:56,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {5468#true} havoc ~lk2~0; {5468#true} is VALID [2020-07-18 05:06:56,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {5468#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {5468#true} ~p3~0 := #t~nondet2; {5468#true} is VALID [2020-07-18 05:06:56,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {5468#true} havoc #t~nondet2; {5468#true} is VALID [2020-07-18 05:06:56,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {5468#true} havoc ~lk3~0; {5468#true} is VALID [2020-07-18 05:06:56,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {5468#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,936 INFO L280 TraceCheckUtils]: 17: Hoare triple {5468#true} ~p4~0 := #t~nondet3; {5468#true} is VALID [2020-07-18 05:06:56,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {5468#true} havoc #t~nondet3; {5468#true} is VALID [2020-07-18 05:06:56,937 INFO L280 TraceCheckUtils]: 19: Hoare triple {5468#true} havoc ~lk4~0; {5468#true} is VALID [2020-07-18 05:06:56,937 INFO L280 TraceCheckUtils]: 20: Hoare triple {5468#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,937 INFO L280 TraceCheckUtils]: 21: Hoare triple {5468#true} ~p5~0 := #t~nondet4; {5468#true} is VALID [2020-07-18 05:06:56,938 INFO L280 TraceCheckUtils]: 22: Hoare triple {5468#true} havoc #t~nondet4; {5468#true} is VALID [2020-07-18 05:06:56,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {5468#true} havoc ~lk5~0; {5468#true} is VALID [2020-07-18 05:06:56,938 INFO L280 TraceCheckUtils]: 24: Hoare triple {5468#true} havoc ~cond~0; {5468#true} is VALID [2020-07-18 05:06:56,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {5468#true} assume !false; {5468#true} is VALID [2020-07-18 05:06:56,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {5468#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5468#true} is VALID [2020-07-18 05:06:56,939 INFO L280 TraceCheckUtils]: 27: Hoare triple {5468#true} ~cond~0 := #t~nondet5; {5468#true} is VALID [2020-07-18 05:06:56,939 INFO L280 TraceCheckUtils]: 28: Hoare triple {5468#true} havoc #t~nondet5; {5468#true} is VALID [2020-07-18 05:06:56,939 INFO L280 TraceCheckUtils]: 29: Hoare triple {5468#true} assume !(0 == ~cond~0); {5468#true} is VALID [2020-07-18 05:06:56,939 INFO L280 TraceCheckUtils]: 30: Hoare triple {5468#true} ~lk1~0 := 0; {5468#true} is VALID [2020-07-18 05:06:56,940 INFO L280 TraceCheckUtils]: 31: Hoare triple {5468#true} ~lk2~0 := 0; {5468#true} is VALID [2020-07-18 05:06:56,940 INFO L280 TraceCheckUtils]: 32: Hoare triple {5468#true} ~lk3~0 := 0; {5468#true} is VALID [2020-07-18 05:06:56,940 INFO L280 TraceCheckUtils]: 33: Hoare triple {5468#true} ~lk4~0 := 0; {5468#true} is VALID [2020-07-18 05:06:56,940 INFO L280 TraceCheckUtils]: 34: Hoare triple {5468#true} ~lk5~0 := 0; {5468#true} is VALID [2020-07-18 05:06:56,940 INFO L280 TraceCheckUtils]: 35: Hoare triple {5468#true} assume !(0 != ~p1~0); {5468#true} is VALID [2020-07-18 05:06:56,941 INFO L280 TraceCheckUtils]: 36: Hoare triple {5468#true} assume !(0 != ~p2~0); {5468#true} is VALID [2020-07-18 05:06:56,941 INFO L280 TraceCheckUtils]: 37: Hoare triple {5468#true} assume !(0 != ~p3~0); {5468#true} is VALID [2020-07-18 05:06:56,942 INFO L280 TraceCheckUtils]: 38: Hoare triple {5468#true} assume !(0 != ~p4~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 05:06:56,944 INFO L280 TraceCheckUtils]: 39: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 05:06:56,945 INFO L280 TraceCheckUtils]: 40: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 05:06:56,945 INFO L280 TraceCheckUtils]: 41: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 05:06:56,946 INFO L280 TraceCheckUtils]: 42: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 05:06:56,947 INFO L280 TraceCheckUtils]: 43: Hoare triple {5472#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5469#false} is VALID [2020-07-18 05:06:56,947 INFO L280 TraceCheckUtils]: 44: Hoare triple {5469#false} assume 1 != ~lk4~0; {5469#false} is VALID [2020-07-18 05:06:56,947 INFO L280 TraceCheckUtils]: 45: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2020-07-18 05:06:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:06:56,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141064954] [2020-07-18 05:06:56,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:56,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:56,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313807219] [2020-07-18 05:06:56,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 05:06:56,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:56,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:56,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:56,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:56,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:56,991 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-07-18 05:06:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:57,925 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-07-18 05:06:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:06:57,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 05:06:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:06:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:06:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:06:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:06:57,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 05:06:58,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:58,103 INFO L225 Difference]: With dead ends: 739 [2020-07-18 05:06:58,103 INFO L226 Difference]: Without dead ends: 493 [2020-07-18 05:06:58,105 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-18 05:06:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-07-18 05:06:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-07-18 05:06:58,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:06:58,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand 491 states. [2020-07-18 05:06:58,871 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 491 states. [2020-07-18 05:06:58,872 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 491 states. [2020-07-18 05:06:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:58,890 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-18 05:06:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-18 05:06:58,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:58,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:58,891 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 493 states. [2020-07-18 05:06:58,892 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 493 states. [2020-07-18 05:06:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:06:58,909 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-18 05:06:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-18 05:06:58,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:06:58,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:06:58,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:06:58,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:06:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 05:06:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-07-18 05:06:58,928 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-07-18 05:06:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:06:58,928 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-07-18 05:06:58,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:06:58,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 618 transitions. [2020-07-18 05:06:59,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-07-18 05:06:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 05:06:59,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:06:59,577 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] [2020-07-18 05:06:59,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:06:59,578 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:06:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:06:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-07-18 05:06:59,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:06:59,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685345360] [2020-07-18 05:06:59,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:06:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:06:59,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-18 05:06:59,619 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-18 05:06:59,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {8921#true} call ULTIMATE.init(); {8921#true} is VALID [2020-07-18 05:06:59,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L263 TraceCheckUtils]: 3: Hoare triple {8921#true} call #t~ret6 := main(); {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {8921#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {8921#true} ~p1~0 := #t~nondet0; {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {8921#true} havoc #t~nondet0; {8921#true} is VALID [2020-07-18 05:06:59,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {8921#true} havoc ~lk1~0; {8921#true} is VALID [2020-07-18 05:06:59,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {8921#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {8921#true} ~p2~0 := #t~nondet1; {8921#true} is VALID [2020-07-18 05:06:59,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {8921#true} havoc #t~nondet1; {8921#true} is VALID [2020-07-18 05:06:59,621 INFO L280 TraceCheckUtils]: 11: Hoare triple {8921#true} havoc ~lk2~0; {8921#true} is VALID [2020-07-18 05:06:59,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {8921#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {8921#true} ~p3~0 := #t~nondet2; {8921#true} is VALID [2020-07-18 05:06:59,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {8921#true} havoc #t~nondet2; {8921#true} is VALID [2020-07-18 05:06:59,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {8921#true} havoc ~lk3~0; {8921#true} is VALID [2020-07-18 05:06:59,622 INFO L280 TraceCheckUtils]: 16: Hoare triple {8921#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {8921#true} ~p4~0 := #t~nondet3; {8921#true} is VALID [2020-07-18 05:06:59,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {8921#true} havoc #t~nondet3; {8921#true} is VALID [2020-07-18 05:06:59,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {8921#true} havoc ~lk4~0; {8921#true} is VALID [2020-07-18 05:06:59,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {8921#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,623 INFO L280 TraceCheckUtils]: 21: Hoare triple {8921#true} ~p5~0 := #t~nondet4; {8921#true} is VALID [2020-07-18 05:06:59,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {8921#true} havoc #t~nondet4; {8921#true} is VALID [2020-07-18 05:06:59,624 INFO L280 TraceCheckUtils]: 23: Hoare triple {8921#true} havoc ~lk5~0; {8921#true} is VALID [2020-07-18 05:06:59,624 INFO L280 TraceCheckUtils]: 24: Hoare triple {8921#true} havoc ~cond~0; {8921#true} is VALID [2020-07-18 05:06:59,624 INFO L280 TraceCheckUtils]: 25: Hoare triple {8921#true} assume !false; {8921#true} is VALID [2020-07-18 05:06:59,625 INFO L280 TraceCheckUtils]: 26: Hoare triple {8921#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8921#true} is VALID [2020-07-18 05:06:59,625 INFO L280 TraceCheckUtils]: 27: Hoare triple {8921#true} ~cond~0 := #t~nondet5; {8921#true} is VALID [2020-07-18 05:06:59,625 INFO L280 TraceCheckUtils]: 28: Hoare triple {8921#true} havoc #t~nondet5; {8921#true} is VALID [2020-07-18 05:06:59,625 INFO L280 TraceCheckUtils]: 29: Hoare triple {8921#true} assume !(0 == ~cond~0); {8921#true} is VALID [2020-07-18 05:06:59,626 INFO L280 TraceCheckUtils]: 30: Hoare triple {8921#true} ~lk1~0 := 0; {8921#true} is VALID [2020-07-18 05:06:59,626 INFO L280 TraceCheckUtils]: 31: Hoare triple {8921#true} ~lk2~0 := 0; {8921#true} is VALID [2020-07-18 05:06:59,626 INFO L280 TraceCheckUtils]: 32: Hoare triple {8921#true} ~lk3~0 := 0; {8921#true} is VALID [2020-07-18 05:06:59,626 INFO L280 TraceCheckUtils]: 33: Hoare triple {8921#true} ~lk4~0 := 0; {8921#true} is VALID [2020-07-18 05:06:59,626 INFO L280 TraceCheckUtils]: 34: Hoare triple {8921#true} ~lk5~0 := 0; {8921#true} is VALID [2020-07-18 05:06:59,627 INFO L280 TraceCheckUtils]: 35: Hoare triple {8921#true} assume !(0 != ~p1~0); {8921#true} is VALID [2020-07-18 05:06:59,627 INFO L280 TraceCheckUtils]: 36: Hoare triple {8921#true} assume !(0 != ~p2~0); {8921#true} is VALID [2020-07-18 05:06:59,627 INFO L280 TraceCheckUtils]: 37: Hoare triple {8921#true} assume 0 != ~p3~0; {8921#true} is VALID [2020-07-18 05:06:59,632 INFO L280 TraceCheckUtils]: 38: Hoare triple {8921#true} ~lk3~0 := 1; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,639 INFO L280 TraceCheckUtils]: 39: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,639 INFO L280 TraceCheckUtils]: 40: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,646 INFO L280 TraceCheckUtils]: 41: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,646 INFO L280 TraceCheckUtils]: 42: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,647 INFO L280 TraceCheckUtils]: 43: Hoare triple {8925#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:06:59,647 INFO L280 TraceCheckUtils]: 44: Hoare triple {8925#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {8922#false} is VALID [2020-07-18 05:06:59,647 INFO L280 TraceCheckUtils]: 45: Hoare triple {8922#false} assume !false; {8922#false} is VALID [2020-07-18 05:06:59,649 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-18 05:06:59,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685345360] [2020-07-18 05:06:59,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:06:59,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:06:59,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688974763] [2020-07-18 05:06:59,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 05:06:59,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:06:59,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:06:59,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:06:59,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:06:59,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:06:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:06:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:06:59,703 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-07-18 05:07:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:00,925 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-07-18 05:07:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 05:07:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-18 05:07:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-18 05:07:00,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2020-07-18 05:07:01,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:01,055 INFO L225 Difference]: With dead ends: 599 [2020-07-18 05:07:01,055 INFO L226 Difference]: Without dead ends: 597 [2020-07-18 05:07:01,056 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-18 05:07:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-07-18 05:07:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-07-18 05:07:01,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:01,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 491 states. [2020-07-18 05:07:01,732 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 491 states. [2020-07-18 05:07:01,732 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 491 states. [2020-07-18 05:07:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:01,757 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-18 05:07:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-18 05:07:01,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:01,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:01,759 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 597 states. [2020-07-18 05:07:01,760 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 597 states. [2020-07-18 05:07:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:01,784 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-18 05:07:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-18 05:07:01,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:01,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:01,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:01,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 05:07:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-07-18 05:07:01,816 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-07-18 05:07:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:01,816 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-07-18 05:07:01,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:01,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 610 transitions. [2020-07-18 05:07:02,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-07-18 05:07:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 05:07:02,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:02,425 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] [2020-07-18 05:07:02,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:07:02,427 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-07-18 05:07:02,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:02,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [927763574] [2020-07-18 05:07:02,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:02,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-18 05:07:02,492 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-18 05:07:02,492 INFO L263 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2020-07-18 05:07:02,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-18 05:07:02,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-18 05:07:02,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {12302#true} call #t~ret6 := main(); {12302#true} is VALID [2020-07-18 05:07:02,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {12302#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {12302#true} ~p1~0 := #t~nondet0; {12302#true} is VALID [2020-07-18 05:07:02,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {12302#true} havoc #t~nondet0; {12302#true} is VALID [2020-07-18 05:07:02,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {12302#true} havoc ~lk1~0; {12302#true} is VALID [2020-07-18 05:07:02,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {12302#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {12302#true} ~p2~0 := #t~nondet1; {12302#true} is VALID [2020-07-18 05:07:02,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {12302#true} havoc #t~nondet1; {12302#true} is VALID [2020-07-18 05:07:02,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {12302#true} havoc ~lk2~0; {12302#true} is VALID [2020-07-18 05:07:02,495 INFO L280 TraceCheckUtils]: 12: Hoare triple {12302#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {12302#true} ~p3~0 := #t~nondet2; {12302#true} is VALID [2020-07-18 05:07:02,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {12302#true} havoc #t~nondet2; {12302#true} is VALID [2020-07-18 05:07:02,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {12302#true} havoc ~lk3~0; {12302#true} is VALID [2020-07-18 05:07:02,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {12302#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {12302#true} ~p4~0 := #t~nondet3; {12302#true} is VALID [2020-07-18 05:07:02,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {12302#true} havoc #t~nondet3; {12302#true} is VALID [2020-07-18 05:07:02,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {12302#true} havoc ~lk4~0; {12302#true} is VALID [2020-07-18 05:07:02,503 INFO L280 TraceCheckUtils]: 20: Hoare triple {12302#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,503 INFO L280 TraceCheckUtils]: 21: Hoare triple {12302#true} ~p5~0 := #t~nondet4; {12302#true} is VALID [2020-07-18 05:07:02,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {12302#true} havoc #t~nondet4; {12302#true} is VALID [2020-07-18 05:07:02,504 INFO L280 TraceCheckUtils]: 23: Hoare triple {12302#true} havoc ~lk5~0; {12302#true} is VALID [2020-07-18 05:07:02,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {12302#true} havoc ~cond~0; {12302#true} is VALID [2020-07-18 05:07:02,504 INFO L280 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !false; {12302#true} is VALID [2020-07-18 05:07:02,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {12302#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12302#true} is VALID [2020-07-18 05:07:02,504 INFO L280 TraceCheckUtils]: 27: Hoare triple {12302#true} ~cond~0 := #t~nondet5; {12302#true} is VALID [2020-07-18 05:07:02,505 INFO L280 TraceCheckUtils]: 28: Hoare triple {12302#true} havoc #t~nondet5; {12302#true} is VALID [2020-07-18 05:07:02,505 INFO L280 TraceCheckUtils]: 29: Hoare triple {12302#true} assume !(0 == ~cond~0); {12302#true} is VALID [2020-07-18 05:07:02,505 INFO L280 TraceCheckUtils]: 30: Hoare triple {12302#true} ~lk1~0 := 0; {12302#true} is VALID [2020-07-18 05:07:02,505 INFO L280 TraceCheckUtils]: 31: Hoare triple {12302#true} ~lk2~0 := 0; {12302#true} is VALID [2020-07-18 05:07:02,506 INFO L280 TraceCheckUtils]: 32: Hoare triple {12302#true} ~lk3~0 := 0; {12302#true} is VALID [2020-07-18 05:07:02,506 INFO L280 TraceCheckUtils]: 33: Hoare triple {12302#true} ~lk4~0 := 0; {12302#true} is VALID [2020-07-18 05:07:02,506 INFO L280 TraceCheckUtils]: 34: Hoare triple {12302#true} ~lk5~0 := 0; {12302#true} is VALID [2020-07-18 05:07:02,507 INFO L280 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 != ~p1~0); {12302#true} is VALID [2020-07-18 05:07:02,507 INFO L280 TraceCheckUtils]: 36: Hoare triple {12302#true} assume !(0 != ~p2~0); {12302#true} is VALID [2020-07-18 05:07:02,507 INFO L280 TraceCheckUtils]: 37: Hoare triple {12302#true} assume !(0 != ~p3~0); {12302#true} is VALID [2020-07-18 05:07:02,507 INFO L280 TraceCheckUtils]: 38: Hoare triple {12302#true} assume 0 != ~p4~0; {12302#true} is VALID [2020-07-18 05:07:02,511 INFO L280 TraceCheckUtils]: 39: Hoare triple {12302#true} ~lk4~0 := 1; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,511 INFO L280 TraceCheckUtils]: 40: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,512 INFO L280 TraceCheckUtils]: 41: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,512 INFO L280 TraceCheckUtils]: 42: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,513 INFO L280 TraceCheckUtils]: 43: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,513 INFO L280 TraceCheckUtils]: 44: Hoare triple {12306#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:02,514 INFO L280 TraceCheckUtils]: 45: Hoare triple {12306#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {12303#false} is VALID [2020-07-18 05:07:02,514 INFO L280 TraceCheckUtils]: 46: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2020-07-18 05:07:02,515 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-18 05:07:02,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [927763574] [2020-07-18 05:07:02,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:02,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:02,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061619221] [2020-07-18 05:07:02,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 05:07:02,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:02,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:02,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:02,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:02,558 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-07-18 05:07:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:03,687 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-07-18 05:07:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:03,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 05:07:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-18 05:07:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-18 05:07:03,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-18 05:07:03,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:03,796 INFO L225 Difference]: With dead ends: 591 [2020-07-18 05:07:03,796 INFO L226 Difference]: Without dead ends: 589 [2020-07-18 05:07:03,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-07-18 05:07:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-07-18 05:07:04,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:04,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand 491 states. [2020-07-18 05:07:04,659 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand 491 states. [2020-07-18 05:07:04,659 INFO L87 Difference]: Start difference. First operand 589 states. Second operand 491 states. [2020-07-18 05:07:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:04,682 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-18 05:07:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-18 05:07:04,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:04,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:04,684 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 589 states. [2020-07-18 05:07:04,684 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 589 states. [2020-07-18 05:07:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:04,707 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-18 05:07:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-18 05:07:04,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:04,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:04,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:04,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 05:07:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-07-18 05:07:04,727 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-07-18 05:07:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:04,727 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-07-18 05:07:04,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:04,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 602 transitions. [2020-07-18 05:07:05,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-07-18 05:07:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 05:07:05,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:05,372 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] [2020-07-18 05:07:05,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:07:05,373 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-07-18 05:07:05,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:05,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738901815] [2020-07-18 05:07:05,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:05,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-18 05:07:05,411 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-18 05:07:05,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2020-07-18 05:07:05,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-18 05:07:05,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-18 05:07:05,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {15651#true} call #t~ret6 := main(); {15651#true} is VALID [2020-07-18 05:07:05,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {15651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {15651#true} ~p1~0 := #t~nondet0; {15651#true} is VALID [2020-07-18 05:07:05,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {15651#true} havoc #t~nondet0; {15651#true} is VALID [2020-07-18 05:07:05,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {15651#true} havoc ~lk1~0; {15651#true} is VALID [2020-07-18 05:07:05,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {15651#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {15651#true} ~p2~0 := #t~nondet1; {15651#true} is VALID [2020-07-18 05:07:05,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {15651#true} havoc #t~nondet1; {15651#true} is VALID [2020-07-18 05:07:05,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {15651#true} havoc ~lk2~0; {15651#true} is VALID [2020-07-18 05:07:05,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {15651#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {15651#true} ~p3~0 := #t~nondet2; {15651#true} is VALID [2020-07-18 05:07:05,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {15651#true} havoc #t~nondet2; {15651#true} is VALID [2020-07-18 05:07:05,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {15651#true} havoc ~lk3~0; {15651#true} is VALID [2020-07-18 05:07:05,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {15651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {15651#true} ~p4~0 := #t~nondet3; {15651#true} is VALID [2020-07-18 05:07:05,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {15651#true} havoc #t~nondet3; {15651#true} is VALID [2020-07-18 05:07:05,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {15651#true} havoc ~lk4~0; {15651#true} is VALID [2020-07-18 05:07:05,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {15651#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {15651#true} ~p5~0 := #t~nondet4; {15651#true} is VALID [2020-07-18 05:07:05,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {15651#true} havoc #t~nondet4; {15651#true} is VALID [2020-07-18 05:07:05,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {15651#true} havoc ~lk5~0; {15651#true} is VALID [2020-07-18 05:07:05,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {15651#true} havoc ~cond~0; {15651#true} is VALID [2020-07-18 05:07:05,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {15651#true} assume !false; {15651#true} is VALID [2020-07-18 05:07:05,418 INFO L280 TraceCheckUtils]: 26: Hoare triple {15651#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15651#true} is VALID [2020-07-18 05:07:05,418 INFO L280 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond~0 := #t~nondet5; {15651#true} is VALID [2020-07-18 05:07:05,419 INFO L280 TraceCheckUtils]: 28: Hoare triple {15651#true} havoc #t~nondet5; {15651#true} is VALID [2020-07-18 05:07:05,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {15651#true} assume !(0 == ~cond~0); {15651#true} is VALID [2020-07-18 05:07:05,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {15651#true} ~lk1~0 := 0; {15651#true} is VALID [2020-07-18 05:07:05,419 INFO L280 TraceCheckUtils]: 31: Hoare triple {15651#true} ~lk2~0 := 0; {15651#true} is VALID [2020-07-18 05:07:05,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {15651#true} ~lk3~0 := 0; {15651#true} is VALID [2020-07-18 05:07:05,420 INFO L280 TraceCheckUtils]: 33: Hoare triple {15651#true} ~lk4~0 := 0; {15651#true} is VALID [2020-07-18 05:07:05,420 INFO L280 TraceCheckUtils]: 34: Hoare triple {15651#true} ~lk5~0 := 0; {15651#true} is VALID [2020-07-18 05:07:05,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {15651#true} assume !(0 != ~p1~0); {15651#true} is VALID [2020-07-18 05:07:05,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {15651#true} assume !(0 != ~p2~0); {15651#true} is VALID [2020-07-18 05:07:05,421 INFO L280 TraceCheckUtils]: 37: Hoare triple {15651#true} assume !(0 != ~p3~0); {15651#true} is VALID [2020-07-18 05:07:05,421 INFO L280 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 != ~p4~0); {15651#true} is VALID [2020-07-18 05:07:05,422 INFO L280 TraceCheckUtils]: 39: Hoare triple {15651#true} assume !(0 != ~p5~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:05,422 INFO L280 TraceCheckUtils]: 40: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:05,423 INFO L280 TraceCheckUtils]: 41: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:05,423 INFO L280 TraceCheckUtils]: 42: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:05,424 INFO L280 TraceCheckUtils]: 43: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:05,425 INFO L280 TraceCheckUtils]: 44: Hoare triple {15655#(= 0 main_~p5~0)} assume 0 != ~p5~0; {15652#false} is VALID [2020-07-18 05:07:05,425 INFO L280 TraceCheckUtils]: 45: Hoare triple {15652#false} assume 1 != ~lk5~0; {15652#false} is VALID [2020-07-18 05:07:05,425 INFO L280 TraceCheckUtils]: 46: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2020-07-18 05:07:05,428 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-18 05:07:05,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738901815] [2020-07-18 05:07:05,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:05,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:05,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820837932] [2020-07-18 05:07:05,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 05:07:05,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:05,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:05,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:05,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:05,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:05,479 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-07-18 05:07:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:07,516 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-07-18 05:07:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:07,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 05:07:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-18 05:07:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-18 05:07:07,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-18 05:07:07,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:07,669 INFO L225 Difference]: With dead ends: 1373 [2020-07-18 05:07:07,669 INFO L226 Difference]: Without dead ends: 491 [2020-07-18 05:07:07,672 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-18 05:07:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-07-18 05:07:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-07-18 05:07:08,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:08,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 491 states. [2020-07-18 05:07:08,480 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-18 05:07:08,480 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-18 05:07:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:08,498 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 05:07:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 05:07:08,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:08,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:08,499 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-18 05:07:08,499 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-18 05:07:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:08,517 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 05:07:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 05:07:08,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:08,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:08,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:08,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 05:07:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-07-18 05:07:08,534 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-07-18 05:07:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:08,534 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-07-18 05:07:08,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:08,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 570 transitions. [2020-07-18 05:07:09,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 05:07:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 05:07:09,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:09,147 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] [2020-07-18 05:07:09,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:07:09,148 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-07-18 05:07:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:09,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828846407] [2020-07-18 05:07:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:09,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-18 05:07:09,198 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-18 05:07:09,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L263 TraceCheckUtils]: 3: Hoare triple {20368#true} call #t~ret6 := main(); {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {20368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {20368#true} ~p1~0 := #t~nondet0; {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {20368#true} havoc #t~nondet0; {20368#true} is VALID [2020-07-18 05:07:09,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {20368#true} havoc ~lk1~0; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {20368#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {20368#true} ~p2~0 := #t~nondet1; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {20368#true} havoc #t~nondet1; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {20368#true} havoc ~lk2~0; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {20368#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {20368#true} ~p3~0 := #t~nondet2; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {20368#true} havoc #t~nondet2; {20368#true} is VALID [2020-07-18 05:07:09,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {20368#true} havoc ~lk3~0; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {20368#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {20368#true} ~p4~0 := #t~nondet3; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {20368#true} havoc #t~nondet3; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {20368#true} havoc ~lk4~0; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 20: Hoare triple {20368#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 21: Hoare triple {20368#true} ~p5~0 := #t~nondet4; {20368#true} is VALID [2020-07-18 05:07:09,201 INFO L280 TraceCheckUtils]: 22: Hoare triple {20368#true} havoc #t~nondet4; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {20368#true} havoc ~lk5~0; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {20368#true} havoc ~cond~0; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 25: Hoare triple {20368#true} assume !false; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 26: Hoare triple {20368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 27: Hoare triple {20368#true} ~cond~0 := #t~nondet5; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {20368#true} havoc #t~nondet5; {20368#true} is VALID [2020-07-18 05:07:09,202 INFO L280 TraceCheckUtils]: 29: Hoare triple {20368#true} assume !(0 == ~cond~0); {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 30: Hoare triple {20368#true} ~lk1~0 := 0; {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 31: Hoare triple {20368#true} ~lk2~0 := 0; {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 32: Hoare triple {20368#true} ~lk3~0 := 0; {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 33: Hoare triple {20368#true} ~lk4~0 := 0; {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 34: Hoare triple {20368#true} ~lk5~0 := 0; {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 35: Hoare triple {20368#true} assume !(0 != ~p1~0); {20368#true} is VALID [2020-07-18 05:07:09,203 INFO L280 TraceCheckUtils]: 36: Hoare triple {20368#true} assume !(0 != ~p2~0); {20368#true} is VALID [2020-07-18 05:07:09,204 INFO L280 TraceCheckUtils]: 37: Hoare triple {20368#true} assume !(0 != ~p3~0); {20368#true} is VALID [2020-07-18 05:07:09,204 INFO L280 TraceCheckUtils]: 38: Hoare triple {20368#true} assume !(0 != ~p4~0); {20368#true} is VALID [2020-07-18 05:07:09,204 INFO L280 TraceCheckUtils]: 39: Hoare triple {20368#true} assume 0 != ~p5~0; {20368#true} is VALID [2020-07-18 05:07:09,205 INFO L280 TraceCheckUtils]: 40: Hoare triple {20368#true} ~lk5~0 := 1; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,205 INFO L280 TraceCheckUtils]: 41: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,205 INFO L280 TraceCheckUtils]: 42: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,206 INFO L280 TraceCheckUtils]: 43: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,206 INFO L280 TraceCheckUtils]: 44: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,206 INFO L280 TraceCheckUtils]: 45: Hoare triple {20372#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:09,207 INFO L280 TraceCheckUtils]: 46: Hoare triple {20372#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {20369#false} is VALID [2020-07-18 05:07:09,207 INFO L280 TraceCheckUtils]: 47: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2020-07-18 05:07:09,208 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-18 05:07:09,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828846407] [2020-07-18 05:07:09,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:09,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:09,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405745792] [2020-07-18 05:07:09,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-18 05:07:09,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:09,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:09,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:09,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:09,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:09,253 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-07-18 05:07:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,222 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 05:07:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-18 05:07:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-18 05:07:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-18 05:07:10,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-18 05:07:10,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:10,298 INFO L225 Difference]: With dead ends: 491 [2020-07-18 05:07:10,298 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:07:10,300 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-18 05:07:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:07:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:07:10,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:10,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:10,301 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:10,301 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:07:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:10,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:10,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:10,301 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:10,302 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:07:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:07:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:10,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:10,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:10,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:10,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:07:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:07:10,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-18 05:07:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:10,303 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:07:10,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:10,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:07:10,303 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-18 05:07:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:07:10,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:10,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:07:10,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:07:10,934 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:07:11,072 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:11,397 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:11,677 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:07:11,840 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:07:12,213 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:07:12,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,324 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,325 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:07:12,325 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-07-18 05:07:12,325 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-18 05:07:12,325 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 05:07:12,325 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 05:07:12,326 INFO L264 CegarLoopResult]: At program point L53-1(lines 24 88) 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-18 05:07:12,326 INFO L264 CegarLoopResult]: At program point L78-1(lines 24 88) the Hoare annotation is: (or (= 0 main_~p5~0) (= 1 main_~lk5~0)) [2020-07-18 05:07:12,326 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 05:07:12,326 INFO L264 CegarLoopResult]: At program point L45-1(lines 24 88) 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-18 05:07:12,326 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 05:07:12,326 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 05:07:12,327 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 05:07:12,327 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-18 05:07:12,327 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-18 05:07:12,327 INFO L264 CegarLoopResult]: At program point L54(line 54) 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-18 05:07:12,327 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-18 05:07:12,327 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:07:12,328 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 05:07:12,328 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-07-18 05:07:12,328 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-07-18 05:07:12,328 INFO L264 CegarLoopResult]: At program point L63-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse6 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse6 .cse1 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse6 .cse1 .cse3) (and .cse0 .cse6 .cse5 .cse4) (and .cse2 .cse7 .cse5 .cse4) (and .cse6 .cse7 .cse3 .cse4) (and .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse7 .cse5) (and .cse6 .cse7 .cse5 .cse4) (and .cse6 .cse1 .cse7 .cse3) (and .cse0 .cse6 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse6 .cse1 .cse7 .cse5))) [2020-07-18 05:07:12,328 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-18 05:07:12,328 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 05:07:12,328 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk3~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 05:07:12,329 INFO L264 CegarLoopResult]: At program point L73-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) [2020-07-18 05:07:12,329 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 05:07:12,330 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-18 05:07:12,330 INFO L264 CegarLoopResult]: At program point L57-1(lines 24 88) 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 .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (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 .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (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-18 05:07:12,330 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 05:07:12,330 INFO L264 CegarLoopResult]: At program point L49-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p1~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 .cse2) (and .cse3 .cse0 .cse5) (and .cse4 .cse1 .cse2))) [2020-07-18 05:07:12,330 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-18 05:07:12,330 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L264 CegarLoopResult]: At program point L41-2(lines 24 88) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:07:12,331 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L264 CegarLoopResult]: At program point L58(line 58) 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 .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 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 05:07:12,331 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L264 CegarLoopResult]: At program point L50(line 50) 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-18 05:07:12,331 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-18 05:07:12,331 INFO L264 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-18 05:07:12,332 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 05:07:12,332 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-18 05:07:12,333 INFO L264 CegarLoopResult]: At program point L68-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse4 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse1 .cse4) (and .cse1 .cse2 .cse5) (and .cse3 .cse2 .cse5))) [2020-07-18 05:07:12,383 INFO L163 areAnnotationChecker]: CFG has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:07:12,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:07:12 BoogieIcfgContainer [2020-07-18 05:07:12,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:07:12,397 INFO L168 Benchmark]: Toolchain (without parser) took 22344.58 ms. Allocated memory was 145.8 MB in the beginning and 427.3 MB in the end (delta: 281.5 MB). Free memory was 104.3 MB in the beginning and 97.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 288.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,398 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.78 ms. Allocated memory is still 145.8 MB. Free memory was 104.1 MB in the beginning and 93.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,404 INFO L168 Benchmark]: Boogie Preprocessor took 130.68 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 182.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,405 INFO L168 Benchmark]: RCFGBuilder took 554.10 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 155.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,405 INFO L168 Benchmark]: TraceAbstraction took 21395.06 ms. Allocated memory was 203.4 MB in the beginning and 427.3 MB in the end (delta: 223.9 MB). Free memory was 154.5 MB in the beginning and 97.3 MB in the end (delta: 57.2 MB). Peak memory consumption was 281.0 MB. Max. memory is 7.1 GB. [2020-07-18 05:07:12,414 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.96 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.78 ms. Allocated memory is still 145.8 MB. Free memory was 104.1 MB in the beginning and 93.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.68 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 182.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.10 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 155.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21395.06 ms. Allocated memory was 203.4 MB in the beginning and 427.3 MB in the end (delta: 223.9 MB). Free memory was 154.5 MB in the beginning and 97.3 MB in the end (delta: 57.2 MB). Peak memory consumption was 281.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 332 SDslu, 668 SDs, 0 SdLazy, 49 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 24725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...