/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/Problem03_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:59,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:59,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:59,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:59,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:59,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:59,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:59,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:59,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:59,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:59,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:59,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:59,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:59,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:59,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:59,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:59,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:59,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:59,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:59,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:59,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:59,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:59,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:59,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:59,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:59,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:59,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:59,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:59,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:59,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:59,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:59,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:59,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:59,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:59,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:59,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:59,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:59,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:59,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:59,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:59,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:59,970 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:35:59,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:59,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:59,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:59,987 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:59,987 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:59,987 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:59,988 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:59,988 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:59,988 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:59,988 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:59,988 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:59,989 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:59,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:59,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:59,989 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:59,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:59,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:59,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:59,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:59,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:59,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:59,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:59,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:59,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:59,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:59,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:59,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:59,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:59,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:59,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:59,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:59,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:59,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:59,994 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:59,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:59,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:59,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:59,994 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:36:00,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:36:00,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:36:00,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:36:00,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:36:00,300 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:36:00,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label48.c [2019-11-23 23:36:00,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fc31dea/bbc0afcbbffc4203bcd537afca81c6df/FLAG0c265b272 [2019-11-23 23:36:01,031 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:36:01,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label48.c [2019-11-23 23:36:01,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fc31dea/bbc0afcbbffc4203bcd537afca81c6df/FLAG0c265b272 [2019-11-23 23:36:01,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fc31dea/bbc0afcbbffc4203bcd537afca81c6df [2019-11-23 23:36:01,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:36:01,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:36:01,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:01,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:36:01,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:36:01,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:01" (1/1) ... [2019-11-23 23:36:01,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bc442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:01, skipping insertion in model container [2019-11-23 23:36:01,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:01" (1/1) ... [2019-11-23 23:36:01,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:36:01,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:36:02,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:02,158 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:36:02,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:02,526 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:36:02,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02 WrapperNode [2019-11-23 23:36:02,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:02,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:02,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:36:02,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:36:02,537 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:36:02" (1/1) ... [2019-11-23 23:36:02,582 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:36:02" (1/1) ... [2019-11-23 23:36:02,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:02,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:36:02,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:36:02,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:36:02,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (1/1) ... [2019-11-23 23:36:02,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:36:02,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:36:02,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:36:02,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:36:02,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (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:36:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:36:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:36:05,912 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:36:05,913 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:36:05,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:05 BoogieIcfgContainer [2019-11-23 23:36:05,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:36:05,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:36:05,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:36:05,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:36:05,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:01" (1/3) ... [2019-11-23 23:36:05,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c794c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:05, skipping insertion in model container [2019-11-23 23:36:05,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:02" (2/3) ... [2019-11-23 23:36:05,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c794c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:05, skipping insertion in model container [2019-11-23 23:36:05,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:05" (3/3) ... [2019-11-23 23:36:05,922 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2019-11-23 23:36:05,933 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:36:05,942 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:36:05,955 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:36:05,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:36:05,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:36:05,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:36:05,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:36:05,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:36:05,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:36:05,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:36:05,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:36:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:36:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:36:06,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:06,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:06,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1467442911, now seen corresponding path program 1 times [2019-11-23 23:36:06,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:06,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828393866] [2019-11-23 23:36:06,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:06,703 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:36:06,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828393866] [2019-11-23 23:36:06,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:06,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:06,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826187150] [2019-11-23 23:36:06,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:06,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:06,740 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:36:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:08,452 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:36:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:08,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:36:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:08,474 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:36:08,474 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:36:08,478 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:36:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:36:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:36:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:36:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-11-23 23:36:08,554 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-11-23 23:36:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:08,555 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-11-23 23:36:08,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-11-23 23:36:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:36:08,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:08,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,560 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1977869888, now seen corresponding path program 1 times [2019-11-23 23:36:08,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:08,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153846809] [2019-11-23 23:36:08,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:08,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153846809] [2019-11-23 23:36:08,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:08,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:08,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719336429] [2019-11-23 23:36:08,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:08,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:08,645 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-11-23 23:36:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:09,638 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-11-23 23:36:09,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:09,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:36:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:09,643 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:36:09,643 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:36:09,646 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:36:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:36:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:36:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:36:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-23 23:36:09,685 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 151 [2019-11-23 23:36:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:09,685 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-23 23:36:09,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-23 23:36:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:36:09,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:09,690 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:09,691 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash -119305479, now seen corresponding path program 1 times [2019-11-23 23:36:09,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:09,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439577264] [2019-11-23 23:36:09,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:09,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439577264] [2019-11-23 23:36:09,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:09,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:09,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143592366] [2019-11-23 23:36:09,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:09,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:09,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:09,771 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-11-23 23:36:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:11,244 INFO L93 Difference]: Finished difference Result 2293 states and 4055 transitions. [2019-11-23 23:36:11,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:11,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 23:36:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:11,256 INFO L225 Difference]: With dead ends: 2293 [2019-11-23 23:36:11,257 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:36:11,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:36:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1147. [2019-11-23 23:36:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:36:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1880 transitions. [2019-11-23 23:36:11,363 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1880 transitions. Word has length 152 [2019-11-23 23:36:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:11,363 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1880 transitions. [2019-11-23 23:36:11,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1880 transitions. [2019-11-23 23:36:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:36:11,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:11,381 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:11,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 351587581, now seen corresponding path program 1 times [2019-11-23 23:36:11,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:11,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264830056] [2019-11-23 23:36:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:11,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264830056] [2019-11-23 23:36:11,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:11,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:11,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782084495] [2019-11-23 23:36:11,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:11,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:11,763 INFO L87 Difference]: Start difference. First operand 1147 states and 1880 transitions. Second operand 4 states. [2019-11-23 23:36:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:13,385 INFO L93 Difference]: Finished difference Result 4581 states and 7515 transitions. [2019-11-23 23:36:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:13,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 23:36:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:13,404 INFO L225 Difference]: With dead ends: 4581 [2019-11-23 23:36:13,404 INFO L226 Difference]: Without dead ends: 3435 [2019-11-23 23:36:13,407 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:36:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-23 23:36:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-23 23:36:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:36:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5021 transitions. [2019-11-23 23:36:13,492 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5021 transitions. Word has length 158 [2019-11-23 23:36:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:13,492 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5021 transitions. [2019-11-23 23:36:13,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5021 transitions. [2019-11-23 23:36:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 23:36:13,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:13,501 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1925389054, now seen corresponding path program 1 times [2019-11-23 23:36:13,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:13,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149528021] [2019-11-23 23:36:13,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149528021] [2019-11-23 23:36:13,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:13,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:13,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829795450] [2019-11-23 23:36:13,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:13,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:13,627 INFO L87 Difference]: Start difference. First operand 3435 states and 5021 transitions. Second operand 3 states. [2019-11-23 23:36:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:14,587 INFO L93 Difference]: Finished difference Result 8013 states and 11565 transitions. [2019-11-23 23:36:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:14,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-23 23:36:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:14,612 INFO L225 Difference]: With dead ends: 8013 [2019-11-23 23:36:14,613 INFO L226 Difference]: Without dead ends: 4579 [2019-11-23 23:36:14,619 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:36:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-11-23 23:36:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-11-23 23:36:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-23 23:36:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6383 transitions. [2019-11-23 23:36:14,715 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6383 transitions. Word has length 184 [2019-11-23 23:36:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:14,716 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 6383 transitions. [2019-11-23 23:36:14,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6383 transitions. [2019-11-23 23:36:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 23:36:14,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:14,729 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,729 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2078782107, now seen corresponding path program 1 times [2019-11-23 23:36:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:14,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535708156] [2019-11-23 23:36:14,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:14,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535708156] [2019-11-23 23:36:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399418284] [2019-11-23 23:36:14,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:15,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:15,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:15,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:15,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:15,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:15,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995737778] [2019-11-23 23:36:15,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:15,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:15,369 INFO L87 Difference]: Start difference. First operand 4579 states and 6383 transitions. Second operand 3 states. [2019-11-23 23:36:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:16,295 INFO L93 Difference]: Finished difference Result 13161 states and 18340 transitions. [2019-11-23 23:36:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:16,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-11-23 23:36:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:16,339 INFO L225 Difference]: With dead ends: 13161 [2019-11-23 23:36:16,339 INFO L226 Difference]: Without dead ends: 8583 [2019-11-23 23:36:16,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8583 states. [2019-11-23 23:36:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8583 to 8583. [2019-11-23 23:36:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8583 states. [2019-11-23 23:36:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8583 states to 8583 states and 11332 transitions. [2019-11-23 23:36:16,517 INFO L78 Accepts]: Start accepts. Automaton has 8583 states and 11332 transitions. Word has length 191 [2019-11-23 23:36:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:16,517 INFO L462 AbstractCegarLoop]: Abstraction has 8583 states and 11332 transitions. [2019-11-23 23:36:16,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8583 states and 11332 transitions. [2019-11-23 23:36:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 23:36:16,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:16,538 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:16,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:16,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2057971204, now seen corresponding path program 1 times [2019-11-23 23:36:16,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:16,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342618083] [2019-11-23 23:36:16,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:16,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342618083] [2019-11-23 23:36:16,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:16,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:16,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657951855] [2019-11-23 23:36:16,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:16,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:16,988 INFO L87 Difference]: Start difference. First operand 8583 states and 11332 transitions. Second operand 4 states. [2019-11-23 23:36:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:18,402 INFO L93 Difference]: Finished difference Result 20168 states and 26281 transitions. [2019-11-23 23:36:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:18,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-23 23:36:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:18,451 INFO L225 Difference]: With dead ends: 20168 [2019-11-23 23:36:18,451 INFO L226 Difference]: Without dead ends: 11586 [2019-11-23 23:36:18,464 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:36:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2019-11-23 23:36:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 9441. [2019-11-23 23:36:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-11-23 23:36:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 12151 transitions. [2019-11-23 23:36:18,630 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 12151 transitions. Word has length 206 [2019-11-23 23:36:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:18,631 INFO L462 AbstractCegarLoop]: Abstraction has 9441 states and 12151 transitions. [2019-11-23 23:36:18,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 12151 transitions. [2019-11-23 23:36:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 23:36:18,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:18,651 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:18,651 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 139293804, now seen corresponding path program 1 times [2019-11-23 23:36:18,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:18,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321526499] [2019-11-23 23:36:18,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:36:18,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321526499] [2019-11-23 23:36:18,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:18,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:18,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814782425] [2019-11-23 23:36:18,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:18,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:18,858 INFO L87 Difference]: Start difference. First operand 9441 states and 12151 transitions. Second operand 4 states. [2019-11-23 23:36:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:20,142 INFO L93 Difference]: Finished difference Result 26891 states and 35089 transitions. [2019-11-23 23:36:20,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:20,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-23 23:36:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:20,180 INFO L225 Difference]: With dead ends: 26891 [2019-11-23 23:36:20,180 INFO L226 Difference]: Without dead ends: 17451 [2019-11-23 23:36:20,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17451 states. [2019-11-23 23:36:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17451 to 13159. [2019-11-23 23:36:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-11-23 23:36:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 16570 transitions. [2019-11-23 23:36:20,401 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 16570 transitions. Word has length 208 [2019-11-23 23:36:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:20,401 INFO L462 AbstractCegarLoop]: Abstraction has 13159 states and 16570 transitions. [2019-11-23 23:36:20,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 16570 transitions. [2019-11-23 23:36:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:36:20,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:20,424 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:20,424 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash -491400665, now seen corresponding path program 1 times [2019-11-23 23:36:20,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:20,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942920387] [2019-11-23 23:36:20,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:20,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942920387] [2019-11-23 23:36:20,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174872836] [2019-11-23 23:36:20,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:20,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:20,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:21,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:21,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:21,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:21,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356368468] [2019-11-23 23:36:21,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:21,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:21,051 INFO L87 Difference]: Start difference. First operand 13159 states and 16570 transitions. Second operand 3 states. [2019-11-23 23:36:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:21,970 INFO L93 Difference]: Finished difference Result 32180 states and 40374 transitions. [2019-11-23 23:36:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:21,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:36:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:22,002 INFO L225 Difference]: With dead ends: 32180 [2019-11-23 23:36:22,003 INFO L226 Difference]: Without dead ends: 19022 [2019-11-23 23:36:22,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-11-23 23:36:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 19022. [2019-11-23 23:36:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19022 states. [2019-11-23 23:36:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19022 states to 19022 states and 23551 transitions. [2019-11-23 23:36:22,402 INFO L78 Accepts]: Start accepts. Automaton has 19022 states and 23551 transitions. Word has length 213 [2019-11-23 23:36:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:22,403 INFO L462 AbstractCegarLoop]: Abstraction has 19022 states and 23551 transitions. [2019-11-23 23:36:22,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 19022 states and 23551 transitions. [2019-11-23 23:36:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:36:22,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:22,433 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:22,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:22,641 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash -82787674, now seen corresponding path program 1 times [2019-11-23 23:36:22,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:22,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433785370] [2019-11-23 23:36:22,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 23:36:22,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433785370] [2019-11-23 23:36:22,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000096432] [2019-11-23 23:36:22,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:23,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:23,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:23,139 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:23,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:23,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:23,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665793229] [2019-11-23 23:36:23,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:23,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:23,206 INFO L87 Difference]: Start difference. First operand 19022 states and 23551 transitions. Second operand 3 states. [2019-11-23 23:36:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:24,190 INFO L93 Difference]: Finished difference Result 40188 states and 49715 transitions. [2019-11-23 23:36:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:24,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-23 23:36:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:24,226 INFO L225 Difference]: With dead ends: 40188 [2019-11-23 23:36:24,226 INFO L226 Difference]: Without dead ends: 21167 [2019-11-23 23:36:24,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2019-11-23 23:36:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 20309. [2019-11-23 23:36:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20309 states. [2019-11-23 23:36:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 24553 transitions. [2019-11-23 23:36:24,696 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 24553 transitions. Word has length 221 [2019-11-23 23:36:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:24,697 INFO L462 AbstractCegarLoop]: Abstraction has 20309 states and 24553 transitions. [2019-11-23 23:36:24,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 24553 transitions. [2019-11-23 23:36:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-23 23:36:24,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:24,728 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:24,940 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2012265684, now seen corresponding path program 1 times [2019-11-23 23:36:24,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:24,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106560978] [2019-11-23 23:36:24,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 23:36:25,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106560978] [2019-11-23 23:36:25,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:25,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:25,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698942963] [2019-11-23 23:36:25,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:25,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:25,064 INFO L87 Difference]: Start difference. First operand 20309 states and 24553 transitions. Second operand 3 states. [2019-11-23 23:36:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:25,638 INFO L93 Difference]: Finished difference Result 35755 states and 42843 transitions. [2019-11-23 23:36:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:25,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-11-23 23:36:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:25,664 INFO L225 Difference]: With dead ends: 35755 [2019-11-23 23:36:25,665 INFO L226 Difference]: Without dead ends: 15447 [2019-11-23 23:36:25,679 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:36:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-11-23 23:36:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 14017. [2019-11-23 23:36:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14017 states. [2019-11-23 23:36:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 16493 transitions. [2019-11-23 23:36:25,869 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 16493 transitions. Word has length 234 [2019-11-23 23:36:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:25,870 INFO L462 AbstractCegarLoop]: Abstraction has 14017 states and 16493 transitions. [2019-11-23 23:36:25,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 16493 transitions. [2019-11-23 23:36:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 23:36:25,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:25,887 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:36:25,887 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash -565710051, now seen corresponding path program 1 times [2019-11-23 23:36:25,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:25,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886918197] [2019-11-23 23:36:25,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:36:26,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886918197] [2019-11-23 23:36:26,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:26,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:26,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125631147] [2019-11-23 23:36:26,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:26,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:26,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:26,384 INFO L87 Difference]: Start difference. First operand 14017 states and 16493 transitions. Second operand 5 states. [2019-11-23 23:36:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:27,436 INFO L93 Difference]: Finished difference Result 40476 states and 47407 transitions. [2019-11-23 23:36:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:27,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-11-23 23:36:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:27,465 INFO L225 Difference]: With dead ends: 40476 [2019-11-23 23:36:27,465 INFO L226 Difference]: Without dead ends: 26460 [2019-11-23 23:36:27,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26460 states. [2019-11-23 23:36:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26460 to 26458. [2019-11-23 23:36:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26458 states. [2019-11-23 23:36:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26458 states to 26458 states and 30892 transitions. [2019-11-23 23:36:27,802 INFO L78 Accepts]: Start accepts. Automaton has 26458 states and 30892 transitions. Word has length 292 [2019-11-23 23:36:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:27,803 INFO L462 AbstractCegarLoop]: Abstraction has 26458 states and 30892 transitions. [2019-11-23 23:36:27,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26458 states and 30892 transitions. [2019-11-23 23:36:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-11-23 23:36:27,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:27,830 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:27,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash 38909209, now seen corresponding path program 1 times [2019-11-23 23:36:27,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:27,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31249209] [2019-11-23 23:36:27,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 141 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 23:36:28,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31249209] [2019-11-23 23:36:28,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556491661] [2019-11-23 23:36:28,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:28,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:36:28,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-23 23:36:28,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-23 23:36:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:28,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305396950] [2019-11-23 23:36:28,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:28,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:28,592 INFO L87 Difference]: Start difference. First operand 26458 states and 30892 transitions. Second operand 3 states. [2019-11-23 23:36:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:29,604 INFO L93 Difference]: Finished difference Result 55344 states and 64639 transitions. [2019-11-23 23:36:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:29,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-11-23 23:36:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:29,605 INFO L225 Difference]: With dead ends: 55344 [2019-11-23 23:36:29,605 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:36:29,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:36:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:36:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:36:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:36:29,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2019-11-23 23:36:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:29,626 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:36:29,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:36:29,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:36:29,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:29,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:36:30,959 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 415 DAG size of output: 170 [2019-11-23 23:36:31,655 WARN L192 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 170 [2019-11-23 23:36:32,226 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 31 [2019-11-23 23:36:32,980 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 31 [2019-11-23 23:36:32,983 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,983 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,984 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,984 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,984 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,984 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,985 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,986 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,987 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,988 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,989 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,990 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 23:36:32,991 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,991 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,991 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,992 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (not (= ~a12~0 1))) (.cse4 (= ~a26~0 1)) (.cse5 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse3 (= 1 ~a6~0)) (.cse2 (= ~a11~0 1))) (or (and .cse0 (not (= 1 ~a3~0))) (and .cse0 .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse0 .cse1) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse3 .cse1 (not .cse2) .cse4) (and .cse0 .cse5 .cse4) (and .cse5 .cse0 .cse3 .cse2))) [2019-11-23 23:36:32,992 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,992 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 23:36:32,992 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1584) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,993 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,994 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (not (= ~a12~0 1))) (.cse4 (= ~a26~0 1)) (.cse5 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse3 (= 1 ~a6~0)) (.cse2 (= ~a11~0 1))) (or (and .cse0 (not (= 1 ~a3~0))) (and .cse0 .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse0 .cse1) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse3 .cse1 (not .cse2) .cse4) (and .cse0 .cse5 .cse4) (and .cse5 .cse0 .cse3 .cse2))) [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,995 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,996 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,997 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,998 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 23:36:32,999 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,000 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,001 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,001 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,001 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,001 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,001 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 23:36:33,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:36:33 BoogieIcfgContainer [2019-11-23 23:36:33,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:36:33,046 INFO L168 Benchmark]: Toolchain (without parser) took 31809.46 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 883.9 MB). Free memory was 97.8 MB in the beginning and 381.1 MB in the end (delta: -283.2 MB). Peak memory consumption was 784.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,047 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 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:36:33,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1294.22 ms. Allocated memory was 138.4 MB in the beginning and 207.6 MB in the end (delta: 69.2 MB). Free memory was 97.4 MB in the beginning and 130.1 MB in the end (delta: -32.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.36 ms. Allocated memory is still 207.6 MB. Free memory was 130.1 MB in the beginning and 115.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,049 INFO L168 Benchmark]: Boogie Preprocessor took 143.56 ms. Allocated memory is still 207.6 MB. Free memory was 115.6 MB in the beginning and 104.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,050 INFO L168 Benchmark]: RCFGBuilder took 3088.19 ms. Allocated memory was 207.6 MB in the beginning and 322.4 MB in the end (delta: 114.8 MB). Free memory was 104.1 MB in the beginning and 244.4 MB in the end (delta: -140.4 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,051 INFO L168 Benchmark]: TraceAbstraction took 27124.29 ms. Allocated memory was 322.4 MB in the beginning and 1.0 GB in the end (delta: 699.9 MB). Free memory was 244.4 MB in the beginning and 381.1 MB in the end (delta: -136.7 MB). Peak memory consumption was 746.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:36:33,056 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.31 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1294.22 ms. Allocated memory was 138.4 MB in the beginning and 207.6 MB in the end (delta: 69.2 MB). Free memory was 97.4 MB in the beginning and 130.1 MB in the end (delta: -32.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 154.36 ms. Allocated memory is still 207.6 MB. Free memory was 130.1 MB in the beginning and 115.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.56 ms. Allocated memory is still 207.6 MB. Free memory was 115.6 MB in the beginning and 104.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3088.19 ms. Allocated memory was 207.6 MB in the beginning and 322.4 MB in the end (delta: 114.8 MB). Free memory was 104.1 MB in the beginning and 244.4 MB in the end (delta: -140.4 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27124.29 ms. Allocated memory was 322.4 MB in the beginning and 1.0 GB in the end (delta: 699.9 MB). Free memory was 244.4 MB in the beginning and 381.1 MB in the end (delta: -136.7 MB). Peak memory consumption was 746.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1584]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((1 == a5 && !(1 == a3)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((a27 == 1 && 1 == a5) && !(a12 == 1))) || (1 == a5 && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((1 == a5 && !(1 == a3)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((a27 == 1 && 1 == a5) && !(a12 == 1))) || (1 == a5 && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 27.0s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 1579 SDtfs, 2600 SDslu, 93 SDs, 0 SdLazy, 7702 SolverSat, 1653 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1936 GetRequests, 1898 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26458occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9442 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 394 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20466 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7394 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3624 NumberOfCodeBlocks, 3624 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4551 ConstructedInterpolants, 0 QuantifiedInterpolants, 2630551 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1906 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 2069/2081 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...