/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_label40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:01,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:01,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:01,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:01,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:01,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:01,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:01,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:01,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:01,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:01,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:01,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:01,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:01,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:01,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:01,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:01,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:01,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:01,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:01,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:01,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:01,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:01,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:01,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:01,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:01,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:01,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:01,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:01,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:01,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:01,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:01,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:01,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:01,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:01,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:01,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:01,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:01,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:01,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:01,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:01,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:01,399 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:01,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:01,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:01,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:01,418 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:01,418 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:01,418 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:01,418 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:01,418 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:01,419 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:01,419 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:01,419 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:01,419 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:01,419 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:01,420 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:01,420 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:01,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:01,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:01,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:01,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:01,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:01,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:01,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:01,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:01,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:01,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:01,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:01,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:01,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:01,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:01,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:01,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:01,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:01,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:01,424 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:01,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:01,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:01,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:01,425 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:01,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:01,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:01,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:01,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:01,734 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:01,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label40.c [2019-11-23 23:33:01,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc241bb30/c5ef64a73ee8409c9a25b6cc91d3c88b/FLAGb61fed734 [2019-11-23 23:33:02,375 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:02,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label40.c [2019-11-23 23:33:02,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc241bb30/c5ef64a73ee8409c9a25b6cc91d3c88b/FLAGb61fed734 [2019-11-23 23:33:02,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc241bb30/c5ef64a73ee8409c9a25b6cc91d3c88b [2019-11-23 23:33:02,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:02,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:02,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:02,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:02,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:02,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:02" (1/1) ... [2019-11-23 23:33:02,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:02, skipping insertion in model container [2019-11-23 23:33:02,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:02" (1/1) ... [2019-11-23 23:33:02,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:02,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:03,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:03,265 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:03,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:03,420 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:03,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:03 WrapperNode [2019-11-23 23:33:03,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:03,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:03,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:03,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:03,431 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:03" (1/1) ... [2019-11-23 23:33:03,454 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:03" (1/1) ... [2019-11-23 23:33:03,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:03,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:03,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:03,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:03,520 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:03" (1/1) ... [2019-11-23 23:33:03,520 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:03" (1/1) ... [2019-11-23 23:33:03,524 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:03" (1/1) ... [2019-11-23 23:33:03,525 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:03" (1/1) ... [2019-11-23 23:33:03,545 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:03" (1/1) ... [2019-11-23 23:33:03,557 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:03" (1/1) ... [2019-11-23 23:33:03,564 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:03" (1/1) ... [2019-11-23 23:33:03,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:03,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:03,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:03,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:03,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:03" (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:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:05,815 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:05,815 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:05,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:05 BoogieIcfgContainer [2019-11-23 23:33:05,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:05,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:05,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:05,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:05,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:02" (1/3) ... [2019-11-23 23:33:05,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:05, skipping insertion in model container [2019-11-23 23:33:05,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:03" (2/3) ... [2019-11-23 23:33:05,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:05, skipping insertion in model container [2019-11-23 23:33:05,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:05" (3/3) ... [2019-11-23 23:33:05,827 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label40.c [2019-11-23 23:33:05,837 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:05,846 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:05,858 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:05,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:05,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:05,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:05,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:05,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:05,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:05,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:05,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:33:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:33:05,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:05,915 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:05,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 925944713, now seen corresponding path program 1 times [2019-11-23 23:33:05,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:05,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:33:05,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:06,301 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:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:33:06,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:06,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:06,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211593242] [2019-11-23 23:33:06,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:06,327 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:33:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:07,197 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:33:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:07,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:33:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:07,214 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:33:07,215 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:33:07,219 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:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:33:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-11-23 23:33:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:33:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-11-23 23:33:07,299 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-11-23 23:33:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:07,300 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-11-23 23:33:07,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-11-23 23:33:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:33:07,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:07,307 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:33:07,307 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1028665470, now seen corresponding path program 1 times [2019-11-23 23:33:07,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:07,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:33:07,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:07,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:33:07,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:07,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:07,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599309974] [2019-11-23 23:33:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:07,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:07,488 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 4 states. [2019-11-23 23:33:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:08,207 INFO L93 Difference]: Finished difference Result 645 states and 1187 transitions. [2019-11-23 23:33:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:08,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-23 23:33:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:08,211 INFO L225 Difference]: With dead ends: 645 [2019-11-23 23:33:08,211 INFO L226 Difference]: Without dead ends: 483 [2019-11-23 23:33:08,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-23 23:33:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-23 23:33:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:33:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 788 transitions. [2019-11-23 23:33:08,238 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 788 transitions. Word has length 84 [2019-11-23 23:33:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:08,239 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 788 transitions. [2019-11-23 23:33:08,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 788 transitions. [2019-11-23 23:33:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:33:08,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:08,244 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,244 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -792079304, now seen corresponding path program 1 times [2019-11-23 23:33:08,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:08,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929511885] [2019-11-23 23:33:08,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:33:08,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929511885] [2019-11-23 23:33:08,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:08,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:08,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452116844] [2019-11-23 23:33:08,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:08,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:08,290 INFO L87 Difference]: Start difference. First operand 483 states and 788 transitions. Second operand 3 states. [2019-11-23 23:33:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:08,756 INFO L93 Difference]: Finished difference Result 1365 states and 2221 transitions. [2019-11-23 23:33:08,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:08,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-23 23:33:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:08,763 INFO L225 Difference]: With dead ends: 1365 [2019-11-23 23:33:08,763 INFO L226 Difference]: Without dead ends: 883 [2019-11-23 23:33:08,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-11-23 23:33:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 563. [2019-11-23 23:33:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-23 23:33:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 929 transitions. [2019-11-23 23:33:08,796 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 929 transitions. Word has length 90 [2019-11-23 23:33:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:08,796 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 929 transitions. [2019-11-23 23:33:08,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 929 transitions. [2019-11-23 23:33:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:33:08,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:08,799 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:33:08,799 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -833115123, now seen corresponding path program 1 times [2019-11-23 23:33:08,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:08,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86253640] [2019-11-23 23:33:08,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:08,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86253640] [2019-11-23 23:33:08,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:08,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:08,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783721995] [2019-11-23 23:33:08,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:08,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:08,866 INFO L87 Difference]: Start difference. First operand 563 states and 929 transitions. Second operand 3 states. [2019-11-23 23:33:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:09,319 INFO L93 Difference]: Finished difference Result 1445 states and 2382 transitions. [2019-11-23 23:33:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:09,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-23 23:33:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:09,325 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:33:09,325 INFO L226 Difference]: Without dead ends: 883 [2019-11-23 23:33:09,326 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:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-11-23 23:33:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-11-23 23:33:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:33:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1344 transitions. [2019-11-23 23:33:09,354 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1344 transitions. Word has length 90 [2019-11-23 23:33:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:09,355 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1344 transitions. [2019-11-23 23:33:09,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1344 transitions. [2019-11-23 23:33:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 23:33:09,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:09,358 INFO L410 BasicCegarLoop]: trace histogram [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, 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,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1750158434, now seen corresponding path program 1 times [2019-11-23 23:33:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:09,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823757298] [2019-11-23 23:33:09,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:33:09,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823757298] [2019-11-23 23:33:09,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:09,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311660030] [2019-11-23 23:33:09,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:09,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:09,412 INFO L87 Difference]: Start difference. First operand 883 states and 1344 transitions. Second operand 4 states. [2019-11-23 23:33:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:10,061 INFO L93 Difference]: Finished difference Result 2807 states and 4225 transitions. [2019-11-23 23:33:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:10,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-23 23:33:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:10,095 INFO L225 Difference]: With dead ends: 2807 [2019-11-23 23:33:10,095 INFO L226 Difference]: Without dead ends: 1925 [2019-11-23 23:33:10,097 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:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-11-23 23:33:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1283. [2019-11-23 23:33:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:33:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1895 transitions. [2019-11-23 23:33:10,135 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1895 transitions. Word has length 104 [2019-11-23 23:33:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:10,135 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1895 transitions. [2019-11-23 23:33:10,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1895 transitions. [2019-11-23 23:33:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 23:33:10,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:10,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,139 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 651322295, now seen corresponding path program 1 times [2019-11-23 23:33:10,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:10,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591375934] [2019-11-23 23:33:10,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:10,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591375934] [2019-11-23 23:33:10,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:10,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:10,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283477398] [2019-11-23 23:33:10,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:10,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:10,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:10,233 INFO L87 Difference]: Start difference. First operand 1283 states and 1895 transitions. Second operand 4 states. [2019-11-23 23:33:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:10,881 INFO L93 Difference]: Finished difference Result 2885 states and 4234 transitions. [2019-11-23 23:33:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:10,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-23 23:33:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:10,893 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:33:10,893 INFO L226 Difference]: Without dead ends: 1603 [2019-11-23 23:33:10,895 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:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-23 23:33:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1363. [2019-11-23 23:33:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:33:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1774 transitions. [2019-11-23 23:33:10,931 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1774 transitions. Word has length 104 [2019-11-23 23:33:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:10,931 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1774 transitions. [2019-11-23 23:33:10,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1774 transitions. [2019-11-23 23:33:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:33:10,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:10,936 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 23:33:10,936 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash -131004539, now seen corresponding path program 1 times [2019-11-23 23:33:10,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:10,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095501028] [2019-11-23 23:33:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:33:11,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095501028] [2019-11-23 23:33:11,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:11,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:11,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567146255] [2019-11-23 23:33:11,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:11,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:11,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:11,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:11,050 INFO L87 Difference]: Start difference. First operand 1363 states and 1774 transitions. Second operand 4 states. [2019-11-23 23:33:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:11,693 INFO L93 Difference]: Finished difference Result 3285 states and 4299 transitions. [2019-11-23 23:33:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:11,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-23 23:33:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:11,704 INFO L225 Difference]: With dead ends: 3285 [2019-11-23 23:33:11,704 INFO L226 Difference]: Without dead ends: 1923 [2019-11-23 23:33:11,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-11-23 23:33:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1203. [2019-11-23 23:33:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:33:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1494 transitions. [2019-11-23 23:33:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1494 transitions. Word has length 113 [2019-11-23 23:33:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:11,738 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1494 transitions. [2019-11-23 23:33:11,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1494 transitions. [2019-11-23 23:33:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 23:33:11,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:11,742 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1177507239, now seen corresponding path program 1 times [2019-11-23 23:33:11,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:11,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919223363] [2019-11-23 23:33:11,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:11,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919223363] [2019-11-23 23:33:11,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:11,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:11,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221046489] [2019-11-23 23:33:11,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:11,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:11,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:11,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:11,799 INFO L87 Difference]: Start difference. First operand 1203 states and 1494 transitions. Second operand 3 states. [2019-11-23 23:33:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:12,129 INFO L93 Difference]: Finished difference Result 2723 states and 3336 transitions. [2019-11-23 23:33:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:12,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 23:33:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:12,130 INFO L225 Difference]: With dead ends: 2723 [2019-11-23 23:33:12,130 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:33:12,133 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,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:33:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:33:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:33:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:33:12,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-11-23 23:33:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:12,135 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:33:12,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:33:12,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:33:12,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:33:12,573 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-23 23:33:12,826 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:12,830 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:33:12,831 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:33:12,833 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:12,833 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:33:12,833 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:33:12,834 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:33:12,835 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:33:12,836 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:33:12,837 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-11-23 23:33:12,838 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:33:12,839 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:33:12,839 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:33:12,839 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:33:12,839 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a28~0 7))) (let ((.cse9 (= ~a17~0 8)) (.cse1 (not .cse8)) (.cse10 (not (= ~a11~0 1))) (.cse3 (= ~a19~0 1))) (let ((.cse4 (<= ~a19~0 0)) (.cse0 (not .cse3)) (.cse2 (= ~a25~0 1)) (.cse5 (or (and .cse1 .cse9) (and .cse1 .cse10))) (.cse6 (<= ~a25~0 0)) (.cse7 (not (= ~a28~0 11)))) (or (and (= ~a28~0 9) .cse0) (and .cse1 (not .cse2) .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse1 .cse6 .cse7) (and .cse3 .cse8 .cse2) (and .cse0 .cse9 .cse8) (and .cse5 .cse2 .cse7) (and .cse5 .cse3) (and .cse5 .cse6 .cse7) (and .cse9 .cse8 .cse10))))) [2019-11-23 23:33:12,839 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:33:12,840 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:33:12,841 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:33:12,841 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a28~0 7))) (let ((.cse9 (= ~a17~0 8)) (.cse1 (not .cse8)) (.cse10 (not (= ~a11~0 1))) (.cse3 (= ~a19~0 1))) (let ((.cse4 (<= ~a19~0 0)) (.cse0 (not .cse3)) (.cse2 (= ~a25~0 1)) (.cse5 (or (and .cse1 .cse9) (and .cse1 .cse10))) (.cse6 (<= ~a25~0 0)) (.cse7 (not (= ~a28~0 11)))) (or (and (= ~a28~0 9) .cse0) (and .cse1 (not .cse2) .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse1 .cse6 .cse7) (and .cse3 .cse8 .cse2) (and .cse0 .cse9 .cse8) (and .cse5 .cse2 .cse7) (and .cse5 .cse3) (and .cse5 .cse6 .cse7) (and .cse9 .cse8 .cse10))))) [2019-11-23 23:33:12,841 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:33:12,841 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:33:12,841 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:33:12,841 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:33:12,842 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:33:12,843 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:33:12,844 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:33:12,845 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:33:12,845 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:33:12,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:12 BoogieIcfgContainer [2019-11-23 23:33:12,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:33:12,879 INFO L168 Benchmark]: Toolchain (without parser) took 10197.20 ms. Allocated memory was 138.9 MB in the beginning and 377.5 MB in the end (delta: 238.6 MB). Free memory was 102.2 MB in the beginning and 275.7 MB in the end (delta: -173.5 MB). Peak memory consumption was 213.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,883 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.41 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 166.0 MB in the end (delta: -64.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.79 ms. Allocated memory is still 203.4 MB. Free memory was 166.0 MB in the beginning and 159.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,885 INFO L168 Benchmark]: Boogie Preprocessor took 61.82 ms. Allocated memory is still 203.4 MB. Free memory was 159.8 MB in the beginning and 155.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,886 INFO L168 Benchmark]: RCFGBuilder took 2244.80 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 155.7 MB in the beginning and 185.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,889 INFO L168 Benchmark]: TraceAbstraction took 7055.36 ms. Allocated memory was 248.5 MB in the beginning and 377.5 MB in the end (delta: 129.0 MB). Free memory was 185.7 MB in the beginning and 275.7 MB in the end (delta: -90.0 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:12,900 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.30 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.41 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 166.0 MB in the end (delta: -64.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.79 ms. Allocated memory is still 203.4 MB. Free memory was 166.0 MB in the beginning and 159.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.82 ms. Allocated memory is still 203.4 MB. Free memory was 159.8 MB in the beginning and 155.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2244.80 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 155.7 MB in the beginning and 185.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7055.36 ms. Allocated memory was 248.5 MB in the beginning and 377.5 MB in the end (delta: 129.0 MB). Free memory was 185.7 MB in the beginning and 275.7 MB in the end (delta: -90.0 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: (((((((((a28 == 9 && !(a19 == 1)) || ((!(a28 == 7) && !(a25 == 1)) && a19 == 1)) || ((a19 <= 0 && ((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1)))) && a25 <= 0)) || (((a19 <= 0 && !(a28 == 7)) && a25 <= 0) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a25 == 1)) || ((!(a19 == 1) && a17 == 8) && a28 == 7)) || ((((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a25 == 1) && !(a28 == 11))) || (((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a19 == 1)) || ((((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a25 <= 0) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && !(a11 == 1)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a28 == 9 && !(a19 == 1)) || ((!(a28 == 7) && !(a25 == 1)) && a19 == 1)) || ((a19 <= 0 && ((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1)))) && a25 <= 0)) || (((a19 <= 0 && !(a28 == 7)) && a25 <= 0) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a25 == 1)) || ((!(a19 == 1) && a17 == 8) && a28 == 7)) || ((((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a25 == 1) && !(a28 == 11))) || (((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a19 == 1)) || ((((!(a28 == 7) && a17 == 8) || (!(a28 == 7) && !(a11 == 1))) && a25 <= 0) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.9s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 596 SDtfs, 1029 SDslu, 103 SDs, 0 SdLazy, 2985 SolverSat, 750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1363occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 335 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2712 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 582 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 136438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 173/173 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...