/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:18:38,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:18:38,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:18:38,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:18:38,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:18:38,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:18:38,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:18:38,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:18:38,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:18:38,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:18:38,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:18:38,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:18:38,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:18:38,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:18:38,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:18:38,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:18:38,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:18:38,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:18:38,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:18:38,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:18:38,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:18:38,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:18:38,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:18:38,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:18:38,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:18:38,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:18:38,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:18:38,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:18:38,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:18:38,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:18:38,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:18:38,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:18:38,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:18:38,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:18:38,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:18:38,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:18:38,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:18:38,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:18:38,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:18:38,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:18:38,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:18:38,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:18:38,324 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:18:38,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:18:38,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:18:38,326 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:18:38,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:18:38,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:18:38,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:18:38,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:18:38,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:18:38,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:18:38,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:18:38,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:18:38,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:18:38,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:18:38,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:18:38,328 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:18:38,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:18:38,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:18:38,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:18:38,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:18:38,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:18:38,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:18:38,330 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:18:38,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:18:38,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:18:38,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:18:38,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:18:38,682 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:18:38,683 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 13:18:38,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e635cb751/ca307e4301e64497966bcaec2c9b365a/FLAGa3e67dbbf [2020-07-17 13:18:39,276 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:18:39,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 13:18:39,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e635cb751/ca307e4301e64497966bcaec2c9b365a/FLAGa3e67dbbf [2020-07-17 13:18:39,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e635cb751/ca307e4301e64497966bcaec2c9b365a [2020-07-17 13:18:39,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:18:39,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:18:39,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:18:39,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:18:39,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:18:39,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:18:39" (1/1) ... [2020-07-17 13:18:39,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f17481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:39, skipping insertion in model container [2020-07-17 13:18:39,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:18:39" (1/1) ... [2020-07-17 13:18:39,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:18:39,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:18:39,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:18:39,965 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:18:39,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:18:40,009 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:18:40,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40 WrapperNode [2020-07-17 13:18:40,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:18:40,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:18:40,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:18:40,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:18:40,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... [2020-07-17 13:18:40,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:18:40,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:18:40,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:18:40,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:18:40,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:18:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:18:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:18:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:18:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:18:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:18:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:18:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:18:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:18:40,684 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:18:40,684 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 13:18:40,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:18:40 BoogieIcfgContainer [2020-07-17 13:18:40,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:18:40,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:18:40,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:18:40,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:18:40,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:18:39" (1/3) ... [2020-07-17 13:18:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c60a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:18:40, skipping insertion in model container [2020-07-17 13:18:40,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:40" (2/3) ... [2020-07-17 13:18:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c60a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:18:40, skipping insertion in model container [2020-07-17 13:18:40,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:18:40" (3/3) ... [2020-07-17 13:18:40,699 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-17 13:18:40,711 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:18:40,719 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:18:40,735 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:18:40,759 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:18:40,759 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:18:40,759 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:18:40,759 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:18:40,760 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:18:40,760 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:18:40,760 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:18:40,760 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:18:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-17 13:18:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 13:18:40,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:40,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:40,792 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-17 13:18:40,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:40,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906980368] [2020-07-17 13:18:40,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:41,032 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:41,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906980368] [2020-07-17 13:18:41,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:41,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:41,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730210807] [2020-07-17 13:18:41,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:41,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,065 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-17 13:18:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:41,163 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-17 13:18:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-17 13:18:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:41,182 INFO L225 Difference]: With dead ends: 169 [2020-07-17 13:18:41,182 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 13:18:41,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 13:18:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-17 13:18:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 13:18:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-17 13:18:41,246 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-17 13:18:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:41,247 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-17 13:18:41,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-17 13:18:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 13:18:41,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:41,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:41,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:18:41,251 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-17 13:18:41,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:41,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138471784] [2020-07-17 13:18:41,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:41,340 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:41,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138471784] [2020-07-17 13:18:41,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:41,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:41,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38439035] [2020-07-17 13:18:41,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:41,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,344 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-17 13:18:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:41,386 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-17 13:18:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:41,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 13:18:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:41,390 INFO L225 Difference]: With dead ends: 135 [2020-07-17 13:18:41,391 INFO L226 Difference]: Without dead ends: 133 [2020-07-17 13:18:41,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-17 13:18:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-17 13:18:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 13:18:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-17 13:18:41,419 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-17 13:18:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:41,420 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-17 13:18:41,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-17 13:18:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 13:18:41,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:41,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:41,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:18:41,423 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-17 13:18:41,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:41,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879991303] [2020-07-17 13:18:41,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:41,480 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:41,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879991303] [2020-07-17 13:18:41,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:41,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:41,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920332893] [2020-07-17 13:18:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:41,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,483 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-17 13:18:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:41,585 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-17 13:18:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:41,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 13:18:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:41,589 INFO L225 Difference]: With dead ends: 266 [2020-07-17 13:18:41,589 INFO L226 Difference]: Without dead ends: 185 [2020-07-17 13:18:41,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-17 13:18:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-17 13:18:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-17 13:18:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-17 13:18:41,626 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-17 13:18:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:41,627 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-17 13:18:41,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-17 13:18:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 13:18:41,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:41,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:41,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 13:18:41,631 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-17 13:18:41,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:41,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1536030229] [2020-07-17 13:18:41,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:41,698 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:41,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1536030229] [2020-07-17 13:18:41,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:41,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:41,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978210921] [2020-07-17 13:18:41,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:41,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,703 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-17 13:18:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:41,793 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-17 13:18:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:41,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-17 13:18:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:41,798 INFO L225 Difference]: With dead ends: 479 [2020-07-17 13:18:41,798 INFO L226 Difference]: Without dead ends: 325 [2020-07-17 13:18:41,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-17 13:18:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-17 13:18:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 13:18:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-17 13:18:41,892 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-17 13:18:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:41,892 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-17 13:18:41,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-17 13:18:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 13:18:41,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:41,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:41,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 13:18:41,896 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-17 13:18:41,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:41,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [680618602] [2020-07-17 13:18:41,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:41,973 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:41,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [680618602] [2020-07-17 13:18:41,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:41,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:41,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105045639] [2020-07-17 13:18:41,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:41,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:41,979 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-17 13:18:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:42,030 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-17 13:18:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:42,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-17 13:18:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:42,034 INFO L225 Difference]: With dead ends: 399 [2020-07-17 13:18:42,035 INFO L226 Difference]: Without dead ends: 397 [2020-07-17 13:18:42,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-17 13:18:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-17 13:18:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 13:18:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-17 13:18:42,071 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-17 13:18:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:42,072 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-17 13:18:42,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-17 13:18:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 13:18:42,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:42,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:42,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 13:18:42,076 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-17 13:18:42,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:42,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057029353] [2020-07-17 13:18:42,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:42,136 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:42,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057029353] [2020-07-17 13:18:42,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:42,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:42,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025016413] [2020-07-17 13:18:42,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:42,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,139 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-17 13:18:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:42,184 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-17 13:18:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:42,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-17 13:18:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:42,188 INFO L225 Difference]: With dead ends: 395 [2020-07-17 13:18:42,188 INFO L226 Difference]: Without dead ends: 393 [2020-07-17 13:18:42,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-17 13:18:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-17 13:18:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 13:18:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-17 13:18:42,221 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-17 13:18:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:42,222 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-17 13:18:42,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-17 13:18:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 13:18:42,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:42,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:42,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 13:18:42,225 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-17 13:18:42,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:42,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [57749373] [2020-07-17 13:18:42,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:42,273 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:42,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [57749373] [2020-07-17 13:18:42,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:42,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:42,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809021825] [2020-07-17 13:18:42,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:42,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,277 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-17 13:18:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:42,348 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-17 13:18:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:42,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-17 13:18:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:42,353 INFO L225 Difference]: With dead ends: 887 [2020-07-17 13:18:42,353 INFO L226 Difference]: Without dead ends: 593 [2020-07-17 13:18:42,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-17 13:18:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-17 13:18:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-17 13:18:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-17 13:18:42,409 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-17 13:18:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:42,410 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-17 13:18:42,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-17 13:18:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-17 13:18:42,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:42,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:42,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 13:18:42,413 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-17 13:18:42,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:42,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448206239] [2020-07-17 13:18:42,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:42,487 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:42,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448206239] [2020-07-17 13:18:42,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:42,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:42,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251657908] [2020-07-17 13:18:42,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:42,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,490 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-17 13:18:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:42,562 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-17 13:18:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:42,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-17 13:18:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:42,568 INFO L225 Difference]: With dead ends: 715 [2020-07-17 13:18:42,568 INFO L226 Difference]: Without dead ends: 713 [2020-07-17 13:18:42,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-17 13:18:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-17 13:18:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-17 13:18:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-17 13:18:42,637 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-17 13:18:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:42,637 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-17 13:18:42,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-17 13:18:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-17 13:18:42,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:42,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:42,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 13:18:42,640 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-17 13:18:42,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:42,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893265213] [2020-07-17 13:18:42,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:42,693 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:42,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893265213] [2020-07-17 13:18:42,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:42,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:42,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336660104] [2020-07-17 13:18:42,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:42,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:42,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:42,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,696 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-17 13:18:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:42,800 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-17 13:18:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:42,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-17 13:18:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:42,807 INFO L225 Difference]: With dead ends: 1667 [2020-07-17 13:18:42,807 INFO L226 Difference]: Without dead ends: 1105 [2020-07-17 13:18:42,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-17 13:18:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-17 13:18:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 13:18:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-17 13:18:42,910 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-17 13:18:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:42,910 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-17 13:18:42,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-17 13:18:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 13:18:42,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:42,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:42,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 13:18:42,913 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-17 13:18:42,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:42,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731215438] [2020-07-17 13:18:42,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:42,952 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:42,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731215438] [2020-07-17 13:18:42,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:42,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:42,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565041011] [2020-07-17 13:18:42,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:42,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:42,964 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-17 13:18:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:43,080 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-17 13:18:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:43,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-17 13:18:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:43,088 INFO L225 Difference]: With dead ends: 1315 [2020-07-17 13:18:43,088 INFO L226 Difference]: Without dead ends: 1313 [2020-07-17 13:18:43,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-17 13:18:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-17 13:18:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 13:18:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-17 13:18:43,220 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-17 13:18:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:43,221 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-17 13:18:43,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-17 13:18:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 13:18:43,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:43,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:43,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 13:18:43,225 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-17 13:18:43,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:43,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823297868] [2020-07-17 13:18:43,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:43,263 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:43,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823297868] [2020-07-17 13:18:43,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:43,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:43,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723948279] [2020-07-17 13:18:43,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:43,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:43,267 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-17 13:18:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:43,492 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-17 13:18:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:43,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-17 13:18:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:43,500 INFO L225 Difference]: With dead ends: 3153 [2020-07-17 13:18:43,500 INFO L226 Difference]: Without dead ends: 1103 [2020-07-17 13:18:43,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-17 13:18:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-17 13:18:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 13:18:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-17 13:18:43,630 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-17 13:18:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:43,631 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-17 13:18:43,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-17 13:18:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 13:18:43,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:43,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:43,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 13:18:43,633 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-17 13:18:43,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:43,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514550637] [2020-07-17 13:18:43,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:18:43,661 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:43,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514550637] [2020-07-17 13:18:43,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:43,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:43,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094048219] [2020-07-17 13:18:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:43,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:43,663 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-17 13:18:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:43,749 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-17 13:18:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:43,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-17 13:18:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:43,751 INFO L225 Difference]: With dead ends: 1103 [2020-07-17 13:18:43,751 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:18:43,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:18:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:18:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:18:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:18:43,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-17 13:18:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:43,755 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:18:43,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:18:43,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:18:43,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 13:18:43,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:18:44,156 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:44,396 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-07-17 13:18:45,144 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:18:45,583 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:18:46,097 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 13:18:47,264 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:47,413 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:18:47,679 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:18:48,153 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 13:18:48,535 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:18:48,718 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 13:18:49,013 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 13:18:49,412 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:18:49,550 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,550 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,550 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,550 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,550 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,551 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:18:49,551 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-17 13:18:49,551 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-17 13:18:49,551 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-17 13:18:49,552 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse7 .cse6) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-17 13:18:49,552 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-17 13:18:49,552 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-17 13:18:49,552 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-17 13:18:49,552 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-17 13:18:49,553 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-17 13:18:49,553 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-17 13:18:49,553 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-17 13:18:49,553 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-17 13:18:49,554 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-17 13:18:49,554 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-17 13:18:49,554 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-17 13:18:49,554 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-17 13:18:49,555 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-17 13:18:49,555 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-17 13:18:49,555 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 13:18:49,555 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-17 13:18:49,555 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-17 13:18:49,555 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-17 13:18:49,555 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-17 13:18:49,556 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-17 13:18:49,556 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-17 13:18:49,556 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 13:18:49,556 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-17 13:18:49,556 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-17 13:18:49,556 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-17 13:18:49,556 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-17 13:18:49,556 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-17 13:18:49,557 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-17 13:18:49,557 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-17 13:18:49,557 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-17 13:18:49,557 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-17 13:18:49,557 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-17 13:18:49,558 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-17 13:18:49,558 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-17 13:18:49,559 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-17 13:18:49,559 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-17 13:18:49,559 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-17 13:18:49,559 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-17 13:18:49,559 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-17 13:18:49,559 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-17 13:18:49,559 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-17 13:18:49,559 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-17 13:18:49,560 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-17 13:18:49,560 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-17 13:18:49,560 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-17 13:18:49,560 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-17 13:18:49,561 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-17 13:18:49,561 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-17 13:18:49,561 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-17 13:18:49,561 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-17 13:18:49,561 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-17 13:18:49,561 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-17 13:18:49,561 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-17 13:18:49,562 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-17 13:18:49,562 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-17 13:18:49,562 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 13:18:49,562 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-17 13:18:49,562 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-17 13:18:49,562 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 13:18:49,563 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-17 13:18:49,563 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-17 13:18:49,563 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-17 13:18:49,563 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-17 13:18:49,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 01:18:49 BoogieIcfgContainer [2020-07-17 13:18:49,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 13:18:49,581 INFO L168 Benchmark]: Toolchain (without parser) took 9919.92 ms. Allocated memory was 143.1 MB in the beginning and 385.9 MB in the end (delta: 242.7 MB). Free memory was 101.0 MB in the beginning and 220.9 MB in the end (delta: -119.9 MB). Peak memory consumption was 224.4 MB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,582 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.40 ms. Allocated memory is still 143.1 MB. Free memory was 100.6 MB in the beginning and 90.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,584 INFO L168 Benchmark]: Boogie Preprocessor took 189.10 ms. Allocated memory was 143.1 MB in the beginning and 202.4 MB in the end (delta: 59.2 MB). Free memory was 90.5 MB in the beginning and 179.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,585 INFO L168 Benchmark]: RCFGBuilder took 489.95 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 160.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,586 INFO L168 Benchmark]: TraceAbstraction took 8887.92 ms. Allocated memory was 202.4 MB in the beginning and 385.9 MB in the end (delta: 183.5 MB). Free memory was 160.0 MB in the beginning and 220.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 224.2 MB. Max. memory is 7.1 GB. [2020-07-17 13:18:49,589 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.40 ms. Allocated memory is still 143.1 MB. Free memory was 100.6 MB in the beginning and 90.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.10 ms. Allocated memory was 143.1 MB in the beginning and 202.4 MB in the end (delta: 59.2 MB). Free memory was 90.5 MB in the beginning and 179.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 489.95 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 160.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8887.92 ms. Allocated memory was 202.4 MB in the beginning and 385.9 MB in the end (delta: 183.5 MB). Free memory was 160.0 MB in the beginning and 220.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 224.2 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: 3.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, 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, 78 GetRequests, 66 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.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...