/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/Problem01_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:26,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:26,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:26,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:26,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:26,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:26,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:26,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:26,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:26,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:26,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:26,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:26,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:26,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:26,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:26,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:26,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:26,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:26,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:26,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:26,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:26,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:26,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:26,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:26,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:26,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:26,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:26,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:26,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:26,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:26,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:26,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:26,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:26,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:26,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:26,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:26,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:26,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:26,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:26,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:26,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:26,949 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:30:26,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:26,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:26,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:26,984 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:26,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:26,984 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:26,985 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:26,988 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:26,988 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:26,988 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:26,988 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:26,989 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:26,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:26,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:26,989 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:26,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:26,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:26,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:26,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:26,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:26,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:26,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:26,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:26,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:26,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:26,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:26,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:26,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:26,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:26,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:26,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:26,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:26,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:26,994 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:26,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:26,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:26,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:26,995 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:27,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:27,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:27,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:27,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:27,305 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:27,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label17.c [2019-11-23 23:30:27,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b34f9f1/ddfa36c5d35e46f4b8508ad3e956e997/FLAG1bd8013fb [2019-11-23 23:30:27,945 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:27,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label17.c [2019-11-23 23:30:27,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b34f9f1/ddfa36c5d35e46f4b8508ad3e956e997/FLAG1bd8013fb [2019-11-23 23:30:28,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b34f9f1/ddfa36c5d35e46f4b8508ad3e956e997 [2019-11-23 23:30:28,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:28,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:28,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:28,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:28,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:28,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:28,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38480461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28, skipping insertion in model container [2019-11-23 23:30:28,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:28,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:28,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:28,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:28,744 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:28,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:28,966 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:28,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28 WrapperNode [2019-11-23 23:30:28,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:28,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:28,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:28,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:28,975 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:30:28" (1/1) ... [2019-11-23 23:30:28,993 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:30:28" (1/1) ... [2019-11-23 23:30:29,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:29,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:29,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:29,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:29,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (1/1) ... [2019-11-23 23:30:29,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:29,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:29,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:29,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:29,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (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:30:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:31,119 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:31,119 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:31,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:31 BoogieIcfgContainer [2019-11-23 23:30:31,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:31,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:31,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:31,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:28" (1/3) ... [2019-11-23 23:30:31,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31495177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:31, skipping insertion in model container [2019-11-23 23:30:31,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:28" (2/3) ... [2019-11-23 23:30:31,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31495177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:31, skipping insertion in model container [2019-11-23 23:30:31,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:31" (3/3) ... [2019-11-23 23:30:31,128 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label17.c [2019-11-23 23:30:31,140 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:31,149 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:31,162 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:31,191 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:31,191 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:31,191 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:31,191 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:31,191 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:31,192 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:31,192 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:31,192 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:31,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:31,223 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] [2019-11-23 23:30:31,224 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232665, now seen corresponding path program 1 times [2019-11-23 23:30:31,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:31,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840598271] [2019-11-23 23:30:31,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:31,690 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:30:31,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840598271] [2019-11-23 23:30:31,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:31,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:31,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542878740] [2019-11-23 23:30:31,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:31,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:31,718 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:32,532 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:32,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:32,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:32,549 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:32,549 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:32,553 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:30:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-23 23:30:32,608 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-23 23:30:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-23 23:30:32,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-23 23:30:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:32,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:32,614 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:32,614 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2123289958, now seen corresponding path program 1 times [2019-11-23 23:30:32,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:32,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106178848] [2019-11-23 23:30:32,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106178848] [2019-11-23 23:30:32,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:32,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:32,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650299200] [2019-11-23 23:30:32,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:32,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:32,722 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-23 23:30:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:33,573 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-23 23:30:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:33,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:33,588 INFO L225 Difference]: With dead ends: 786 [2019-11-23 23:30:33,588 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:30:33,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:30:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 429. [2019-11-23 23:30:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 687 transitions. [2019-11-23 23:30:33,655 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 687 transitions. Word has length 78 [2019-11-23 23:30:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:33,657 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 687 transitions. [2019-11-23 23:30:33,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 687 transitions. [2019-11-23 23:30:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:30:33,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:33,670 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:33,671 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash -682705837, now seen corresponding path program 1 times [2019-11-23 23:30:33,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:33,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342991045] [2019-11-23 23:30:33,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:33,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342991045] [2019-11-23 23:30:33,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:33,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:33,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879816653] [2019-11-23 23:30:33,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:33,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:33,722 INFO L87 Difference]: Start difference. First operand 429 states and 687 transitions. Second operand 4 states. [2019-11-23 23:30:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:34,202 INFO L93 Difference]: Finished difference Result 928 states and 1480 transitions. [2019-11-23 23:30:34,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:34,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-23 23:30:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:34,206 INFO L225 Difference]: With dead ends: 928 [2019-11-23 23:30:34,206 INFO L226 Difference]: Without dead ends: 500 [2019-11-23 23:30:34,208 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:30:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-23 23:30:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-11-23 23:30:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:30:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 746 transitions. [2019-11-23 23:30:34,225 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 746 transitions. Word has length 89 [2019-11-23 23:30:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:34,225 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 746 transitions. [2019-11-23 23:30:34,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 746 transitions. [2019-11-23 23:30:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 23:30:34,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:34,229 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:34,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1637083016, now seen corresponding path program 1 times [2019-11-23 23:30:34,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:34,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066625114] [2019-11-23 23:30:34,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:34,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066625114] [2019-11-23 23:30:34,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:34,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:34,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522207873] [2019-11-23 23:30:34,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:34,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:34,298 INFO L87 Difference]: Start difference. First operand 500 states and 746 transitions. Second operand 3 states. [2019-11-23 23:30:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:34,795 INFO L93 Difference]: Finished difference Result 1354 states and 2045 transitions. [2019-11-23 23:30:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:34,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-23 23:30:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:34,800 INFO L225 Difference]: With dead ends: 1354 [2019-11-23 23:30:34,800 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:34,802 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:30:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:30:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 918 transitions. [2019-11-23 23:30:34,831 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 918 transitions. Word has length 91 [2019-11-23 23:30:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:34,832 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 918 transitions. [2019-11-23 23:30:34,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 918 transitions. [2019-11-23 23:30:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:30:34,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:34,835 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:34,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2009841932, now seen corresponding path program 1 times [2019-11-23 23:30:34,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:34,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671588605] [2019-11-23 23:30:34,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:34,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671588605] [2019-11-23 23:30:34,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:34,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:34,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663555223] [2019-11-23 23:30:34,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:34,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:34,959 INFO L87 Difference]: Start difference. First operand 713 states and 918 transitions. Second operand 4 states. [2019-11-23 23:30:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:35,513 INFO L93 Difference]: Finished difference Result 1513 states and 1934 transitions. [2019-11-23 23:30:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:35,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:30:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:35,519 INFO L225 Difference]: With dead ends: 1513 [2019-11-23 23:30:35,520 INFO L226 Difference]: Without dead ends: 801 [2019-11-23 23:30:35,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-23 23:30:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 784. [2019-11-23 23:30:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 992 transitions. [2019-11-23 23:30:35,551 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 992 transitions. Word has length 99 [2019-11-23 23:30:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:35,552 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 992 transitions. [2019-11-23 23:30:35,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 992 transitions. [2019-11-23 23:30:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:30:35,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:35,556 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:35,556 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1788101444, now seen corresponding path program 1 times [2019-11-23 23:30:35,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:35,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106974411] [2019-11-23 23:30:35,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:30:35,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106974411] [2019-11-23 23:30:35,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:35,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:35,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948813031] [2019-11-23 23:30:35,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:35,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:35,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:35,659 INFO L87 Difference]: Start difference. First operand 784 states and 992 transitions. Second operand 4 states. [2019-11-23 23:30:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:36,320 INFO L93 Difference]: Finished difference Result 1567 states and 2002 transitions. [2019-11-23 23:30:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:36,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:30:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:36,327 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:30:36,327 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:36,329 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:30:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-23 23:30:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 982 transitions. [2019-11-23 23:30:36,355 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 982 transitions. Word has length 103 [2019-11-23 23:30:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:36,356 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 982 transitions. [2019-11-23 23:30:36,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 982 transitions. [2019-11-23 23:30:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:30:36,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:36,360 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:36,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1472782685, now seen corresponding path program 1 times [2019-11-23 23:30:36,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:36,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508912085] [2019-11-23 23:30:36,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:36,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508912085] [2019-11-23 23:30:36,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:36,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:36,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496518292] [2019-11-23 23:30:36,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:30:36,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:30:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:36,483 INFO L87 Difference]: Start difference. First operand 784 states and 982 transitions. Second operand 5 states. [2019-11-23 23:30:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:37,254 INFO L93 Difference]: Finished difference Result 2064 states and 2660 transitions. [2019-11-23 23:30:37,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:37,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:30:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:37,261 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:30:37,262 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:30:37,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:30:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-11-23 23:30:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:30:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1379 transitions. [2019-11-23 23:30:37,291 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1379 transitions. Word has length 121 [2019-11-23 23:30:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:37,291 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1379 transitions. [2019-11-23 23:30:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:30:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1379 transitions. [2019-11-23 23:30:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 23:30:37,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:37,296 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:30:37,296 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1906082923, now seen corresponding path program 1 times [2019-11-23 23:30:37,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:37,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769348515] [2019-11-23 23:30:37,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:30:37,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769348515] [2019-11-23 23:30:37,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435056581] [2019-11-23 23:30:37,516 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:30:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:37,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:37,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:30:37,720 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:30:37,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:37,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:30:37,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309990680] [2019-11-23 23:30:37,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:37,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:37,793 INFO L87 Difference]: Start difference. First operand 1139 states and 1379 transitions. Second operand 3 states. [2019-11-23 23:30:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:38,141 INFO L93 Difference]: Finished difference Result 2275 states and 2775 transitions. [2019-11-23 23:30:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:38,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 23:30:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:38,143 INFO L225 Difference]: With dead ends: 2275 [2019-11-23 23:30:38,143 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:38,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:38,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2019-11-23 23:30:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:38,148 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:38,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:38,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:38,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:38,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:38,600 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:38,601 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:38,602 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:38,602 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:38,602 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:38,602 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 (= 15 ~a8~0)) (= 13 ~a8~0) (and .cse0 .cse1 (= ~a20~0 1)) (<= ~a17~0 0))) [2019-11-23 23:30:38,602 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:38,603 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:38,604 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:38,605 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:38,606 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 (= 15 ~a8~0)) (= 13 ~a8~0) (and .cse0 .cse1 (= ~a20~0 1)) (<= ~a17~0 0))) [2019-11-23 23:30:38,606 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:38,606 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:38,606 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:38,606 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:38,606 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:38,607 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:38,608 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:38,609 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 524) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:38,610 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:38,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:38 BoogieIcfgContainer [2019-11-23 23:30:38,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:38,636 INFO L168 Benchmark]: Toolchain (without parser) took 10425.10 ms. Allocated memory was 139.5 MB in the beginning and 371.2 MB in the end (delta: 231.7 MB). Free memory was 102.6 MB in the beginning and 229.6 MB in the end (delta: -127.0 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,637 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.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:30:38,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.67 ms. Allocated memory was 139.5 MB in the beginning and 206.6 MB in the end (delta: 67.1 MB). Free memory was 102.4 MB in the beginning and 173.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.46 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 166.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,641 INFO L168 Benchmark]: Boogie Preprocessor took 64.16 ms. Allocated memory is still 206.6 MB. Free memory was 166.8 MB in the beginning and 162.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,645 INFO L168 Benchmark]: RCFGBuilder took 2005.00 ms. Allocated memory was 206.6 MB in the beginning and 249.0 MB in the end (delta: 42.5 MB). Free memory was 162.7 MB in the beginning and 201.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,646 INFO L168 Benchmark]: TraceAbstraction took 7508.37 ms. Allocated memory was 249.0 MB in the beginning and 371.2 MB in the end (delta: 122.2 MB). Free memory was 201.3 MB in the beginning and 229.6 MB in the end (delta: -28.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:38,662 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.27 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.67 ms. Allocated memory was 139.5 MB in the beginning and 206.6 MB in the end (delta: 67.1 MB). Free memory was 102.4 MB in the beginning and 173.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.46 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 166.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.16 ms. Allocated memory is still 206.6 MB. Free memory was 166.8 MB in the beginning and 162.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2005.00 ms. Allocated memory was 206.6 MB in the beginning and 249.0 MB in the end (delta: 42.5 MB). Free memory was 162.7 MB in the beginning and 201.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7508.37 ms. Allocated memory was 249.0 MB in the beginning and 371.2 MB in the end (delta: 122.2 MB). Free memory was 201.3 MB in the beginning and 229.6 MB in the end (delta: -28.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 524]: 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: 30]: Loop Invariant Derived loop invariant: ((((a17 == 1 && a21 == 1) && 15 == a8) || 13 == a8) || ((a17 == 1 && a21 == 1) && a20 == 1)) || a17 <= 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((a17 == 1 && a21 == 1) && 15 == a8) || 13 == a8) || ((a17 == 1 && a21 == 1) && a20 == 1)) || a17 <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 344 SDtfs, 848 SDslu, 64 SDs, 0 SdLazy, 2573 SolverSat, 571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 380 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 514 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 55 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1473 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1026 NumberOfCodeBlocks, 1026 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1203 ConstructedInterpolants, 0 QuantifiedInterpolants, 367036 SizeOfPredicates, 1 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 895/922 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...