/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:00:03,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:00:03,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:00:03,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:00:03,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:00:03,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:00:03,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:00:03,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:00:03,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:00:03,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:00:03,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:00:03,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:00:03,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:00:03,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:00:03,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:00:03,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:00:03,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:00:03,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:00:03,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:00:03,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:00:03,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:00:03,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:00:03,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:00:03,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:00:03,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:00:03,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:00:03,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:00:03,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:00:03,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:00:03,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:00:03,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:00:03,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:00:03,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:00:03,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:00:03,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:00:03,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:00:03,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:00:03,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:00:03,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:00:03,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:00:03,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:00:03,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:00:03,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:00:03,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:00:03,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:00:03,893 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:00:03,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:00:03,894 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:00:03,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:00:03,895 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:00:03,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:00:03,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:00:03,896 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:00:03,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:00:03,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:00:03,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:00:03,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:00:03,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:00:03,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:00:03,897 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-09-04 22:00:04,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:00:04,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:00:04,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:00:04,363 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:00:04,363 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:00:04,364 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-09-04 22:00:04,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/02723f158/c7e29fa61ad74e068d41e72ff0abb9a4/FLAG0a7e1831d [2020-09-04 22:00:04,945 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:00:04,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_6.c [2020-09-04 22:00:04,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/02723f158/c7e29fa61ad74e068d41e72ff0abb9a4/FLAG0a7e1831d [2020-09-04 22:00:05,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/02723f158/c7e29fa61ad74e068d41e72ff0abb9a4 [2020-09-04 22:00:05,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:00:05,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:00:05,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:05,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:00:05,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:00:05,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ad3e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05, skipping insertion in model container [2020-09-04 22:00:05,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:00:05,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:00:05,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:05,651 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:00:05,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:05,722 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:00:05,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05 WrapperNode [2020-09-04 22:00:05,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:05,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:00:05,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:00:05,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:00:05,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... [2020-09-04 22:00:05,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:00:05,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:00:05,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:00:05,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:00:05,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 22:00:05,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:00:05,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:00:05,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:00:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:00:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:00:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:00:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:00:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:00:06,306 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:00:06,306 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 22:00:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:06 BoogieIcfgContainer [2020-09-04 22:00:06,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:00:06,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:00:06,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:00:06,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:00:06,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:00:05" (1/3) ... [2020-09-04 22:00:06,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c274e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:06, skipping insertion in model container [2020-09-04 22:00:06,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:05" (2/3) ... [2020-09-04 22:00:06,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c274e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:06, skipping insertion in model container [2020-09-04 22:00:06,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:06" (3/3) ... [2020-09-04 22:00:06,337 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-09-04 22:00:06,349 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:00:06,363 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:00:06,385 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:00:06,416 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:00:06,416 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:00:06,416 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:00:06,416 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:00:06,417 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:00:06,417 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:00:06,417 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:00:06,417 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:00:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-09-04 22:00:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-04 22:00:06,454 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:06,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:06,456 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-09-04 22:00:06,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:06,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749581863] [2020-09-04 22:00:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:06,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:06,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749581863] [2020-09-04 22:00:06,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:06,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:06,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190274875] [2020-09-04 22:00:06,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:06,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:06,744 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-09-04 22:00:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:06,833 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-09-04 22:00:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:06,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-09-04 22:00:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:06,852 INFO L225 Difference]: With dead ends: 169 [2020-09-04 22:00:06,853 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 22:00:06,858 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-09-04 22:00:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 22:00:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-09-04 22:00:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 22:00:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-09-04 22:00:06,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-09-04 22:00:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:06,932 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-09-04 22:00:06,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-09-04 22:00:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 22:00:06,934 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:06,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:06,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:00:06,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-09-04 22:00:06,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:06,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [46376936] [2020-09-04 22:00:06,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [46376936] [2020-09-04 22:00:07,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020922161] [2020-09-04 22:00:07,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,038 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-09-04 22:00:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:07,144 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-09-04 22:00:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:07,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-09-04 22:00:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:07,154 INFO L225 Difference]: With dead ends: 135 [2020-09-04 22:00:07,154 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 22:00:07,156 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-09-04 22:00:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 22:00:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-09-04 22:00:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 22:00:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-09-04 22:00:07,200 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-09-04 22:00:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:07,201 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-09-04 22:00:07,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-09-04 22:00:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 22:00:07,203 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:07,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:07,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:00:07,205 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-09-04 22:00:07,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:07,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355068487] [2020-09-04 22:00:07,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355068487] [2020-09-04 22:00:07,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872604771] [2020-09-04 22:00:07,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,290 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-09-04 22:00:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:07,379 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-09-04 22:00:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:07,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-09-04 22:00:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:07,387 INFO L225 Difference]: With dead ends: 266 [2020-09-04 22:00:07,387 INFO L226 Difference]: Without dead ends: 185 [2020-09-04 22:00:07,389 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-09-04 22:00:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-09-04 22:00:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-09-04 22:00:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-09-04 22:00:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-09-04 22:00:07,442 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-09-04 22:00:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:07,442 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-09-04 22:00:07,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-09-04 22:00:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 22:00:07,450 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:07,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:07,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:00:07,454 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-09-04 22:00:07,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:07,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289408009] [2020-09-04 22:00:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289408009] [2020-09-04 22:00:07,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639784418] [2020-09-04 22:00:07,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,561 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-09-04 22:00:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:07,619 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-09-04 22:00:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:07,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-09-04 22:00:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:07,624 INFO L225 Difference]: With dead ends: 479 [2020-09-04 22:00:07,624 INFO L226 Difference]: Without dead ends: 325 [2020-09-04 22:00:07,629 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-09-04 22:00:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-09-04 22:00:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-09-04 22:00:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 22:00:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-09-04 22:00:07,701 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-09-04 22:00:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:07,701 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-09-04 22:00:07,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-09-04 22:00:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 22:00:07,703 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:07,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:07,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:00:07,707 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-09-04 22:00:07,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:07,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972291517] [2020-09-04 22:00:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972291517] [2020-09-04 22:00:07,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849904869] [2020-09-04 22:00:07,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,763 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-09-04 22:00:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:07,797 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-09-04 22:00:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:07,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-09-04 22:00:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:07,801 INFO L225 Difference]: With dead ends: 399 [2020-09-04 22:00:07,801 INFO L226 Difference]: Without dead ends: 397 [2020-09-04 22:00:07,802 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-09-04 22:00:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-09-04 22:00:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-09-04 22:00:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 22:00:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-09-04 22:00:07,829 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-09-04 22:00:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:07,829 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-09-04 22:00:07,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-09-04 22:00:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 22:00:07,831 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:07,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:07,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:00:07,832 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-09-04 22:00:07,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:07,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831884532] [2020-09-04 22:00:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831884532] [2020-09-04 22:00:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154568722] [2020-09-04 22:00:07,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,872 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-09-04 22:00:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:07,911 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-09-04 22:00:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:07,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-09-04 22:00:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:07,915 INFO L225 Difference]: With dead ends: 395 [2020-09-04 22:00:07,915 INFO L226 Difference]: Without dead ends: 393 [2020-09-04 22:00:07,916 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-09-04 22:00:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-09-04 22:00:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-09-04 22:00:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 22:00:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-09-04 22:00:07,943 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-09-04 22:00:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:07,944 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-09-04 22:00:07,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-09-04 22:00:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 22:00:07,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:07,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:07,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:00:07,947 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-09-04 22:00:07,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:07,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251266998] [2020-09-04 22:00:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:07,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251266998] [2020-09-04 22:00:07,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:07,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:07,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005150776] [2020-09-04 22:00:07,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:07,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:07,984 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-09-04 22:00:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:08,046 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-09-04 22:00:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:08,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-09-04 22:00:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:08,051 INFO L225 Difference]: With dead ends: 887 [2020-09-04 22:00:08,051 INFO L226 Difference]: Without dead ends: 593 [2020-09-04 22:00:08,053 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-09-04 22:00:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-09-04 22:00:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-09-04 22:00:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-04 22:00:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-09-04 22:00:08,105 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-09-04 22:00:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:08,105 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-09-04 22:00:08,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-09-04 22:00:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 22:00:08,107 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:08,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:08,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:00:08,108 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-09-04 22:00:08,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:08,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107394564] [2020-09-04 22:00:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:08,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107394564] [2020-09-04 22:00:08,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:08,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:08,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597783250] [2020-09-04 22:00:08,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:08,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:08,162 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-09-04 22:00:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:08,241 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-09-04 22:00:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:08,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-09-04 22:00:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:08,246 INFO L225 Difference]: With dead ends: 715 [2020-09-04 22:00:08,246 INFO L226 Difference]: Without dead ends: 713 [2020-09-04 22:00:08,247 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-09-04 22:00:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-09-04 22:00:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-09-04 22:00:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-04 22:00:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-09-04 22:00:08,306 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-09-04 22:00:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:08,307 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-09-04 22:00:08,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-09-04 22:00:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 22:00:08,309 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:08,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:08,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:00:08,310 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-09-04 22:00:08,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:08,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659482260] [2020-09-04 22:00:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:08,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659482260] [2020-09-04 22:00:08,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:08,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:08,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499806171] [2020-09-04 22:00:08,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:08,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:08,362 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-09-04 22:00:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:08,453 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-09-04 22:00:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:08,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-09-04 22:00:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:08,460 INFO L225 Difference]: With dead ends: 1667 [2020-09-04 22:00:08,460 INFO L226 Difference]: Without dead ends: 1105 [2020-09-04 22:00:08,462 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-09-04 22:00:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-09-04 22:00:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-09-04 22:00:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 22:00:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-09-04 22:00:08,545 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-09-04 22:00:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:08,546 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-09-04 22:00:08,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-09-04 22:00:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 22:00:08,548 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:08,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:08,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:00:08,549 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-09-04 22:00:08,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:08,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [975140458] [2020-09-04 22:00:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:08,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [975140458] [2020-09-04 22:00:08,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:08,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:08,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252780136] [2020-09-04 22:00:08,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:08,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:08,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:08,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:08,582 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-09-04 22:00:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:08,696 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-09-04 22:00:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:08,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-09-04 22:00:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:08,703 INFO L225 Difference]: With dead ends: 1315 [2020-09-04 22:00:08,703 INFO L226 Difference]: Without dead ends: 1313 [2020-09-04 22:00:08,704 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-09-04 22:00:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-09-04 22:00:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-09-04 22:00:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 22:00:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-09-04 22:00:08,793 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-09-04 22:00:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:08,794 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-09-04 22:00:08,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-09-04 22:00:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 22:00:08,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:08,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:08,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:00:08,797 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-09-04 22:00:08,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:08,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554708579] [2020-09-04 22:00:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:08,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554708579] [2020-09-04 22:00:08,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:08,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130200237] [2020-09-04 22:00:08,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:08,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:08,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:08,835 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-09-04 22:00:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,009 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-09-04 22:00:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-09-04 22:00:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,016 INFO L225 Difference]: With dead ends: 3153 [2020-09-04 22:00:09,016 INFO L226 Difference]: Without dead ends: 1103 [2020-09-04 22:00:09,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-09-04 22:00:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-09-04 22:00:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 22:00:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-09-04 22:00:09,116 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-09-04 22:00:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,116 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-09-04 22:00:09,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-09-04 22:00:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 22:00:09,118 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:09,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:09,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:00:09,119 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-09-04 22:00:09,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:09,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1881638787] [2020-09-04 22:00:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:09,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1881638787] [2020-09-04 22:00:09,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:09,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:09,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981826077] [2020-09-04 22:00:09,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:09,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:09,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,174 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-09-04 22:00:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,250 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-09-04 22:00:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-09-04 22:00:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,252 INFO L225 Difference]: With dead ends: 1103 [2020-09-04 22:00:09,252 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 22:00:09,255 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-09-04 22:00:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 22:00:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 22:00:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 22:00:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 22:00:09,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-09-04 22:00:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,256 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 22:00:09,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 22:00:09,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 22:00:09,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:00:09,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 22:00:09,389 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 15 [2020-09-04 22:00:09,687 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 22:00:09,822 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:10,150 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:10,557 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-09-04 22:00:10,738 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:11,346 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2020-09-04 22:00:11,683 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:12,092 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:12,558 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:13,789 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:13,964 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:14,285 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:14,803 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:15,263 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:15,474 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:15,831 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:16,313 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:16,495 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,496 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,497 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,497 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,497 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,498 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:16,498 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-09-04 22:00:16,498 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-09-04 22:00:16,498 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 22:00:16,499 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p3~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse7) (and .cse4 .cse1 .cse7 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse6 .cse3) (and .cse4 .cse1 .cse5 .cse7) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse4 .cse1 .cse3) (and .cse4 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse6 .cse3))) [2020-09-04 22:00:16,499 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-09-04 22:00:16,499 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-09-04 22:00:16,499 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 22:00:16,500 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-09-04 22:00:16,500 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-09-04 22:00:16,500 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-09-04 22:00:16,500 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 22:00:16,501 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 22:00:16,501 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 22:00:16,501 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-09-04 22:00:16,501 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-09-04 22:00:16,502 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-09-04 22:00:16,502 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse2) (and .cse3 .cse0))) [2020-09-04 22:00:16,502 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 22:00:16,502 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-09-04 22:00:16,503 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 22:00:16,503 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 22:00:16,503 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-09-04 22:00:16,503 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-09-04 22:00:16,504 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 22:00:16,504 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-09-04 22:00:16,504 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:00:16,504 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 22:00:16,504 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-09-04 22:00:16,505 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-09-04 22:00:16,505 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-09-04 22:00:16,505 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-09-04 22:00:16,505 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-09-04 22:00:16,506 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 22:00:16,506 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-09-04 22:00:16,506 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse9 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse8 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse5 .cse2 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse1 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse8 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse2 .cse8 .cse9) (and .cse1 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9) (and .cse1 .cse5 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse5 .cse6 .cse3 .cse8 .cse7))) [2020-09-04 22:00:16,507 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 22:00:16,507 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 22:00:16,507 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-09-04 22:00:16,507 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-09-04 22:00:16,507 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 22:00:16,507 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 22:00:16,508 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 22:00:16,508 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-09-04 22:00:16,508 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-09-04 22:00:16,509 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-09-04 22:00:16,509 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 22:00:16,509 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= main_~lk6~0 1) [2020-09-04 22:00:16,509 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-09-04 22:00:16,509 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 22:00:16,510 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse5) (and .cse5 .cse4 .cse1) (and .cse4 .cse1 .cse2) (and .cse3 .cse5 .cse4) (and .cse0 .cse5 .cse1) (and .cse3 .cse0 .cse2))) [2020-09-04 22:00:16,510 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 22:00:16,510 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5))) [2020-09-04 22:00:16,511 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= main_~lk6~0 1) [2020-09-04 22:00:16,512 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse10 (= main_~p1~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse11 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse4) (and .cse8 .cse1 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse10 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse11 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse5) (and .cse0 .cse8 .cse11 .cse6 .cse10 .cse3) (and .cse2 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse8 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse11 .cse6 .cse10 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse3) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse5))) [2020-09-04 22:00:16,512 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 22:00:16,512 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-09-04 22:00:16,513 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-09-04 22:00:16,513 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-09-04 22:00:16,513 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 22:00:16,513 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 22:00:16,513 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 22:00:16,514 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 22:00:16,514 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse7 .cse1 .cse9 .cse3) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-09-04 22:00:16,514 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-09-04 22:00:16,515 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse5 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse0 .cse5 .cse3) (and .cse4 .cse1 .cse5))) [2020-09-04 22:00:16,515 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-09-04 22:00:16,515 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-09-04 22:00:16,515 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:00:16,516 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 22:00:16,516 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 22:00:16,516 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 22:00:16,516 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 22:00:16,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:00:16 BoogieIcfgContainer [2020-09-04 22:00:16,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:00:16,534 INFO L168 Benchmark]: Toolchain (without parser) took 11234.49 ms. Allocated memory was 145.8 MB in the beginning and 379.1 MB in the end (delta: 233.3 MB). Free memory was 103.4 MB in the beginning and 167.6 MB in the end (delta: -64.2 MB). Peak memory consumption was 213.0 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,535 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.87 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,536 INFO L168 Benchmark]: Boogie Preprocessor took 140.09 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 181.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,537 INFO L168 Benchmark]: RCFGBuilder took 449.98 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 161.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,538 INFO L168 Benchmark]: TraceAbstraction took 10214.60 ms. Allocated memory was 203.4 MB in the beginning and 379.1 MB in the end (delta: 175.6 MB). Free memory was 161.2 MB in the beginning and 167.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 213.1 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:16,541 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 422.87 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.09 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 181.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.98 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 161.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10214.60 ms. Allocated memory was 203.4 MB in the beginning and 379.1 MB in the end (delta: 175.6 MB). Free memory was 161.2 MB in the beginning and 167.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 213.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 39212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...