/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label00.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:10:16,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:10:16,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:10:16,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:10:16,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:10:16,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:10:16,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:10:16,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:10:16,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:10:16,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:10:16,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:10:16,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:10:16,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:10:16,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:10:16,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:10:16,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:10:16,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:10:16,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:10:16,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:10:16,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:10:16,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:10:16,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:10:16,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:10:16,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:10:16,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:10:16,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:10:16,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:10:16,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:10:16,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:10:16,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:10:16,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:10:16,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:10:16,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:10:16,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:10:16,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:10:16,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:10:16,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:10:16,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:10:16,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:10:16,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:10:16,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:10:16,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:10:17,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:10:17,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:10:17,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:10:17,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:10:17,011 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:10:17,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:10:17,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:10:17,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:10:17,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:10:17,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:10:17,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:10:17,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:10:17,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:10:17,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:10:17,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:10:17,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:10:17,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:10:17,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:10:17,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:10:17,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:10:17,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:10:17,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:10:17,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:10:17,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:10:17,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:10:17,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:10:17,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:10:17,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:10:17,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:10:17,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:10:17,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:10:17,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:10:17,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:10:17,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:10:17,368 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:10:17,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label00.c [2019-11-23 21:10:17,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96ff0b1c/c660fbc801ad4ba492468fd380351e4e/FLAG5a91b8b99 [2019-11-23 21:10:18,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:10:18,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label00.c [2019-11-23 21:10:18,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96ff0b1c/c660fbc801ad4ba492468fd380351e4e/FLAG5a91b8b99 [2019-11-23 21:10:18,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96ff0b1c/c660fbc801ad4ba492468fd380351e4e [2019-11-23 21:10:18,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:10:18,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:10:18,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:10:18,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:10:18,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:10:18,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:10:18" (1/1) ... [2019-11-23 21:10:18,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de7eecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:18, skipping insertion in model container [2019-11-23 21:10:18,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:10:18" (1/1) ... [2019-11-23 21:10:18,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:10:18,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:10:18,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:10:18,832 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:10:19,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:10:19,250 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:10:19,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19 WrapperNode [2019-11-23 21:10:19,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:10:19,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:10:19,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:10:19,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:10:19,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:10:19,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:10:19,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:10:19,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:10:19,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (1/1) ... [2019-11-23 21:10:19,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:10:19,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:10:19,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:10:19,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:10:19,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (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 [2019-11-23 21:10:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:10:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:10:21,181 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:10:21,181 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:10:21,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:10:21 BoogieIcfgContainer [2019-11-23 21:10:21,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:10:21,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:10:21,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:10:21,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:10:21,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:10:18" (1/3) ... [2019-11-23 21:10:21,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228764d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:10:21, skipping insertion in model container [2019-11-23 21:10:21,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:19" (2/3) ... [2019-11-23 21:10:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228764d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:10:21, skipping insertion in model container [2019-11-23 21:10:21,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:10:21" (3/3) ... [2019-11-23 21:10:21,195 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label00.c [2019-11-23 21:10:21,206 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:10:21,215 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:10:21,227 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:10:21,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:10:21,271 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:10:21,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:10:21,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:10:21,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:10:21,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:10:21,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:10:21,273 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:10:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:10:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 21:10:21,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:21,315 INFO L410 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] [2019-11-23 21:10:21,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-23 21:10:21,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:21,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074710570] [2019-11-23 21:10:21,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:10:21,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074710570] [2019-11-23 21:10:21,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:10:21,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:10:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110260253] [2019-11-23 21:10:21,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:10:21,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:10:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:21,660 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-23 21:10:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:23,573 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-23 21:10:23,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:10:23,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-23 21:10:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:23,607 INFO L225 Difference]: With dead ends: 850 [2019-11-23 21:10:23,608 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:10:23,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:10:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-23 21:10:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:10:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-11-23 21:10:23,704 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 53 [2019-11-23 21:10:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:23,706 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-11-23 21:10:23,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:10:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-11-23 21:10:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 21:10:23,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:23,712 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:23,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 665233748, now seen corresponding path program 1 times [2019-11-23 21:10:23,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:23,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049512798] [2019-11-23 21:10:23,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:10:23,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049512798] [2019-11-23 21:10:23,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:10:23,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:10:23,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85201536] [2019-11-23 21:10:23,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:10:23,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:10:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:23,957 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-11-23 21:10:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:25,301 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-11-23 21:10:25,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:10:25,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 21:10:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:25,311 INFO L225 Difference]: With dead ends: 2142 [2019-11-23 21:10:25,311 INFO L226 Difference]: Without dead ends: 1606 [2019-11-23 21:10:25,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-23 21:10:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2019-11-23 21:10:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-11-23 21:10:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2256 transitions. [2019-11-23 21:10:25,381 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2256 transitions. Word has length 118 [2019-11-23 21:10:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:25,382 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 2256 transitions. [2019-11-23 21:10:25,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:10:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2256 transitions. [2019-11-23 21:10:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 21:10:25,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:25,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:25,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -282099970, now seen corresponding path program 1 times [2019-11-23 21:10:25,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:25,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51585446] [2019-11-23 21:10:25,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:10:25,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51585446] [2019-11-23 21:10:25,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:10:25,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:10:25,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902607997] [2019-11-23 21:10:25,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:10:25,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:10:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:25,513 INFO L87 Difference]: Start difference. First operand 1606 states and 2256 transitions. Second operand 4 states. [2019-11-23 21:10:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:26,849 INFO L93 Difference]: Finished difference Result 4992 states and 7086 transitions. [2019-11-23 21:10:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:10:26,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-23 21:10:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:26,868 INFO L225 Difference]: With dead ends: 4992 [2019-11-23 21:10:26,868 INFO L226 Difference]: Without dead ends: 3388 [2019-11-23 21:10:26,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:10:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-11-23 21:10:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3208. [2019-11-23 21:10:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-23 21:10:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4196 transitions. [2019-11-23 21:10:26,947 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4196 transitions. Word has length 121 [2019-11-23 21:10:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:26,950 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4196 transitions. [2019-11-23 21:10:26,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:10:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4196 transitions. [2019-11-23 21:10:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 21:10:26,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:26,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:26,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1253085156, now seen corresponding path program 1 times [2019-11-23 21:10:26,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:26,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514383143] [2019-11-23 21:10:26,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:10:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514383143] [2019-11-23 21:10:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939537938] [2019-11-23 21:10:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:27,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:10:27,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:10:27,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:10:27,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:10:27,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306378801] [2019-11-23 21:10:27,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:10:27,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:10:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:27,488 INFO L87 Difference]: Start difference. First operand 3208 states and 4196 transitions. Second operand 3 states. [2019-11-23 21:10:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:28,313 INFO L93 Difference]: Finished difference Result 7482 states and 9887 transitions. [2019-11-23 21:10:28,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:10:28,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 21:10:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:28,340 INFO L225 Difference]: With dead ends: 7482 [2019-11-23 21:10:28,340 INFO L226 Difference]: Without dead ends: 4454 [2019-11-23 21:10:28,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-23 21:10:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2019-11-23 21:10:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-23 21:10:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5028 transitions. [2019-11-23 21:10:28,472 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5028 transitions. Word has length 133 [2019-11-23 21:10:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:28,474 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 5028 transitions. [2019-11-23 21:10:28,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:10:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5028 transitions. [2019-11-23 21:10:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-23 21:10:28,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:28,492 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:28,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:28,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1257352591, now seen corresponding path program 1 times [2019-11-23 21:10:28,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:28,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142446175] [2019-11-23 21:10:28,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 21:10:29,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142446175] [2019-11-23 21:10:29,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357783299] [2019-11-23 21:10:29,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:29,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:10:29,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:10:29,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:10:29,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:10:29,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115904161] [2019-11-23 21:10:29,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:10:29,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:10:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:29,467 INFO L87 Difference]: Start difference. First operand 3920 states and 5028 transitions. Second operand 3 states. [2019-11-23 21:10:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:30,431 INFO L93 Difference]: Finished difference Result 8372 states and 10883 transitions. [2019-11-23 21:10:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:10:30,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-23 21:10:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:30,453 INFO L225 Difference]: With dead ends: 8372 [2019-11-23 21:10:30,453 INFO L226 Difference]: Without dead ends: 4632 [2019-11-23 21:10:30,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-23 21:10:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3920. [2019-11-23 21:10:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-23 21:10:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4839 transitions. [2019-11-23 21:10:30,561 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4839 transitions. Word has length 294 [2019-11-23 21:10:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:30,562 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4839 transitions. [2019-11-23 21:10:30,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:10:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4839 transitions. [2019-11-23 21:10:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-23 21:10:30,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:30,579 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:30,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:30,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2139630150, now seen corresponding path program 1 times [2019-11-23 21:10:30,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:30,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551623498] [2019-11-23 21:10:30,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 262 proven. 4 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-23 21:10:31,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551623498] [2019-11-23 21:10:31,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038512793] [2019-11-23 21:10:31,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:31,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:10:31,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-23 21:10:31,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:10:31,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:10:31,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507803220] [2019-11-23 21:10:31,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:10:31,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:10:31,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:31,423 INFO L87 Difference]: Start difference. First operand 3920 states and 4839 transitions. Second operand 3 states. [2019-11-23 21:10:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:32,424 INFO L93 Difference]: Finished difference Result 7482 states and 9302 transitions. [2019-11-23 21:10:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:10:32,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-23 21:10:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:32,442 INFO L225 Difference]: With dead ends: 7482 [2019-11-23 21:10:32,442 INFO L226 Difference]: Without dead ends: 3920 [2019-11-23 21:10:32,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-23 21:10:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-23 21:10:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-23 21:10:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4546 transitions. [2019-11-23 21:10:32,524 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4546 transitions. Word has length 354 [2019-11-23 21:10:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:32,525 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 4546 transitions. [2019-11-23 21:10:32,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:10:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4546 transitions. [2019-11-23 21:10:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-23 21:10:32,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:32,535 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:32,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:32,741 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1290220651, now seen corresponding path program 1 times [2019-11-23 21:10:32,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:32,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450870633] [2019-11-23 21:10:32,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 261 proven. 4 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-23 21:10:32,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450870633] [2019-11-23 21:10:32,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178669795] [2019-11-23 21:10:32,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:33,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 21:10:33,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-23 21:10:33,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:10:33,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-11-23 21:10:33,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770135127] [2019-11-23 21:10:33,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:10:33,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:10:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:10:33,358 INFO L87 Difference]: Start difference. First operand 3742 states and 4546 transitions. Second operand 4 states. [2019-11-23 21:10:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:34,776 INFO L93 Difference]: Finished difference Result 8914 states and 10948 transitions. [2019-11-23 21:10:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:10:34,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-23 21:10:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:34,798 INFO L225 Difference]: With dead ends: 8914 [2019-11-23 21:10:34,798 INFO L226 Difference]: Without dead ends: 5344 [2019-11-23 21:10:34,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:10:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-11-23 21:10:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4810. [2019-11-23 21:10:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-23 21:10:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5833 transitions. [2019-11-23 21:10:34,901 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5833 transitions. Word has length 361 [2019-11-23 21:10:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:34,902 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5833 transitions. [2019-11-23 21:10:34,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:10:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5833 transitions. [2019-11-23 21:10:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-23 21:10:34,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:34,917 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:35,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:35,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 135550644, now seen corresponding path program 1 times [2019-11-23 21:10:35,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:35,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16123400] [2019-11-23 21:10:35,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 262 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-23 21:10:35,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16123400] [2019-11-23 21:10:35,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897876259] [2019-11-23 21:10:35,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:35,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:10:35,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-23 21:10:36,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:10:36,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:10:36,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739778118] [2019-11-23 21:10:36,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:10:36,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:10:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:36,101 INFO L87 Difference]: Start difference. First operand 4810 states and 5833 transitions. Second operand 4 states. [2019-11-23 21:10:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:36,992 INFO L93 Difference]: Finished difference Result 9320 states and 11342 transitions. [2019-11-23 21:10:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:10:36,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 418 [2019-11-23 21:10:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:37,011 INFO L225 Difference]: With dead ends: 9320 [2019-11-23 21:10:37,011 INFO L226 Difference]: Without dead ends: 4810 [2019-11-23 21:10:37,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-23 21:10:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2019-11-23 21:10:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:10:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5079 transitions. [2019-11-23 21:10:37,085 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5079 transitions. Word has length 418 [2019-11-23 21:10:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:37,085 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 5079 transitions. [2019-11-23 21:10:37,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:10:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5079 transitions. [2019-11-23 21:10:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-11-23 21:10:37,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:37,103 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:37,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:37,313 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1744234854, now seen corresponding path program 1 times [2019-11-23 21:10:37,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:37,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74391581] [2019-11-23 21:10:37,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 452 proven. 65 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-23 21:10:38,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74391581] [2019-11-23 21:10:38,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463755149] [2019-11-23 21:10:38,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:38,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 21:10:38,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 553 proven. 134 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-23 21:10:39,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:10:39,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-23 21:10:39,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037007180] [2019-11-23 21:10:39,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:10:39,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:39,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:10:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:10:39,426 INFO L87 Difference]: Start difference. First operand 4632 states and 5079 transitions. Second operand 11 states. [2019-11-23 21:10:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:45,037 INFO L93 Difference]: Finished difference Result 11410 states and 12607 transitions. [2019-11-23 21:10:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:10:45,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 513 [2019-11-23 21:10:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:45,054 INFO L225 Difference]: With dead ends: 11410 [2019-11-23 21:10:45,054 INFO L226 Difference]: Without dead ends: 5350 [2019-11-23 21:10:45,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:10:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2019-11-23 21:10:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 4454. [2019-11-23 21:10:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:10:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4692 transitions. [2019-11-23 21:10:45,121 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4692 transitions. Word has length 513 [2019-11-23 21:10:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:45,122 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4692 transitions. [2019-11-23 21:10:45,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:10:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4692 transitions. [2019-11-23 21:10:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2019-11-23 21:10:45,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:45,156 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:45,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:45,360 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1910546673, now seen corresponding path program 1 times [2019-11-23 21:10:45,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:45,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770607288] [2019-11-23 21:10:45,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-11-23 21:10:46,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770607288] [2019-11-23 21:10:46,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:10:46,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:10:46,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644154976] [2019-11-23 21:10:46,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:10:46,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:10:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:10:46,916 INFO L87 Difference]: Start difference. First operand 4454 states and 4692 transitions. Second operand 6 states. [2019-11-23 21:10:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:48,194 INFO L93 Difference]: Finished difference Result 9461 states and 9951 transitions. [2019-11-23 21:10:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:10:48,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 939 [2019-11-23 21:10:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:48,204 INFO L225 Difference]: With dead ends: 9461 [2019-11-23 21:10:48,204 INFO L226 Difference]: Without dead ends: 5365 [2019-11-23 21:10:48,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:10:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-11-23 21:10:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 4454. [2019-11-23 21:10:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:10:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4692 transitions. [2019-11-23 21:10:48,270 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4692 transitions. Word has length 939 [2019-11-23 21:10:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:48,271 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4692 transitions. [2019-11-23 21:10:48,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:10:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4692 transitions. [2019-11-23 21:10:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2019-11-23 21:10:48,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:48,285 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:48,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 29750968, now seen corresponding path program 1 times [2019-11-23 21:10:48,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:48,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837585462] [2019-11-23 21:10:48,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2541 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-11-23 21:10:50,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837585462] [2019-11-23 21:10:50,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:10:50,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:10:50,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633075861] [2019-11-23 21:10:50,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:10:50,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:10:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:10:50,747 INFO L87 Difference]: Start difference. First operand 4454 states and 4692 transitions. Second operand 7 states. [2019-11-23 21:10:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:10:51,880 INFO L93 Difference]: Finished difference Result 9443 states and 9932 transitions. [2019-11-23 21:10:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:10:51,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 946 [2019-11-23 21:10:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:10:51,894 INFO L225 Difference]: With dead ends: 9443 [2019-11-23 21:10:51,895 INFO L226 Difference]: Without dead ends: 5169 [2019-11-23 21:10:51,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:10:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-11-23 21:10:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 4632. [2019-11-23 21:10:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:10:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4872 transitions. [2019-11-23 21:10:51,960 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4872 transitions. Word has length 946 [2019-11-23 21:10:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:10:51,961 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4872 transitions. [2019-11-23 21:10:51,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:10:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4872 transitions. [2019-11-23 21:10:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-23 21:10:51,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:10:51,975 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:10:51,975 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:10:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:10:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1371405250, now seen corresponding path program 1 times [2019-11-23 21:10:51,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:10:51,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897726917] [2019-11-23 21:10:51,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:10:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 1094 proven. 617 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2019-11-23 21:10:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897726917] [2019-11-23 21:10:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488398918] [2019-11-23 21:10:55,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:10:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:10:55,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 21:10:55,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:10:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 859 proven. 267 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2019-11-23 21:10:56,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:10:56,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-23 21:10:56,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065647142] [2019-11-23 21:10:56,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:10:56,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:10:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:10:56,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:10:56,411 INFO L87 Difference]: Start difference. First operand 4632 states and 4872 transitions. Second operand 9 states. [2019-11-23 21:11:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:00,069 INFO L93 Difference]: Finished difference Result 10235 states and 10806 transitions. [2019-11-23 21:11:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 21:11:00,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1014 [2019-11-23 21:11:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:00,082 INFO L225 Difference]: With dead ends: 10235 [2019-11-23 21:11:00,082 INFO L226 Difference]: Without dead ends: 5783 [2019-11-23 21:11:00,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:11:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5783 states. [2019-11-23 21:11:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5783 to 5166. [2019-11-23 21:11:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-23 21:11:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5406 transitions. [2019-11-23 21:11:00,155 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5406 transitions. Word has length 1014 [2019-11-23 21:11:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:00,156 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5406 transitions. [2019-11-23 21:11:00,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:11:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5406 transitions. [2019-11-23 21:11:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1106 [2019-11-23 21:11:00,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:00,173 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:11:00,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:00,377 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -263384217, now seen corresponding path program 1 times [2019-11-23 21:11:00,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:00,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449497548] [2019-11-23 21:11:00,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3816 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 2510 trivial. 0 not checked. [2019-11-23 21:11:01,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449497548] [2019-11-23 21:11:01,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:01,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:11:01,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283233003] [2019-11-23 21:11:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:11:01,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:11:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:11:01,860 INFO L87 Difference]: Start difference. First operand 5166 states and 5406 transitions. Second operand 7 states. [2019-11-23 21:11:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:02,614 INFO L93 Difference]: Finished difference Result 10068 states and 10526 transitions. [2019-11-23 21:11:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:11:02,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1105 [2019-11-23 21:11:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:02,625 INFO L225 Difference]: With dead ends: 10068 [2019-11-23 21:11:02,625 INFO L226 Difference]: Without dead ends: 4988 [2019-11-23 21:11:02,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:11:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-23 21:11:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-11-23 21:11:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-23 21:11:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5195 transitions. [2019-11-23 21:11:02,691 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5195 transitions. Word has length 1105 [2019-11-23 21:11:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:02,692 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5195 transitions. [2019-11-23 21:11:02,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:11:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5195 transitions. [2019-11-23 21:11:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2019-11-23 21:11:02,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:02,711 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:11:02,711 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 668795038, now seen corresponding path program 1 times [2019-11-23 21:11:02,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345035100] [2019-11-23 21:11:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4652 backedges. 1455 proven. 0 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-11-23 21:11:03,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345035100] [2019-11-23 21:11:03,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:03,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:11:03,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411234853] [2019-11-23 21:11:03,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:11:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:11:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:11:03,749 INFO L87 Difference]: Start difference. First operand 4988 states and 5195 transitions. Second operand 5 states. [2019-11-23 21:11:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:05,144 INFO L93 Difference]: Finished difference Result 11042 states and 11541 transitions. [2019-11-23 21:11:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:11:05,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1199 [2019-11-23 21:11:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:05,154 INFO L225 Difference]: With dead ends: 11042 [2019-11-23 21:11:05,155 INFO L226 Difference]: Without dead ends: 4276 [2019-11-23 21:11:05,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:11:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-23 21:11:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2019-11-23 21:11:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-23 21:11:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4024 transitions. [2019-11-23 21:11:05,213 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4024 transitions. Word has length 1199 [2019-11-23 21:11:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:05,215 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4024 transitions. [2019-11-23 21:11:05,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:11:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4024 transitions. [2019-11-23 21:11:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2019-11-23 21:11:05,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:05,240 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:11:05,240 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash 33821815, now seen corresponding path program 1 times [2019-11-23 21:11:05,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:05,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840277473] [2019-11-23 21:11:05,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4145 backedges. 1331 proven. 0 refuted. 0 times theorem prover too weak. 2814 trivial. 0 not checked. [2019-11-23 21:11:06,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840277473] [2019-11-23 21:11:06,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:06,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:11:06,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860812992] [2019-11-23 21:11:06,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:11:06,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:06,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:11:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:06,386 INFO L87 Difference]: Start difference. First operand 3920 states and 4024 transitions. Second operand 4 states. [2019-11-23 21:11:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:07,262 INFO L93 Difference]: Finished difference Result 7836 states and 8047 transitions. [2019-11-23 21:11:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:11:07,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1201 [2019-11-23 21:11:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:07,264 INFO L225 Difference]: With dead ends: 7836 [2019-11-23 21:11:07,264 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:11:07,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:11:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:11:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:11:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:11:07,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1201 [2019-11-23 21:11:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:07,270 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:11:07,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:11:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:11:07,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:11:07,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:11:07,663 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 185 [2019-11-23 21:11:08,003 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 183 [2019-11-23 21:11:09,140 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 154 DAG size of output: 74 [2019-11-23 21:11:10,295 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 154 DAG size of output: 74 [2019-11-23 21:11:10,300 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:11:10,300 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:11:10,300 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,300 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,300 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:11:10,301 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:11:10,302 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:11:10,303 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:11:10,304 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:11:10,305 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:11:10,306 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,307 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,308 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:11:10,309 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:11:10,310 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:11:10,311 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,312 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:11:10,313 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:11:10,314 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,314 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,314 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse21 (+ ~a12~0 43))) (let ((.cse17 (<= .cse21 0)) (.cse18 (< 11 ~a12~0)) (.cse20 (= ~a21~0 9)) (.cse19 (= ~a15~0 9)) (.cse7 (= ~a15~0 5))) (let ((.cse5 (not .cse7)) (.cse15 (<= (+ ~a12~0 49) 0)) (.cse3 (<= ~a21~0 6)) (.cse4 (<= 58 ~a12~0)) (.cse13 (<= 9 ~a21~0)) (.cse16 (= ~a15~0 8)) (.cse6 (= ~a21~0 7)) (.cse14 (<= ~a12~0 11)) (.cse12 (< 0 .cse21)) (.cse8 (not .cse19)) (.cse9 (<= ~a12~0 80)) (.cse10 (not .cse20)) (.cse1 (or .cse17 .cse18)) (.cse2 (<= ~a15~0 7)) (.cse0 (= ~a24~0 1)) (.cse11 (<= 8 ~a21~0))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse2 .cse0 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse7 .cse3) (and .cse8 .cse9 .cse10 .cse1 .cse0 .cse11 .cse12) (and .cse13 .cse1 .cse0 .cse14) (and .cse13 .cse5 .cse2 .cse0) (and .cse9 .cse4 .cse0) (and .cse2 .cse15 .cse3) (and .cse16 .cse0 .cse6 .cse15) (and .cse4 .cse0 .cse3) (and .cse4 .cse16 .cse0) (and .cse8 .cse0 .cse15 .cse3) (and .cse0 (or .cse17 .cse18 (not (= 1 ULTIMATE.start_calculate_output_~input))) (= ~a21~0 8) .cse19) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse16 .cse0 .cse20) (and .cse13 .cse4 .cse0) (and .cse8 .cse13 .cse1 .cse0) (and .cse13 .cse10 .cse0 .cse14) (and .cse16 .cse0 .cse6 .cse14 .cse12) (and .cse8 .cse9 .cse10 .cse1 .cse2 .cse0 .cse11))))) [2019-11-23 21:11:10,314 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:11:10,314 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:11:10,314 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,315 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:11:10,315 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:11:10,316 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse21 (+ ~a12~0 43))) (let ((.cse17 (<= .cse21 0)) (.cse18 (< 11 ~a12~0)) (.cse20 (= ~a21~0 9)) (.cse19 (= ~a15~0 9)) (.cse7 (= ~a15~0 5))) (let ((.cse5 (not .cse7)) (.cse15 (<= (+ ~a12~0 49) 0)) (.cse3 (<= ~a21~0 6)) (.cse4 (<= 58 ~a12~0)) (.cse13 (<= 9 ~a21~0)) (.cse16 (= ~a15~0 8)) (.cse6 (= ~a21~0 7)) (.cse14 (<= ~a12~0 11)) (.cse12 (< 0 .cse21)) (.cse8 (not .cse19)) (.cse9 (<= ~a12~0 80)) (.cse10 (not .cse20)) (.cse1 (or .cse17 .cse18)) (.cse2 (<= ~a15~0 7)) (.cse0 (= ~a24~0 1)) (.cse11 (<= 8 ~a21~0))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse2 .cse0 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse7 .cse3) (and .cse8 .cse9 .cse10 .cse1 .cse0 .cse11 .cse12) (and .cse13 .cse1 .cse0 .cse14) (and .cse13 .cse5 .cse2 .cse0) (and .cse9 .cse4 .cse0) (and .cse2 .cse15 .cse3) (and .cse16 .cse0 .cse6 .cse15) (and .cse4 .cse0 .cse3) (and .cse4 .cse16 .cse0) (and .cse8 .cse0 .cse15 .cse3) (and .cse0 (or .cse17 .cse18 (not (= 1 ULTIMATE.start_calculate_output_~input))) (= ~a21~0 8) .cse19) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse16 .cse0 .cse20) (and .cse13 .cse4 .cse0) (and .cse8 .cse13 .cse1 .cse0) (and .cse13 .cse10 .cse0 .cse14) (and .cse16 .cse0 .cse6 .cse14 .cse12) (and .cse8 .cse9 .cse10 .cse1 .cse2 .cse0 .cse11))))) [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:11:10,317 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:11:10,318 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:11:10,319 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:11:10,320 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:11:10,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:11:10 BoogieIcfgContainer [2019-11-23 21:11:10,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:11:10,349 INFO L168 Benchmark]: Toolchain (without parser) took 52090.04 ms. Allocated memory was 143.1 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.7 MB in the beginning and 1.0 GB in the end (delta: -900.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,350 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 143.1 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 21:11:10,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 991.53 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 99.3 MB in the beginning and 166.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.42 ms. Allocated memory is still 203.9 MB. Free memory was 166.7 MB in the beginning and 157.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,352 INFO L168 Benchmark]: Boogie Preprocessor took 99.99 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 149.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,352 INFO L168 Benchmark]: RCFGBuilder took 1698.63 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 149.6 MB in the beginning and 138.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,353 INFO L168 Benchmark]: TraceAbstraction took 49163.23 ms. Allocated memory was 233.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: -862.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-11-23 21:11:10,357 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 143.1 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 991.53 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 99.3 MB in the beginning and 166.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.42 ms. Allocated memory is still 203.9 MB. Free memory was 166.7 MB in the beginning and 157.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.99 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 149.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1698.63 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 149.6 MB in the beginning and 138.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49163.23 ms. Allocated memory was 233.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: -862.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((a15 == 7 && a24 == 1) || ((((a12 + 43 <= 0 || 11 < a12) && a15 <= 7) && a24 == 1) && a21 <= 6)) || (((58 <= a12 && !(a15 == 5)) && a24 == 1) && a21 == 7)) || ((a24 == 1 && a15 == 5) && a21 <= 6)) || ((((((!(a15 == 9) && a12 <= 80) && !(a21 == 9)) && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1) && 8 <= a21) && 0 < a12 + 43)) || (((9 <= a21 && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1) && a12 <= 11)) || (((9 <= a21 && !(a15 == 5)) && a15 <= 7) && a24 == 1)) || ((a12 <= 80 && 58 <= a12) && a24 == 1)) || ((a15 <= 7 && a12 + 49 <= 0) && a21 <= 6)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((58 <= a12 && a24 == 1) && a21 <= 6)) || ((58 <= a12 && a15 == 8) && a24 == 1)) || (((!(a15 == 9) && a24 == 1) && a12 + 49 <= 0) && a21 <= 6)) || (((a24 == 1 && ((a12 + 43 <= 0 || 11 < a12) || !(1 == input))) && a21 == 8) && a15 == 9)) || (((!(5 == input) && a15 == 8) && a24 == 1) && a21 == 9)) || ((9 <= a21 && 58 <= a12) && a24 == 1)) || (((!(a15 == 9) && 9 <= a21) && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1)) || (((9 <= a21 && !(a21 == 9)) && a24 == 1) && a12 <= 11)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((((!(a15 == 9) && a12 <= 80) && !(a21 == 9)) && (a12 + 43 <= 0 || 11 < a12)) && a15 <= 7) && a24 == 1) && 8 <= a21) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((a15 == 7 && a24 == 1) || ((((a12 + 43 <= 0 || 11 < a12) && a15 <= 7) && a24 == 1) && a21 <= 6)) || (((58 <= a12 && !(a15 == 5)) && a24 == 1) && a21 == 7)) || ((a24 == 1 && a15 == 5) && a21 <= 6)) || ((((((!(a15 == 9) && a12 <= 80) && !(a21 == 9)) && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1) && 8 <= a21) && 0 < a12 + 43)) || (((9 <= a21 && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1) && a12 <= 11)) || (((9 <= a21 && !(a15 == 5)) && a15 <= 7) && a24 == 1)) || ((a12 <= 80 && 58 <= a12) && a24 == 1)) || ((a15 <= 7 && a12 + 49 <= 0) && a21 <= 6)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((58 <= a12 && a24 == 1) && a21 <= 6)) || ((58 <= a12 && a15 == 8) && a24 == 1)) || (((!(a15 == 9) && a24 == 1) && a12 + 49 <= 0) && a21 <= 6)) || (((a24 == 1 && ((a12 + 43 <= 0 || 11 < a12) || !(1 == input))) && a21 == 8) && a15 == 9)) || (((!(5 == input) && a15 == 8) && a24 == 1) && a21 == 9)) || ((9 <= a21 && 58 <= a12) && a24 == 1)) || (((!(a15 == 9) && 9 <= a21) && (a12 + 43 <= 0 || 11 < a12)) && a24 == 1)) || (((9 <= a21 && !(a21 == 9)) && a24 == 1) && a12 <= 11)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((((!(a15 == 9) && a12 <= 80) && !(a21 == 9)) && (a12 + 43 <= 0 || 11 < a12)) && a15 <= 7) && a24 == 1) && 8 <= a21) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 49.0s, OverallIterations: 15, TraceHistogramMax: 11, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 1375 SDtfs, 5653 SDslu, 259 SDs, 0 SdLazy, 18995 SolverSat, 1893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3189 GetRequests, 3085 SyntacticMatches, 9 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 5633 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 637 HoareAnnotationTreeSize, 3 FomulaSimplifications, 28490 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 12404 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 11856 NumberOfCodeBlocks, 11856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 11834 ConstructedInterpolants, 0 QuantifiedInterpolants, 36086440 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 26873/27976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...