/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/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:18,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:18,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:18,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:18,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:18,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:18,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:18,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:18,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:18,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:18,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:18,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:18,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:18,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:18,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:18,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:18,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:18,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:18,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:18,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:18,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:18,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:18,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:18,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:18,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:18,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:18,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:18,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:18,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:18,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:18,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:18,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:18,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:18,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:18,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:18,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:18,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:18,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:18,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:18,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:18,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:18,259 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-24 06:05:18,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:18,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:18,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:18,279 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:18,279 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:18,280 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:18,280 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:18,280 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:18,280 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:18,280 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:18,281 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:18,281 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:18,281 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:18,281 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:18,281 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:18,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:18,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:18,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:18,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:18,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:18,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:18,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:18,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:18,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:18,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:18,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:18,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:18,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:18,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:18,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:18,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:18,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:18,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:18,286 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:18,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:18,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:18,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:18,287 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:18,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:18,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:18,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:18,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:18,593 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:18,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-11-24 06:05:18,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b17abb/8dcbf6a85be14ea982fd9a7a82f0b549/FLAGdce6a8ea4 [2019-11-24 06:05:19,156 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:19,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-11-24 06:05:19,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b17abb/8dcbf6a85be14ea982fd9a7a82f0b549/FLAGdce6a8ea4 [2019-11-24 06:05:19,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b17abb/8dcbf6a85be14ea982fd9a7a82f0b549 [2019-11-24 06:05:19,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:19,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:19,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:19,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:19,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:19,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:19,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abb20bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19, skipping insertion in model container [2019-11-24 06:05:19,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:19,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:19,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:19,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:19,831 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:19,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:19,986 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:19,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19 WrapperNode [2019-11-24 06:05:19,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:19,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:19,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:19,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:20,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:20,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:20,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:20,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:20,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (1/1) ... [2019-11-24 06:05:20,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:20,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:20,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:20,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:20,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (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-24 06:05:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:21,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:21,785 INFO L284 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-24 06:05:21,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:21 BoogieIcfgContainer [2019-11-24 06:05:21,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:21,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:21,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:21,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:21,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:19" (1/3) ... [2019-11-24 06:05:21,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe008b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:21, skipping insertion in model container [2019-11-24 06:05:21,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:19" (2/3) ... [2019-11-24 06:05:21,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe008b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:21, skipping insertion in model container [2019-11-24 06:05:21,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:21" (3/3) ... [2019-11-24 06:05:21,796 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-24 06:05:21,806 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:21,814 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 06:05:21,825 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 06:05:21,850 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:21,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:21,851 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:21,851 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:21,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:21,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:21,852 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:21,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2019-11-24 06:05:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:05:21,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:21,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:21,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1759267953, now seen corresponding path program 1 times [2019-11-24 06:05:21,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:21,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526460222] [2019-11-24 06:05:21,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:22,040 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-24 06:05:22,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526460222] [2019-11-24 06:05:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:22,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707851658] [2019-11-24 06:05:22,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:22,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:22,066 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2019-11-24 06:05:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:22,165 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2019-11-24 06:05:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:22,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:05:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:22,185 INFO L225 Difference]: With dead ends: 286 [2019-11-24 06:05:22,185 INFO L226 Difference]: Without dead ends: 179 [2019-11-24 06:05:22,189 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-24 06:05:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-24 06:05:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2019-11-24 06:05:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-24 06:05:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2019-11-24 06:05:22,252 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 19 [2019-11-24 06:05:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:22,253 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2019-11-24 06:05:22,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2019-11-24 06:05:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:22,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:22,258 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:22,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -356656974, now seen corresponding path program 1 times [2019-11-24 06:05:22,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:22,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822946596] [2019-11-24 06:05:22,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:05:22,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822946596] [2019-11-24 06:05:22,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:22,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:22,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671585428] [2019-11-24 06:05:22,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:22,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:22,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:22,360 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 3 states. [2019-11-24 06:05:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:22,449 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-11-24 06:05:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:22,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:05:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:22,452 INFO L225 Difference]: With dead ends: 459 [2019-11-24 06:05:22,453 INFO L226 Difference]: Without dead ends: 295 [2019-11-24 06:05:22,455 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-24 06:05:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-24 06:05:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2019-11-24 06:05:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-24 06:05:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2019-11-24 06:05:22,493 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 417 transitions. Word has length 36 [2019-11-24 06:05:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:22,495 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-24 06:05:22,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 417 transitions. [2019-11-24 06:05:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:22,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:22,498 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:22,500 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 562317649, now seen corresponding path program 1 times [2019-11-24 06:05:22,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:22,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322542175] [2019-11-24 06:05:22,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322542175] [2019-11-24 06:05:22,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:22,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:22,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252803501] [2019-11-24 06:05:22,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:22,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:22,620 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. Second operand 3 states. [2019-11-24 06:05:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:22,737 INFO L93 Difference]: Finished difference Result 799 states and 1151 transitions. [2019-11-24 06:05:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:22,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:05:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:22,740 INFO L225 Difference]: With dead ends: 799 [2019-11-24 06:05:22,740 INFO L226 Difference]: Without dead ends: 518 [2019-11-24 06:05:22,742 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-24 06:05:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-24 06:05:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 502. [2019-11-24 06:05:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-24 06:05:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 712 transitions. [2019-11-24 06:05:22,765 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 712 transitions. Word has length 36 [2019-11-24 06:05:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:22,765 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 712 transitions. [2019-11-24 06:05:22,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 712 transitions. [2019-11-24 06:05:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:05:22,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:22,769 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:22,769 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash -717007086, now seen corresponding path program 1 times [2019-11-24 06:05:22,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:22,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623659867] [2019-11-24 06:05:22,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623659867] [2019-11-24 06:05:22,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:22,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:22,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20732462] [2019-11-24 06:05:22,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:22,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:22,871 INFO L87 Difference]: Start difference. First operand 502 states and 712 transitions. Second operand 4 states. [2019-11-24 06:05:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:22,966 INFO L93 Difference]: Finished difference Result 1238 states and 1798 transitions. [2019-11-24 06:05:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:22,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-24 06:05:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:22,971 INFO L225 Difference]: With dead ends: 1238 [2019-11-24 06:05:22,971 INFO L226 Difference]: Without dead ends: 746 [2019-11-24 06:05:22,973 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-24 06:05:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-11-24 06:05:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 598. [2019-11-24 06:05:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-24 06:05:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 872 transitions. [2019-11-24 06:05:23,002 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 872 transitions. Word has length 36 [2019-11-24 06:05:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,002 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 872 transitions. [2019-11-24 06:05:23,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 872 transitions. [2019-11-24 06:05:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:05:23,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,008 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:23,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1621662930, now seen corresponding path program 1 times [2019-11-24 06:05:23,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145221014] [2019-11-24 06:05:23,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:23,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145221014] [2019-11-24 06:05:23,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:23,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:23,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178626793] [2019-11-24 06:05:23,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:23,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:23,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:23,143 INFO L87 Difference]: Start difference. First operand 598 states and 872 transitions. Second operand 3 states. [2019-11-24 06:05:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:23,199 INFO L93 Difference]: Finished difference Result 972 states and 1420 transitions. [2019-11-24 06:05:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:23,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 06:05:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:23,206 INFO L225 Difference]: With dead ends: 972 [2019-11-24 06:05:23,206 INFO L226 Difference]: Without dead ends: 634 [2019-11-24 06:05:23,207 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-24 06:05:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-24 06:05:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 598. [2019-11-24 06:05:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-24 06:05:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 848 transitions. [2019-11-24 06:05:23,235 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 848 transitions. Word has length 52 [2019-11-24 06:05:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,237 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 848 transitions. [2019-11-24 06:05:23,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 848 transitions. [2019-11-24 06:05:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:05:23,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,239 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:23,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash -648173971, now seen corresponding path program 1 times [2019-11-24 06:05:23,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217714176] [2019-11-24 06:05:23,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:23,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217714176] [2019-11-24 06:05:23,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:23,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728082156] [2019-11-24 06:05:23,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:23,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:23,365 INFO L87 Difference]: Start difference. First operand 598 states and 848 transitions. Second operand 4 states. [2019-11-24 06:05:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:23,418 INFO L93 Difference]: Finished difference Result 945 states and 1343 transitions. [2019-11-24 06:05:23,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:23,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-24 06:05:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:23,422 INFO L225 Difference]: With dead ends: 945 [2019-11-24 06:05:23,422 INFO L226 Difference]: Without dead ends: 615 [2019-11-24 06:05:23,423 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-24 06:05:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-24 06:05:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 598. [2019-11-24 06:05:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-24 06:05:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 834 transitions. [2019-11-24 06:05:23,446 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 834 transitions. Word has length 52 [2019-11-24 06:05:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 834 transitions. [2019-11-24 06:05:23,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions. [2019-11-24 06:05:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:05:23,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,449 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:23,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1395715861, now seen corresponding path program 1 times [2019-11-24 06:05:23,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:23,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985093144] [2019-11-24 06:05:23,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:23,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985093144] [2019-11-24 06:05:23,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644792427] [2019-11-24 06:05:23,546 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-24 06:05:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:23,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:23,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:23,703 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:23,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:23,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:23,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991405389] [2019-11-24 06:05:23,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:23,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:23,722 INFO L87 Difference]: Start difference. First operand 598 states and 834 transitions. Second operand 3 states. [2019-11-24 06:05:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:23,816 INFO L93 Difference]: Finished difference Result 1674 states and 2328 transitions. [2019-11-24 06:05:23,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:23,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 06:05:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:23,822 INFO L225 Difference]: With dead ends: 1674 [2019-11-24 06:05:23,822 INFO L226 Difference]: Without dead ends: 1086 [2019-11-24 06:05:23,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-11-24 06:05:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1082. [2019-11-24 06:05:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-11-24 06:05:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1486 transitions. [2019-11-24 06:05:23,889 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1486 transitions. Word has length 53 [2019-11-24 06:05:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:23,889 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 1486 transitions. [2019-11-24 06:05:23,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1486 transitions. [2019-11-24 06:05:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 06:05:23,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:23,892 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:24,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:24,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1723450510, now seen corresponding path program 1 times [2019-11-24 06:05:24,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:24,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228222406] [2019-11-24 06:05:24,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:24,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228222406] [2019-11-24 06:05:24,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531393886] [2019-11-24 06:05:24,194 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-24 06:05:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:24,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:24,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:24,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:24,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:24,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:24,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:24,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:24,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994724062] [2019-11-24 06:05:24,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:24,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:24,320 INFO L87 Difference]: Start difference. First operand 1082 states and 1486 transitions. Second operand 3 states. [2019-11-24 06:05:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:24,462 INFO L93 Difference]: Finished difference Result 2603 states and 3582 transitions. [2019-11-24 06:05:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:24,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 06:05:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:24,471 INFO L225 Difference]: With dead ends: 2603 [2019-11-24 06:05:24,472 INFO L226 Difference]: Without dead ends: 1531 [2019-11-24 06:05:24,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-11-24 06:05:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1527. [2019-11-24 06:05:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-11-24 06:05:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2072 transitions. [2019-11-24 06:05:24,537 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2072 transitions. Word has length 54 [2019-11-24 06:05:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2072 transitions. [2019-11-24 06:05:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2072 transitions. [2019-11-24 06:05:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 06:05:24,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:24,541 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:24,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:24,745 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash -447945077, now seen corresponding path program 1 times [2019-11-24 06:05:24,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:24,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821109236] [2019-11-24 06:05:24,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:24,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821109236] [2019-11-24 06:05:24,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926400099] [2019-11-24 06:05:24,807 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-24 06:05:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:24,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:05:24,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:24,937 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:24,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:24,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-11-24 06:05:24,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309686715] [2019-11-24 06:05:24,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:24,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 06:05:24,987 INFO L87 Difference]: Start difference. First operand 1527 states and 2072 transitions. Second operand 8 states. [2019-11-24 06:05:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:25,478 INFO L93 Difference]: Finished difference Result 3426 states and 4769 transitions. [2019-11-24 06:05:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 06:05:25,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-24 06:05:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:25,488 INFO L225 Difference]: With dead ends: 3426 [2019-11-24 06:05:25,488 INFO L226 Difference]: Without dead ends: 1909 [2019-11-24 06:05:25,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-11-24 06:05:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-11-24 06:05:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1157. [2019-11-24 06:05:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-11-24 06:05:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1603 transitions. [2019-11-24 06:05:25,595 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1603 transitions. Word has length 55 [2019-11-24 06:05:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:25,596 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 1603 transitions. [2019-11-24 06:05:25,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1603 transitions. [2019-11-24 06:05:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 06:05:25,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:25,598 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:25,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:25,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1503674733, now seen corresponding path program 1 times [2019-11-24 06:05:25,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:25,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323108395] [2019-11-24 06:05:25,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:25,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323108395] [2019-11-24 06:05:25,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992614414] [2019-11-24 06:05:25,896 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-24 06:05:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:25,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 06:05:25,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:25,987 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:26,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 8 [2019-11-24 06:05:26,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823213016] [2019-11-24 06:05:26,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:26,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:26,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:26,019 INFO L87 Difference]: Start difference. First operand 1157 states and 1603 transitions. Second operand 5 states. [2019-11-24 06:05:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:26,105 INFO L93 Difference]: Finished difference Result 2154 states and 2989 transitions. [2019-11-24 06:05:26,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:26,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-24 06:05:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:26,111 INFO L225 Difference]: With dead ends: 2154 [2019-11-24 06:05:26,111 INFO L226 Difference]: Without dead ends: 1201 [2019-11-24 06:05:26,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:05:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-11-24 06:05:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1157. [2019-11-24 06:05:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-11-24 06:05:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1573 transitions. [2019-11-24 06:05:26,168 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1573 transitions. Word has length 57 [2019-11-24 06:05:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:26,168 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 1573 transitions. [2019-11-24 06:05:26,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1573 transitions. [2019-11-24 06:05:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 06:05:26,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:26,171 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:26,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:26,376 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash -363323022, now seen corresponding path program 1 times [2019-11-24 06:05:26,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:26,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600369593] [2019-11-24 06:05:26,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600369593] [2019-11-24 06:05:26,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:26,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:26,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172740312] [2019-11-24 06:05:26,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:26,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:26,436 INFO L87 Difference]: Start difference. First operand 1157 states and 1573 transitions. Second operand 3 states. [2019-11-24 06:05:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:26,511 INFO L93 Difference]: Finished difference Result 2118 states and 2883 transitions. [2019-11-24 06:05:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:26,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-24 06:05:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:26,518 INFO L225 Difference]: With dead ends: 2118 [2019-11-24 06:05:26,519 INFO L226 Difference]: Without dead ends: 1165 [2019-11-24 06:05:26,522 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-24 06:05:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-11-24 06:05:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1140. [2019-11-24 06:05:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2019-11-24 06:05:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1486 transitions. [2019-11-24 06:05:26,621 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1486 transitions. Word has length 57 [2019-11-24 06:05:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:26,623 INFO L462 AbstractCegarLoop]: Abstraction has 1140 states and 1486 transitions. [2019-11-24 06:05:26,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1486 transitions. [2019-11-24 06:05:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 06:05:26,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:26,629 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:26,629 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash 699689588, now seen corresponding path program 1 times [2019-11-24 06:05:26,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:26,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709639782] [2019-11-24 06:05:26,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709639782] [2019-11-24 06:05:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101186436] [2019-11-24 06:05:26,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:26,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-24 06:05:26,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:26,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:26,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,830 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [5] total 11 [2019-11-24 06:05:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077167291] [2019-11-24 06:05:26,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 06:05:26,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 06:05:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-24 06:05:26,862 INFO L87 Difference]: Start difference. First operand 1140 states and 1486 transitions. Second operand 9 states. [2019-11-24 06:05:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:27,571 INFO L93 Difference]: Finished difference Result 2763 states and 3640 transitions. [2019-11-24 06:05:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 06:05:27,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-24 06:05:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:27,583 INFO L225 Difference]: With dead ends: 2763 [2019-11-24 06:05:27,583 INFO L226 Difference]: Without dead ends: 1834 [2019-11-24 06:05:27,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-11-24 06:05:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-11-24 06:05:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1079. [2019-11-24 06:05:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-24 06:05:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1420 transitions. [2019-11-24 06:05:27,708 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1420 transitions. Word has length 58 [2019-11-24 06:05:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:27,708 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1420 transitions. [2019-11-24 06:05:27,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 06:05:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1420 transitions. [2019-11-24 06:05:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 06:05:27,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:27,711 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:27,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:27,914 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1412224130, now seen corresponding path program 1 times [2019-11-24 06:05:27,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:27,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818578880] [2019-11-24 06:05:27,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:27,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818578880] [2019-11-24 06:05:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395936562] [2019-11-24 06:05:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:27,960 INFO L87 Difference]: Start difference. First operand 1079 states and 1420 transitions. Second operand 4 states. [2019-11-24 06:05:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,065 INFO L93 Difference]: Finished difference Result 2450 states and 3226 transitions. [2019-11-24 06:05:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:28,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-24 06:05:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,072 INFO L225 Difference]: With dead ends: 2450 [2019-11-24 06:05:28,072 INFO L226 Difference]: Without dead ends: 1414 [2019-11-24 06:05:28,074 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-24 06:05:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-11-24 06:05:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1068. [2019-11-24 06:05:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-24 06:05:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1402 transitions. [2019-11-24 06:05:28,138 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1402 transitions. Word has length 59 [2019-11-24 06:05:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,139 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1402 transitions. [2019-11-24 06:05:28,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1402 transitions. [2019-11-24 06:05:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:05:28,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,148 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:28,148 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1060762502, now seen corresponding path program 1 times [2019-11-24 06:05:28,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129267800] [2019-11-24 06:05:28,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:28,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129267800] [2019-11-24 06:05:28,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:28,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291309668] [2019-11-24 06:05:28,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,212 INFO L87 Difference]: Start difference. First operand 1068 states and 1402 transitions. Second operand 3 states. [2019-11-24 06:05:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,274 INFO L93 Difference]: Finished difference Result 1842 states and 2427 transitions. [2019-11-24 06:05:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:05:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,279 INFO L225 Difference]: With dead ends: 1842 [2019-11-24 06:05:28,279 INFO L226 Difference]: Without dead ends: 843 [2019-11-24 06:05:28,280 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-24 06:05:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-24 06:05:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 819. [2019-11-24 06:05:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-24 06:05:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1038 transitions. [2019-11-24 06:05:28,325 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1038 transitions. Word has length 60 [2019-11-24 06:05:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,326 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1038 transitions. [2019-11-24 06:05:28,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1038 transitions. [2019-11-24 06:05:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:05:28,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,328 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:28,328 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash 227432027, now seen corresponding path program 1 times [2019-11-24 06:05:28,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980279874] [2019-11-24 06:05:28,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:28,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980279874] [2019-11-24 06:05:28,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:28,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:28,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907297506] [2019-11-24 06:05:28,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:28,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:28,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,386 INFO L87 Difference]: Start difference. First operand 819 states and 1038 transitions. Second operand 3 states. [2019-11-24 06:05:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:28,445 INFO L93 Difference]: Finished difference Result 1369 states and 1732 transitions. [2019-11-24 06:05:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:28,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:05:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:28,450 INFO L225 Difference]: With dead ends: 1369 [2019-11-24 06:05:28,450 INFO L226 Difference]: Without dead ends: 819 [2019-11-24 06:05:28,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-24 06:05:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-11-24 06:05:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-24 06:05:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1022 transitions. [2019-11-24 06:05:28,501 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1022 transitions. Word has length 60 [2019-11-24 06:05:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:28,501 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1022 transitions. [2019-11-24 06:05:28,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1022 transitions. [2019-11-24 06:05:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 06:05:28,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:28,503 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:28,503 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1214251974, now seen corresponding path program 1 times [2019-11-24 06:05:28,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:28,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385419279] [2019-11-24 06:05:28,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:28,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385419279] [2019-11-24 06:05:28,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301888989] [2019-11-24 06:05:28,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:28,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:28,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:28,821 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:28,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:28,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:28,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-11-24 06:05:28,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253571060] [2019-11-24 06:05:28,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:28,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:28,880 INFO L87 Difference]: Start difference. First operand 819 states and 1022 transitions. Second operand 6 states. [2019-11-24 06:05:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,066 INFO L93 Difference]: Finished difference Result 1700 states and 2082 transitions. [2019-11-24 06:05:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:29,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-24 06:05:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,072 INFO L225 Difference]: With dead ends: 1700 [2019-11-24 06:05:29,073 INFO L226 Difference]: Without dead ends: 1150 [2019-11-24 06:05:29,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:05:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2019-11-24 06:05:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 979. [2019-11-24 06:05:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-24 06:05:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1189 transitions. [2019-11-24 06:05:29,133 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1189 transitions. Word has length 61 [2019-11-24 06:05:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1189 transitions. [2019-11-24 06:05:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1189 transitions. [2019-11-24 06:05:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:29,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,136 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:29,341 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1418309982, now seen corresponding path program 1 times [2019-11-24 06:05:29,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467276577] [2019-11-24 06:05:29,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:29,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467276577] [2019-11-24 06:05:29,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:29,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627506810] [2019-11-24 06:05:29,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:29,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:29,394 INFO L87 Difference]: Start difference. First operand 979 states and 1189 transitions. Second operand 5 states. [2019-11-24 06:05:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,530 INFO L93 Difference]: Finished difference Result 1716 states and 2057 transitions. [2019-11-24 06:05:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:29,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 06:05:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,536 INFO L225 Difference]: With dead ends: 1716 [2019-11-24 06:05:29,537 INFO L226 Difference]: Without dead ends: 1265 [2019-11-24 06:05:29,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 06:05:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-24 06:05:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1055. [2019-11-24 06:05:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-24 06:05:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1259 transitions. [2019-11-24 06:05:29,604 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1259 transitions. Word has length 62 [2019-11-24 06:05:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,605 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1259 transitions. [2019-11-24 06:05:29,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1259 transitions. [2019-11-24 06:05:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 06:05:29,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,607 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:29,607 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2038897403, now seen corresponding path program 1 times [2019-11-24 06:05:29,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465419916] [2019-11-24 06:05:29,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:29,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465419916] [2019-11-24 06:05:29,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:29,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392285490] [2019-11-24 06:05:29,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:29,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:29,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,655 INFO L87 Difference]: Start difference. First operand 1055 states and 1259 transitions. Second operand 4 states. [2019-11-24 06:05:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,845 INFO L93 Difference]: Finished difference Result 2043 states and 2425 transitions. [2019-11-24 06:05:29,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:29,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-24 06:05:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,851 INFO L225 Difference]: With dead ends: 2043 [2019-11-24 06:05:29,851 INFO L226 Difference]: Without dead ends: 1199 [2019-11-24 06:05:29,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-24 06:05:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-24 06:05:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 940. [2019-11-24 06:05:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-24 06:05:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1100 transitions. [2019-11-24 06:05:29,912 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1100 transitions. Word has length 62 [2019-11-24 06:05:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,912 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1100 transitions. [2019-11-24 06:05:29,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1100 transitions. [2019-11-24 06:05:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 06:05:29,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,915 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:29,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1721993265, now seen corresponding path program 1 times [2019-11-24 06:05:29,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615916792] [2019-11-24 06:05:29,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:30,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615916792] [2019-11-24 06:05:30,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:30,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:05:30,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121707420] [2019-11-24 06:05:30,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:05:30,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:05:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:30,064 INFO L87 Difference]: Start difference. First operand 940 states and 1100 transitions. Second operand 5 states. [2019-11-24 06:05:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:30,225 INFO L93 Difference]: Finished difference Result 2806 states and 3300 transitions. [2019-11-24 06:05:30,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:30,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-24 06:05:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:30,236 INFO L225 Difference]: With dead ends: 2806 [2019-11-24 06:05:30,237 INFO L226 Difference]: Without dead ends: 2356 [2019-11-24 06:05:30,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:05:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-11-24 06:05:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1295. [2019-11-24 06:05:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-11-24 06:05:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1515 transitions. [2019-11-24 06:05:30,334 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1515 transitions. Word has length 79 [2019-11-24 06:05:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:30,334 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 1515 transitions. [2019-11-24 06:05:30,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:05:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1515 transitions. [2019-11-24 06:05:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-24 06:05:30,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:30,337 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:30,337 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1478737572, now seen corresponding path program 1 times [2019-11-24 06:05:30,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:30,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895449495] [2019-11-24 06:05:30,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:05:30,469 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:05:30,469 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:05:30,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:30 BoogieIcfgContainer [2019-11-24 06:05:30,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:30,591 INFO L168 Benchmark]: Toolchain (without parser) took 11059.56 ms. Allocated memory was 141.0 MB in the beginning and 382.7 MB in the end (delta: 241.7 MB). Free memory was 102.9 MB in the beginning and 102.4 MB in the end (delta: 502.1 kB). Peak memory consumption was 242.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,592 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.88 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.7 MB in the beginning and 178.1 MB in the end (delta: -75.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 174.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,596 INFO L168 Benchmark]: Boogie Preprocessor took 60.87 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 172.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,597 INFO L168 Benchmark]: RCFGBuilder took 1657.63 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 172.0 MB in the beginning and 143.0 MB in the end (delta: 29.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,597 INFO L168 Benchmark]: TraceAbstraction took 8800.19 ms. Allocated memory was 235.4 MB in the beginning and 382.7 MB in the end (delta: 147.3 MB). Free memory was 143.0 MB in the beginning and 102.4 MB in the end (delta: 40.6 MB). Peak memory consumption was 187.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:30,601 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 454.88 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.7 MB in the beginning and 178.1 MB in the end (delta: -75.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 174.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.87 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 172.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1657.63 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 172.0 MB in the beginning and 143.0 MB in the end (delta: 29.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8800.19 ms. Allocated memory was 235.4 MB in the beginning and 382.7 MB in the end (delta: 147.3 MB). Free memory was 143.0 MB in the beginning and 102.4 MB in the end (delta: 40.6 MB). Peak memory consumption was 187.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; [L600] int __retres1 ; [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 [L233] COND TRUE m_i == 1 [L234] m_st = 0 [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 [L346] COND FALSE !(M_E == 0) [L351] COND FALSE !(T1_E == 0) [L356] COND FALSE !(T2_E == 0) [L361] COND FALSE !(E_M == 0) [L366] COND FALSE !(E_1 == 0) [L371] COND FALSE !(E_2 == 0) [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L384] COND FALSE !(M_E == 1) [L389] COND FALSE !(T1_E == 1) [L394] COND FALSE !(T2_E == 1) [L399] COND FALSE !(E_M == 1) [L404] COND FALSE !(E_1 == 1) [L409] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 [L558] kernel_st = 1 [L279] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L51] COND TRUE 1 [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 [L203] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 [L115] token += 1 [L116] E_2 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 [L118] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 [L151] token += 1 [L152] E_M = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L154] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L43] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L65] COND FALSE !(token != local + 2) [L70] COND TRUE tmp_var <= 5 [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3283 SDtfs, 3376 SDslu, 4270 SDs, 0 SdLazy, 865 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 706 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1527occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 3888 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 220469 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1570 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 321/339 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 incorrect! Received shutdown request...