/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:04,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:04,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:04,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:04,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:04,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:04,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:04,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:04,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:04,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:04,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:04,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:04,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:04,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:04,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:04,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:04,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:04,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:04,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:04,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:04,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:04,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:04,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:04,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:04,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:04,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:04,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:04,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:04,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:04,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:04,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:04,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:04,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:04,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:04,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:04,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:04,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:04,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:04,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:04,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:04,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:04,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:33:04,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:04,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:04,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:04,505 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:04,505 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:04,505 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:04,506 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:04,507 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:04,507 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:04,507 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:04,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:04,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:04,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:04,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:04,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:04,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:04,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:04,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:04,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:04,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:04,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:04,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:04,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:04,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:04,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:04,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:04,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:04,515 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:04,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:04,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:04,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:04,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:04,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:04,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label42.c [2019-11-23 23:33:04,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1aead9e/62d5e6a3321c4c828af655d1e402ce6d/FLAGaf0998a89 [2019-11-23 23:33:05,503 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:05,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label42.c [2019-11-23 23:33:05,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1aead9e/62d5e6a3321c4c828af655d1e402ce6d/FLAGaf0998a89 [2019-11-23 23:33:05,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1aead9e/62d5e6a3321c4c828af655d1e402ce6d [2019-11-23 23:33:05,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:05,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:05,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:05,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:05,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:05,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:05" (1/1) ... [2019-11-23 23:33:05,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70da3b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:05, skipping insertion in model container [2019-11-23 23:33:05,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:05" (1/1) ... [2019-11-23 23:33:05,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:05,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:06,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:06,437 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:06,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:06,585 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:06,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06 WrapperNode [2019-11-23 23:33:06,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:06,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:06,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:06,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:06,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:06,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:06,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:06,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:06,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (1/1) ... [2019-11-23 23:33:06,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:06,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:06,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:06,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:06,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (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 23:33:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:08,965 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:08,966 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:08,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:08 BoogieIcfgContainer [2019-11-23 23:33:08,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:08,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:08,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:08,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:08,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:05" (1/3) ... [2019-11-23 23:33:08,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b79ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:08, skipping insertion in model container [2019-11-23 23:33:08,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:06" (2/3) ... [2019-11-23 23:33:08,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b79ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:08, skipping insertion in model container [2019-11-23 23:33:08,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:08" (3/3) ... [2019-11-23 23:33:08,982 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label42.c [2019-11-23 23:33:08,992 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:09,001 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:09,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:09,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:09,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:09,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:09,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:09,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:09,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:09,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:09,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:33:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:33:09,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:09,084 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, 1, 1, 1, 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 23:33:09,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 925947529, now seen corresponding path program 1 times [2019-11-23 23:33:09,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:09,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988749662] [2019-11-23 23:33:09,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:09,549 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 23:33:09,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988749662] [2019-11-23 23:33:09,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:09,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:09,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873522252] [2019-11-23 23:33:09,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:09,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:09,580 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:33:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:10,431 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:33:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:10,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:33:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:10,449 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:33:10,449 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:33:10,453 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 23:33:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:33:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:33:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:33:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-23 23:33:10,539 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-23 23:33:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:10,540 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-23 23:33:10,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-23 23:33:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 23:33:10,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:10,553 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:33:10,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash 782306330, now seen corresponding path program 1 times [2019-11-23 23:33:10,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:10,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297916655] [2019-11-23 23:33:10,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:10,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297916655] [2019-11-23 23:33:10,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:10,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:10,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171090593] [2019-11-23 23:33:10,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:10,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:10,661 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 3 states. [2019-11-23 23:33:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:11,104 INFO L93 Difference]: Finished difference Result 725 states and 1191 transitions. [2019-11-23 23:33:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:11,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 23:33:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:11,111 INFO L225 Difference]: With dead ends: 725 [2019-11-23 23:33:11,111 INFO L226 Difference]: Without dead ends: 483 [2019-11-23 23:33:11,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-23 23:33:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-23 23:33:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:33:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 739 transitions. [2019-11-23 23:33:11,151 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 739 transitions. Word has length 95 [2019-11-23 23:33:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:11,151 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 739 transitions. [2019-11-23 23:33:11,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 739 transitions. [2019-11-23 23:33:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:33:11,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:11,156 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:33:11,157 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -6967595, now seen corresponding path program 1 times [2019-11-23 23:33:11,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:11,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601231195] [2019-11-23 23:33:11,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 23:33:11,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601231195] [2019-11-23 23:33:11,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:11,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:11,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66279424] [2019-11-23 23:33:11,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:11,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:11,245 INFO L87 Difference]: Start difference. First operand 483 states and 739 transitions. Second operand 4 states. [2019-11-23 23:33:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:12,007 INFO L93 Difference]: Finished difference Result 1845 states and 2795 transitions. [2019-11-23 23:33:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:12,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-23 23:33:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:12,017 INFO L225 Difference]: With dead ends: 1845 [2019-11-23 23:33:12,018 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:33:12,021 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 23:33:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:33:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 883. [2019-11-23 23:33:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:33:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1258 transitions. [2019-11-23 23:33:12,070 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1258 transitions. Word has length 113 [2019-11-23 23:33:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:12,070 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1258 transitions. [2019-11-23 23:33:12,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1258 transitions. [2019-11-23 23:33:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 23:33:12,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:12,077 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:33:12,078 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1236694342, now seen corresponding path program 1 times [2019-11-23 23:33:12,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:12,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898679657] [2019-11-23 23:33:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-23 23:33:12,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898679657] [2019-11-23 23:33:12,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:12,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:12,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452068404] [2019-11-23 23:33:12,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:12,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:12,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:12,139 INFO L87 Difference]: Start difference. First operand 883 states and 1258 transitions. Second operand 3 states. [2019-11-23 23:33:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:12,605 INFO L93 Difference]: Finished difference Result 2085 states and 3025 transitions. [2019-11-23 23:33:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:12,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-23 23:33:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:12,614 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:33:12,614 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:33:12,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:33:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-11-23 23:33:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:33:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1443 transitions. [2019-11-23 23:33:12,652 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1443 transitions. Word has length 132 [2019-11-23 23:33:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:12,652 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1443 transitions. [2019-11-23 23:33:12,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1443 transitions. [2019-11-23 23:33:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 23:33:12,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:12,657 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:33:12,657 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash -134838992, now seen corresponding path program 1 times [2019-11-23 23:33:12,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:12,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354167006] [2019-11-23 23:33:12,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-23 23:33:12,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354167006] [2019-11-23 23:33:12,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:12,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:12,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253756749] [2019-11-23 23:33:12,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:12,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:12,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:12,752 INFO L87 Difference]: Start difference. First operand 1043 states and 1443 transitions. Second operand 3 states. [2019-11-23 23:33:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:13,075 INFO L93 Difference]: Finished difference Result 2165 states and 2995 transitions. [2019-11-23 23:33:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:13,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-23 23:33:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:13,081 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:33:13,081 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:33:13,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:33:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-23 23:33:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:33:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1528 transitions. [2019-11-23 23:33:13,109 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1528 transitions. Word has length 136 [2019-11-23 23:33:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:13,109 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1528 transitions. [2019-11-23 23:33:13,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1528 transitions. [2019-11-23 23:33:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:33:13,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:13,113 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 23:33:13,113 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:13,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1585363542, now seen corresponding path program 1 times [2019-11-23 23:33:13,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:13,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330214571] [2019-11-23 23:33:13,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:33:13,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330214571] [2019-11-23 23:33:13,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171189830] [2019-11-23 23:33:13,218 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 23:33:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:13,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:33:13,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:33:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 23:33:13,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:33:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 23:33:13,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:33:13,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:33:13,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340067377] [2019-11-23 23:33:13,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:13,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:33:13,452 INFO L87 Difference]: Start difference. First operand 1123 states and 1528 transitions. Second operand 3 states. [2019-11-23 23:33:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:13,676 INFO L93 Difference]: Finished difference Result 2163 states and 2923 transitions. [2019-11-23 23:33:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:13,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 23:33:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:13,678 INFO L225 Difference]: With dead ends: 2163 [2019-11-23 23:33:13,678 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:33:13,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 311 SyntacticMatches, 2 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 23:33:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:33:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:33:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:33:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:33:13,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2019-11-23 23:33:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:13,682 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:33:13,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:33:13,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:33:13,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:33:13,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:33:13,998 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:33:13,999 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:33:14,004 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:33:14,004 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:33:14,005 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:33:14,006 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:33:14,007 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:33:14,007 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 472) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:33:14,008 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:33:14,009 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 8))) (or (and .cse0 (not (= ~a11~0 1))) (and (not (= ~a28~0 8)) .cse0))) [2019-11-23 23:33:14,009 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:33:14,009 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:33:14,009 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:33:14,009 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:14,010 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-23 23:33:14,011 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:33:14,011 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:33:14,012 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 8))) (or (and .cse0 (not (= ~a11~0 1))) (and (not (= ~a28~0 8)) .cse0))) [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:33:14,013 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:33:14,014 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:33:14,015 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:33:14,016 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:33:14,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:14 BoogieIcfgContainer [2019-11-23 23:33:14,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:33:14,047 INFO L168 Benchmark]: Toolchain (without parser) took 8288.59 ms. Allocated memory was 136.8 MB in the beginning and 346.6 MB in the end (delta: 209.7 MB). Free memory was 100.3 MB in the beginning and 157.7 MB in the end (delta: -57.4 MB). Peak memory consumption was 152.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,049 INFO L168 Benchmark]: CDTParser took 1.98 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.06 ms. Allocated memory was 136.8 MB in the beginning and 202.9 MB in the end (delta: 66.1 MB). Free memory was 100.1 MB in the beginning and 169.7 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.52 ms. Allocated memory is still 202.9 MB. Free memory was 169.7 MB in the beginning and 163.8 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,056 INFO L168 Benchmark]: Boogie Preprocessor took 60.91 ms. Allocated memory is still 202.9 MB. Free memory was 163.8 MB in the beginning and 159.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,057 INFO L168 Benchmark]: RCFGBuilder took 2223.62 ms. Allocated memory was 202.9 MB in the beginning and 254.3 MB in the end (delta: 51.4 MB). Free memory was 159.4 MB in the beginning and 200.9 MB in the end (delta: -41.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,061 INFO L168 Benchmark]: TraceAbstraction took 5071.96 ms. Allocated memory was 254.3 MB in the beginning and 346.6 MB in the end (delta: 92.3 MB). Free memory was 200.9 MB in the beginning and 157.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:14,069 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.98 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.06 ms. Allocated memory was 136.8 MB in the beginning and 202.9 MB in the end (delta: 66.1 MB). Free memory was 100.1 MB in the beginning and 169.7 MB in the end (delta: -69.6 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.52 ms. Allocated memory is still 202.9 MB. Free memory was 169.7 MB in the beginning and 163.8 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.91 ms. Allocated memory is still 202.9 MB. Free memory was 163.8 MB in the beginning and 159.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2223.62 ms. Allocated memory was 202.9 MB in the beginning and 254.3 MB in the end (delta: 51.4 MB). Free memory was 159.4 MB in the beginning and 200.9 MB in the end (delta: -41.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5071.96 ms. Allocated memory was 254.3 MB in the beginning and 346.6 MB in the end (delta: 92.3 MB). Free memory was 200.9 MB in the beginning and 157.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 472]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (a17 <= 8 && !(a11 == 1)) || (!(a28 == 8) && a17 <= 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (a17 <= 8 && !(a11 == 1)) || (!(a28 == 8) && a17 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 400 SDtfs, 649 SDslu, 34 SDs, 0 SdLazy, 1717 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 640 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 35 HoareAnnotationTreeSize, 3 FomulaSimplifications, 532 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 870 NumberOfCodeBlocks, 870 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1019 ConstructedInterpolants, 0 QuantifiedInterpolants, 251728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 519/527 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...