/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_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:27,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:27,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:27,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:27,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:27,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:27,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:27,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:27,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:27,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:27,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:27,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:27,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:27,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:27,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:27,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:27,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:27,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:27,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:27,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:27,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:27,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:27,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:27,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:27,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:27,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:27,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:27,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:27,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:27,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:27,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:27,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:27,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:27,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:27,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:27,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:27,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:27,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:27,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:27,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:27,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:27,878 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:32:27,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:27,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:27,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:27,906 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:27,906 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:27,907 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:27,907 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:27,907 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:27,907 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:27,907 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:27,908 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:27,909 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:27,910 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:27,910 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:27,910 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:27,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:27,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:27,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:27,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:27,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:27,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:27,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:27,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:27,913 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:27,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:27,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:27,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:27,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:27,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:27,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:27,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:27,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:27,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:27,915 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:27,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:27,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:27,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:27,916 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:28,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:28,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:28,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:28,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:28,239 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:28,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23.c [2019-11-23 23:32:28,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884a253c7/ee5a3a6b51894fe3af7ccfb7baad26c9/FLAG456cdc8b4 [2019-11-23 23:32:28,896 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:28,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23.c [2019-11-23 23:32:28,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884a253c7/ee5a3a6b51894fe3af7ccfb7baad26c9/FLAG456cdc8b4 [2019-11-23 23:32:29,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884a253c7/ee5a3a6b51894fe3af7ccfb7baad26c9 [2019-11-23 23:32:29,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:29,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:29,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:29,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:29,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:29,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1745f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29, skipping insertion in model container [2019-11-23 23:32:29,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:29,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:29,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:29,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:29,750 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:29,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:29,929 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:29,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29 WrapperNode [2019-11-23 23:32:29,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:29,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:29,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:29,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:29,939 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:32:29" (1/1) ... [2019-11-23 23:32:29,958 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:32:29" (1/1) ... [2019-11-23 23:32:30,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:30,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:30,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:30,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:30,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2019-11-23 23:32:30,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:30,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:30,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:30,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:30,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (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:32:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:32,308 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:32,308 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:32,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:32 BoogieIcfgContainer [2019-11-23 23:32:32,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:32,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:32,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:32,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:32,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:29" (1/3) ... [2019-11-23 23:32:32,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfcdcb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:32, skipping insertion in model container [2019-11-23 23:32:32,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (2/3) ... [2019-11-23 23:32:32,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfcdcb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:32, skipping insertion in model container [2019-11-23 23:32:32,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:32" (3/3) ... [2019-11-23 23:32:32,320 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label23.c [2019-11-23 23:32:32,329 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:32,338 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:32,350 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:32,379 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:32,379 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:32,380 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:32,380 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:32,380 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:32,380 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:32,381 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:32,381 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:32,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:32,420 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:32:32,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash 925961743, now seen corresponding path program 1 times [2019-11-23 23:32:32,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:32,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484028759] [2019-11-23 23:32:32,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:32,877 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:32:32,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484028759] [2019-11-23 23:32:32,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:32,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:32,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309723288] [2019-11-23 23:32:32,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:32,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:32,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:32,907 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:33,784 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:33,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:33,815 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:33,815 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:33,822 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:32:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2019-11-23 23:32:33,916 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 80 [2019-11-23 23:32:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:33,917 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2019-11-23 23:32:33,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2019-11-23 23:32:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:32:33,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:33,930 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:32:33,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2137932381, now seen corresponding path program 1 times [2019-11-23 23:32:33,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:33,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596107675] [2019-11-23 23:32:33,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:34,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596107675] [2019-11-23 23:32:34,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765747644] [2019-11-23 23:32:34,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:34,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:34,007 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand 3 states. [2019-11-23 23:32:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:34,394 INFO L93 Difference]: Finished difference Result 565 states and 925 transitions. [2019-11-23 23:32:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:34,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 23:32:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:34,399 INFO L225 Difference]: With dead ends: 565 [2019-11-23 23:32:34,399 INFO L226 Difference]: Without dead ends: 323 [2019-11-23 23:32:34,401 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:32:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-23 23:32:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-11-23 23:32:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:32:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2019-11-23 23:32:34,418 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 89 [2019-11-23 23:32:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:34,418 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2019-11-23 23:32:34,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2019-11-23 23:32:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:32:34,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:34,422 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:34,422 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 606395815, now seen corresponding path program 1 times [2019-11-23 23:32:34,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:34,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026814118] [2019-11-23 23:32:34,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:34,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026814118] [2019-11-23 23:32:34,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:34,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583545511] [2019-11-23 23:32:34,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:34,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:34,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:34,498 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand 3 states. [2019-11-23 23:32:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:34,905 INFO L93 Difference]: Finished difference Result 725 states and 1115 transitions. [2019-11-23 23:32:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:34,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:32:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:34,909 INFO L225 Difference]: With dead ends: 725 [2019-11-23 23:32:34,909 INFO L226 Difference]: Without dead ends: 403 [2019-11-23 23:32:34,911 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:32:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-23 23:32:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2019-11-23 23:32:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 578 transitions. [2019-11-23 23:32:34,929 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 578 transitions. Word has length 93 [2019-11-23 23:32:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:34,929 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 578 transitions. [2019-11-23 23:32:34,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 578 transitions. [2019-11-23 23:32:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:32:34,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:34,931 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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:32:34,932 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -275154923, now seen corresponding path program 1 times [2019-11-23 23:32:34,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:34,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114353176] [2019-11-23 23:32:34,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:32:34,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114353176] [2019-11-23 23:32:34,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:34,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502441953] [2019-11-23 23:32:34,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:34,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:34,984 INFO L87 Difference]: Start difference. First operand 403 states and 578 transitions. Second operand 3 states. [2019-11-23 23:32:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:35,397 INFO L93 Difference]: Finished difference Result 1125 states and 1641 transitions. [2019-11-23 23:32:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:35,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 23:32:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:35,402 INFO L225 Difference]: With dead ends: 1125 [2019-11-23 23:32:35,403 INFO L226 Difference]: Without dead ends: 723 [2019-11-23 23:32:35,404 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:32:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-23 23:32:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-23 23:32:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1004 transitions. [2019-11-23 23:32:35,442 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1004 transitions. Word has length 99 [2019-11-23 23:32:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:35,442 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1004 transitions. [2019-11-23 23:32:35,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1004 transitions. [2019-11-23 23:32:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 23:32:35,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:35,447 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,447 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash 40635852, now seen corresponding path program 1 times [2019-11-23 23:32:35,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:35,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869222163] [2019-11-23 23:32:35,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:32:35,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869222163] [2019-11-23 23:32:35,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:35,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:35,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671368526] [2019-11-23 23:32:35,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:35,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:35,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:35,652 INFO L87 Difference]: Start difference. First operand 723 states and 1004 transitions. Second operand 4 states. [2019-11-23 23:32:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,279 INFO L93 Difference]: Finished difference Result 2005 states and 2733 transitions. [2019-11-23 23:32:36,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:36,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-23 23:32:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,287 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:36,287 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:36,289 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:32:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 963. [2019-11-23 23:32:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1308 transitions. [2019-11-23 23:32:36,325 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1308 transitions. Word has length 110 [2019-11-23 23:32:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:36,327 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1308 transitions. [2019-11-23 23:32:36,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1308 transitions. [2019-11-23 23:32:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 23:32:36,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:36,333 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:36,333 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:36,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -709642368, now seen corresponding path program 1 times [2019-11-23 23:32:36,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:36,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340519164] [2019-11-23 23:32:36,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:32:36,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340519164] [2019-11-23 23:32:36,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:36,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:36,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467287267] [2019-11-23 23:32:36,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:36,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:36,451 INFO L87 Difference]: Start difference. First operand 963 states and 1308 transitions. Second operand 4 states. [2019-11-23 23:32:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:37,089 INFO L93 Difference]: Finished difference Result 2245 states and 3040 transitions. [2019-11-23 23:32:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:37,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-23 23:32:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:37,096 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:32:37,097 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:32:37,099 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:32:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:32:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-23 23:32:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1331 transitions. [2019-11-23 23:32:37,123 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1331 transitions. Word has length 168 [2019-11-23 23:32:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,123 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1331 transitions. [2019-11-23 23:32:37,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1331 transitions. [2019-11-23 23:32:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 23:32:37,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:37,127 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:37,128 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1296449596, now seen corresponding path program 1 times [2019-11-23 23:32:37,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:37,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215328688] [2019-11-23 23:32:37,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:32:37,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215328688] [2019-11-23 23:32:37,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:37,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:37,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186749457] [2019-11-23 23:32:37,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:37,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:37,334 INFO L87 Difference]: Start difference. First operand 1123 states and 1331 transitions. Second operand 4 states. [2019-11-23 23:32:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:37,958 INFO L93 Difference]: Finished difference Result 2483 states and 2953 transitions. [2019-11-23 23:32:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:37,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-23 23:32:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:37,959 INFO L225 Difference]: With dead ends: 2483 [2019-11-23 23:32:37,959 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:37,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:32:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:37,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-11-23 23:32:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,964 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:37,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:37,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:38,236 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-23 23:32:38,240 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:38,240 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:38,240 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:38,240 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-23 23:32:38,241 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:38,242 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:38,243 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:38,244 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:38,244 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:38,244 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:38,244 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:38,244 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:38,245 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 571) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:38,246 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:38,247 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:38,247 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse5)) (.cse1 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse0 (= ~a19~0 1))) (or (and .cse0 (= ~a28~0 7)) (and .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 (not (= ~a28~0 9)) .cse4) (and (= ~a28~0 10) .cse2 .cse0) (and .cse1 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5)))) [2019-11-23 23:32:38,248 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:38,248 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:38,248 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:38,248 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:38,248 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:38,249 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:38,249 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:38,249 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:38,249 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:38,249 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:38,250 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (not .cse5)) (.cse1 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse0 (= ~a19~0 1))) (or (and .cse0 (= ~a28~0 7)) (and .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 (not (= ~a28~0 9)) .cse4) (and (= ~a28~0 10) .cse2 .cse0) (and .cse1 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5)))) [2019-11-23 23:32:38,250 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:38,250 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:38,250 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:38,251 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:38,251 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:38,251 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:38,251 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:38,252 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:38,253 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:38,254 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:38,254 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:38,254 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:38,254 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:38,255 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:38,255 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:38,255 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:38,255 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:38,255 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:38,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:38 BoogieIcfgContainer [2019-11-23 23:32:38,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:38,312 INFO L168 Benchmark]: Toolchain (without parser) took 9130.08 ms. Allocated memory was 137.9 MB in the beginning and 338.7 MB in the end (delta: 200.8 MB). Free memory was 99.6 MB in the beginning and 226.6 MB in the end (delta: -127.0 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,314 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.46 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 99.4 MB in the beginning and 171.0 MB in the end (delta: -71.7 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.10 ms. Allocated memory is still 204.5 MB. Free memory was 171.0 MB in the beginning and 165.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,319 INFO L168 Benchmark]: Boogie Preprocessor took 97.02 ms. Allocated memory is still 204.5 MB. Free memory was 165.6 MB in the beginning and 160.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,320 INFO L168 Benchmark]: RCFGBuilder took 2194.98 ms. Allocated memory was 204.5 MB in the beginning and 250.6 MB in the end (delta: 46.1 MB). Free memory was 160.7 MB in the beginning and 193.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,326 INFO L168 Benchmark]: TraceAbstraction took 5994.74 ms. Allocated memory was 250.6 MB in the beginning and 338.7 MB in the end (delta: 88.1 MB). Free memory was 193.0 MB in the beginning and 226.6 MB in the end (delta: -33.5 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:38,337 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.46 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 99.4 MB in the beginning and 171.0 MB in the end (delta: -71.7 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.10 ms. Allocated memory is still 204.5 MB. Free memory was 171.0 MB in the beginning and 165.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.02 ms. Allocated memory is still 204.5 MB. Free memory was 165.6 MB in the beginning and 160.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2194.98 ms. Allocated memory was 204.5 MB in the beginning and 250.6 MB in the end (delta: 46.1 MB). Free memory was 160.7 MB in the beginning and 193.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5994.74 ms. Allocated memory was 250.6 MB in the beginning and 338.7 MB in the end (delta: 88.1 MB). Free memory was 193.0 MB in the beginning and 226.6 MB in the end (delta: -33.5 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 571]: 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: ((((((a19 == 1 && a28 == 7) || (a19 <= 0 && !(a25 == 1))) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || (a19 <= 0 && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((a19 == 1 && a28 == 7) || (a19 <= 0 && !(a25 == 1))) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || (a19 <= 0 && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.8s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 515 SDtfs, 895 SDslu, 51 SDs, 0 SdLazy, 2330 SolverSat, 616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred 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, 7 MinimizatonAttempts, 320 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 137 HoareAnnotationTreeSize, 3 FomulaSimplifications, 468 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 88 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 200724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 328/328 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...