/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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:58,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:58,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:58,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:58,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:58,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:58,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:58,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:58,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:58,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:58,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:58,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:58,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:58,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:58,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:58,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:58,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:58,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:58,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:58,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:58,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:58,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:58,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:58,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:58,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:58,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:58,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:58,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:58,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:58,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:58,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:58,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:58,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:58,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:58,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:58,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:58,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:58,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:58,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:58,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:58,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:58,834 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:58,856 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:58,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:58,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:58,858 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:58,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:58,858 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:58,858 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:58,858 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:58,859 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:58,859 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:58,860 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:58,860 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:58,860 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:58,861 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:58,861 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:58,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:58,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:58,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:58,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:58,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:58,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:58,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:58,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:58,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:58,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:58,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:58,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:58,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:58,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:58,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:58,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:58,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:58,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:58,867 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:58,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:58,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:58,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:58,869 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:59,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:59,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:59,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:59,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:59,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:59,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-11-24 06:05:59,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb35e08e/2f9711613b1648e4a4835c5ce2e90344/FLAG1a052853a [2019-11-24 06:05:59,693 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:59,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-11-24 06:05:59,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb35e08e/2f9711613b1648e4a4835c5ce2e90344/FLAG1a052853a [2019-11-24 06:06:00,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb35e08e/2f9711613b1648e4a4835c5ce2e90344 [2019-11-24 06:06:00,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:06:00,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:06:00,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:00,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:06:00,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:06:00,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bf5d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00, skipping insertion in model container [2019-11-24 06:06:00,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:06:00,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:06:00,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:00,359 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:06:00,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:00,525 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:06:00,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00 WrapperNode [2019-11-24 06:06:00,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:00,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:00,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:06:00,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:06:00,536 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:06:00" (1/1) ... [2019-11-24 06:06:00,554 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:06:00" (1/1) ... [2019-11-24 06:06:00,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:00,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:06:00,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:06:00,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:06:00,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (1/1) ... [2019-11-24 06:06:00,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:06:00,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:06:00,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:06:00,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:06:00,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (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:06:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:06:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:06:02,115 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:06:02,115 INFO L284 CfgBuilder]: Removed 94 assume(true) statements. [2019-11-24 06:06:02,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:02 BoogieIcfgContainer [2019-11-24 06:06:02,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:06:02,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:06:02,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:06:02,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:06:02,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:06:00" (1/3) ... [2019-11-24 06:06:02,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:02, skipping insertion in model container [2019-11-24 06:06:02,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:00" (2/3) ... [2019-11-24 06:06:02,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:02, skipping insertion in model container [2019-11-24 06:06:02,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:02" (3/3) ... [2019-11-24 06:06:02,129 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-24 06:06:02,139 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:06:02,149 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:06:02,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:06:02,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:06:02,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:06:02,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:06:02,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:06:02,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:06:02,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:06:02,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:06:02,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:06:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-24 06:06:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:06:02,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:02,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:02,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash -68201116, now seen corresponding path program 1 times [2019-11-24 06:06:02,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:02,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87755811] [2019-11-24 06:06:02,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:02,435 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:06:02,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87755811] [2019-11-24 06:06:02,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:02,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:02,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280314761] [2019-11-24 06:06:02,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:02,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:02,463 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-11-24 06:06:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:02,576 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2019-11-24 06:06:02,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:02,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:06:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:02,600 INFO L225 Difference]: With dead ends: 229 [2019-11-24 06:06:02,601 INFO L226 Difference]: Without dead ends: 143 [2019-11-24 06:06:02,606 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:06:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-24 06:06:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-11-24 06:06:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-24 06:06:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2019-11-24 06:06:02,686 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 20 [2019-11-24 06:06:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:02,686 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2019-11-24 06:06:02,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2019-11-24 06:06:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:06:02,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:02,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:02,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1108403203, now seen corresponding path program 1 times [2019-11-24 06:06:02,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:02,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916533026] [2019-11-24 06:06:02,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:02,756 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:06:02,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916533026] [2019-11-24 06:06:02,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:02,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793655894] [2019-11-24 06:06:02,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:02,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:02,762 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand 3 states. [2019-11-24 06:06:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:02,834 INFO L93 Difference]: Finished difference Result 387 states and 569 transitions. [2019-11-24 06:06:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:02,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:06:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:02,837 INFO L225 Difference]: With dead ends: 387 [2019-11-24 06:06:02,837 INFO L226 Difference]: Without dead ends: 256 [2019-11-24 06:06:02,839 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:06:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-24 06:06:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-11-24 06:06:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-24 06:06:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 363 transitions. [2019-11-24 06:06:02,863 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 363 transitions. Word has length 20 [2019-11-24 06:06:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:02,864 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 363 transitions. [2019-11-24 06:06:02,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 363 transitions. [2019-11-24 06:06:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 06:06:02,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:02,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:02,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash -413525998, now seen corresponding path program 1 times [2019-11-24 06:06:02,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:02,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59278067] [2019-11-24 06:06:02,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:02,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59278067] [2019-11-24 06:06:02,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:02,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:02,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112866516] [2019-11-24 06:06:02,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:02,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:02,994 INFO L87 Difference]: Start difference. First operand 254 states and 363 transitions. Second operand 4 states. [2019-11-24 06:06:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:03,093 INFO L93 Difference]: Finished difference Result 753 states and 1094 transitions. [2019-11-24 06:06:03,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:03,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 06:06:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:03,098 INFO L225 Difference]: With dead ends: 753 [2019-11-24 06:06:03,098 INFO L226 Difference]: Without dead ends: 510 [2019-11-24 06:06:03,100 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:06:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-24 06:06:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 304. [2019-11-24 06:06:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-24 06:06:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 447 transitions. [2019-11-24 06:06:03,145 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 447 transitions. Word has length 28 [2019-11-24 06:06:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:03,145 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 447 transitions. [2019-11-24 06:06:03,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 447 transitions. [2019-11-24 06:06:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 06:06:03,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:03,149 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:03,150 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1969112911, now seen corresponding path program 1 times [2019-11-24 06:06:03,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:03,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959705421] [2019-11-24 06:06:03,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:03,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959705421] [2019-11-24 06:06:03,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:03,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:03,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590891411] [2019-11-24 06:06:03,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:03,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:03,244 INFO L87 Difference]: Start difference. First operand 304 states and 447 transitions. Second operand 3 states. [2019-11-24 06:06:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:03,296 INFO L93 Difference]: Finished difference Result 711 states and 1062 transitions. [2019-11-24 06:06:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:03,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 06:06:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:03,300 INFO L225 Difference]: With dead ends: 711 [2019-11-24 06:06:03,300 INFO L226 Difference]: Without dead ends: 418 [2019-11-24 06:06:03,301 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:06:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-24 06:06:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-11-24 06:06:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-24 06:06:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 575 transitions. [2019-11-24 06:06:03,350 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 575 transitions. Word has length 41 [2019-11-24 06:06:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:03,351 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 575 transitions. [2019-11-24 06:06:03,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 575 transitions. [2019-11-24 06:06:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:06:03,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:03,364 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:03,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash -567026932, now seen corresponding path program 1 times [2019-11-24 06:06:03,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:03,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505351373] [2019-11-24 06:06:03,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:03,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505351373] [2019-11-24 06:06:03,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:03,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:03,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472669036] [2019-11-24 06:06:03,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:03,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:03,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:03,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:03,441 INFO L87 Difference]: Start difference. First operand 384 states and 575 transitions. Second operand 3 states. [2019-11-24 06:06:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:03,506 INFO L93 Difference]: Finished difference Result 579 states and 875 transitions. [2019-11-24 06:06:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:03,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 06:06:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:03,511 INFO L225 Difference]: With dead ends: 579 [2019-11-24 06:06:03,511 INFO L226 Difference]: Without dead ends: 384 [2019-11-24 06:06:03,513 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:06:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-24 06:06:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-24 06:06:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-24 06:06:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 569 transitions. [2019-11-24 06:06:03,535 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 569 transitions. Word has length 42 [2019-11-24 06:06:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 569 transitions. [2019-11-24 06:06:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 569 transitions. [2019-11-24 06:06:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:06:03,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:03,539 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:03,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 97553643, now seen corresponding path program 1 times [2019-11-24 06:06:03,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:03,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855329952] [2019-11-24 06:06:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:03,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855329952] [2019-11-24 06:06:03,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:03,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:03,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766299307] [2019-11-24 06:06:03,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:03,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:03,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:03,669 INFO L87 Difference]: Start difference. First operand 384 states and 569 transitions. Second operand 3 states. [2019-11-24 06:06:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:03,717 INFO L93 Difference]: Finished difference Result 579 states and 863 transitions. [2019-11-24 06:06:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:03,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 06:06:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:03,723 INFO L225 Difference]: With dead ends: 579 [2019-11-24 06:06:03,724 INFO L226 Difference]: Without dead ends: 384 [2019-11-24 06:06:03,725 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:06:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-24 06:06:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2019-11-24 06:06:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-24 06:06:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 548 transitions. [2019-11-24 06:06:03,745 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 548 transitions. Word has length 42 [2019-11-24 06:06:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:03,746 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 548 transitions. [2019-11-24 06:06:03,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 548 transitions. [2019-11-24 06:06:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:06:03,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:03,748 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:03,748 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1918967368, now seen corresponding path program 1 times [2019-11-24 06:06:03,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:03,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457638399] [2019-11-24 06:06:03,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:03,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457638399] [2019-11-24 06:06:03,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:03,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:06:03,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784242424] [2019-11-24 06:06:03,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:06:03,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:06:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:06:03,890 INFO L87 Difference]: Start difference. First operand 378 states and 548 transitions. Second operand 5 states. [2019-11-24 06:06:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,018 INFO L93 Difference]: Finished difference Result 833 states and 1202 transitions. [2019-11-24 06:06:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:06:04,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 06:06:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,023 INFO L225 Difference]: With dead ends: 833 [2019-11-24 06:06:04,023 INFO L226 Difference]: Without dead ends: 648 [2019-11-24 06:06:04,024 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:06:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-24 06:06:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 432. [2019-11-24 06:06:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-24 06:06:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 618 transitions. [2019-11-24 06:06:04,051 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 618 transitions. Word has length 43 [2019-11-24 06:06:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,051 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 618 transitions. [2019-11-24 06:06:04,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:06:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 618 transitions. [2019-11-24 06:06:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 06:06:04,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,054 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:04,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 121100221, now seen corresponding path program 1 times [2019-11-24 06:06:04,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847910635] [2019-11-24 06:06:04,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:04,127 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:06:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847910635] [2019-11-24 06:06:04,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:04,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:04,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985772456] [2019-11-24 06:06:04,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:04,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:04,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:04,132 INFO L87 Difference]: Start difference. First operand 432 states and 618 transitions. Second operand 4 states. [2019-11-24 06:06:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,247 INFO L93 Difference]: Finished difference Result 1208 states and 1756 transitions. [2019-11-24 06:06:04,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:04,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-24 06:06:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,253 INFO L225 Difference]: With dead ends: 1208 [2019-11-24 06:06:04,253 INFO L226 Difference]: Without dead ends: 787 [2019-11-24 06:06:04,254 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:06:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-11-24 06:06:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 558. [2019-11-24 06:06:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-24 06:06:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 804 transitions. [2019-11-24 06:06:04,309 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 804 transitions. Word has length 44 [2019-11-24 06:06:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,309 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 804 transitions. [2019-11-24 06:06:04,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 804 transitions. [2019-11-24 06:06:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 06:06:04,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:04,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1780456656, now seen corresponding path program 1 times [2019-11-24 06:06:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359062788] [2019-11-24 06:06:04,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:04,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359062788] [2019-11-24 06:06:04,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:04,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:04,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407472645] [2019-11-24 06:06:04,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:04,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:04,358 INFO L87 Difference]: Start difference. First operand 558 states and 804 transitions. Second operand 3 states. [2019-11-24 06:06:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,419 INFO L93 Difference]: Finished difference Result 915 states and 1329 transitions. [2019-11-24 06:06:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:04,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-24 06:06:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,422 INFO L225 Difference]: With dead ends: 915 [2019-11-24 06:06:04,423 INFO L226 Difference]: Without dead ends: 557 [2019-11-24 06:06:04,424 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:06:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-24 06:06:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 541. [2019-11-24 06:06:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-24 06:06:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 755 transitions. [2019-11-24 06:06:04,459 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 755 transitions. Word has length 59 [2019-11-24 06:06:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,459 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 755 transitions. [2019-11-24 06:06:04,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 755 transitions. [2019-11-24 06:06:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 06:06:04,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,461 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:04,461 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash -492262127, now seen corresponding path program 1 times [2019-11-24 06:06:04,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750000742] [2019-11-24 06:06:04,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:04,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750000742] [2019-11-24 06:06:04,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:04,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:04,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376409675] [2019-11-24 06:06:04,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:04,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:04,508 INFO L87 Difference]: Start difference. First operand 541 states and 755 transitions. Second operand 3 states. [2019-11-24 06:06:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,572 INFO L93 Difference]: Finished difference Result 878 states and 1228 transitions. [2019-11-24 06:06:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:04,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-24 06:06:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,578 INFO L225 Difference]: With dead ends: 878 [2019-11-24 06:06:04,579 INFO L226 Difference]: Without dead ends: 541 [2019-11-24 06:06:04,580 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:06:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-11-24 06:06:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-11-24 06:06:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-24 06:06:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 746 transitions. [2019-11-24 06:06:04,614 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 746 transitions. Word has length 59 [2019-11-24 06:06:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 746 transitions. [2019-11-24 06:06:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 746 transitions. [2019-11-24 06:06:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:06:04,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,617 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:04,617 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1424968503, now seen corresponding path program 1 times [2019-11-24 06:06:04,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054336940] [2019-11-24 06:06:04,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 06:06:04,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054336940] [2019-11-24 06:06:04,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:04,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:04,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846358870] [2019-11-24 06:06:04,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:04,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:04,677 INFO L87 Difference]: Start difference. First operand 541 states and 746 transitions. Second operand 3 states. [2019-11-24 06:06:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:04,774 INFO L93 Difference]: Finished difference Result 1552 states and 2153 transitions. [2019-11-24 06:06:04,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:04,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:06:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:04,780 INFO L225 Difference]: With dead ends: 1552 [2019-11-24 06:06:04,780 INFO L226 Difference]: Without dead ends: 1015 [2019-11-24 06:06:04,781 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:06:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-24 06:06:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1011. [2019-11-24 06:06:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-24 06:06:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1396 transitions. [2019-11-24 06:06:04,864 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1396 transitions. Word has length 60 [2019-11-24 06:06:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:04,864 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1396 transitions. [2019-11-24 06:06:04,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1396 transitions. [2019-11-24 06:06:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 06:06:04,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:04,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:04,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1693394474, now seen corresponding path program 1 times [2019-11-24 06:06:04,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:04,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117232229] [2019-11-24 06:06:04,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:04,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117232229] [2019-11-24 06:06:04,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:04,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:04,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491139227] [2019-11-24 06:06:04,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:04,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:04,929 INFO L87 Difference]: Start difference. First operand 1011 states and 1396 transitions. Second operand 3 states. [2019-11-24 06:06:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:05,075 INFO L93 Difference]: Finished difference Result 2946 states and 4071 transitions. [2019-11-24 06:06:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:05,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-24 06:06:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:05,089 INFO L225 Difference]: With dead ends: 2946 [2019-11-24 06:06:05,089 INFO L226 Difference]: Without dead ends: 1946 [2019-11-24 06:06:05,092 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:06:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-11-24 06:06:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1840. [2019-11-24 06:06:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-11-24 06:06:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2491 transitions. [2019-11-24 06:06:05,209 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2491 transitions. Word has length 60 [2019-11-24 06:06:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:05,210 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 2491 transitions. [2019-11-24 06:06:05,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2491 transitions. [2019-11-24 06:06:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 06:06:05,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:05,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:05,214 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 439163272, now seen corresponding path program 1 times [2019-11-24 06:06:05,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:05,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970214874] [2019-11-24 06:06:05,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:05,333 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:06:05,333 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:06:05,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:06:05 BoogieIcfgContainer [2019-11-24 06:06:05,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:06:05,433 INFO L168 Benchmark]: Toolchain (without parser) took 5344.47 ms. Allocated memory was 145.8 MB in the beginning and 286.3 MB in the end (delta: 140.5 MB). Free memory was 101.9 MB in the beginning and 130.1 MB in the end (delta: -28.2 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:05,433 INFO L168 Benchmark]: CDTParser took 3.22 ms. Allocated memory is still 145.8 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 06:06:05,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.18 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 180.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:05,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.01 ms. Allocated memory is still 203.4 MB. Free memory was 180.6 MB in the beginning and 177.9 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:06:05,439 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 203.4 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:05,440 INFO L168 Benchmark]: RCFGBuilder took 1476.11 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 175.3 MB in the beginning and 166.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:05,444 INFO L168 Benchmark]: TraceAbstraction took 3310.18 ms. Allocated memory was 235.9 MB in the beginning and 286.3 MB in the end (delta: 50.3 MB). Free memory was 166.4 MB in the beginning and 130.1 MB in the end (delta: 36.3 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:05,451 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.22 ms. Allocated memory is still 145.8 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.18 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 180.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.01 ms. Allocated memory is still 203.4 MB. Free memory was 180.6 MB in the beginning and 177.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 203.4 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1476.11 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 175.3 MB in the beginning and 166.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3310.18 ms. Allocated memory was 235.9 MB in the beginning and 286.3 MB in the end (delta: 50.3 MB). Free memory was 166.4 MB in the beginning and 130.1 MB in the end (delta: 36.3 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 [L211] COND TRUE m_i == 1 [L212] m_st = 0 [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 [L324] COND FALSE !(M_E == 0) [L329] COND FALSE !(T1_E == 0) [L334] COND FALSE !(T2_E == 0) [L339] COND FALSE !(E_1 == 0) [L344] COND FALSE !(E_2 == 0) [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, 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] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, 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] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L181] int __retres1 ; VAL [E_1=2, E_2=2, 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] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, 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] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, 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] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L357] COND FALSE !(M_E == 1) [L362] COND FALSE !(T1_E == 1) [L367] COND FALSE !(T2_E == 1) [L372] COND FALSE !(E_1 == 1) [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, 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] [L518] COND TRUE 1 [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, 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] [L261] COND TRUE 1 [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, 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] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, 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] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, 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] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, 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] [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, 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] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, 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] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, 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] [L124] COND TRUE 1 [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, 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] [L261] COND TRUE 1 [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, 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] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, 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] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, 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] [L48] COND TRUE 1 [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, 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] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, 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] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, 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] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, 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] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 [L181] int __retres1 ; VAL [E_1=1, E_2=2, 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] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, 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] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, 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] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, 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] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L53] E_1 = 2 VAL [E_1=2, E_2=2, 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] [L56] COND TRUE 1 [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, 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] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, 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] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, 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] [L81] COND TRUE t1_pc == 1 [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, 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] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, 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] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, 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] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, 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] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, 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] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, 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] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L181] int __retres1 ; VAL [E_1=2, E_2=1, 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] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, 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] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, 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] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 [L99] E_2 = 2 VAL [E_1=2, E_2=2, 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] [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, 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] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, 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] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, 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] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, 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] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1960 SDtfs, 1153 SDslu, 1499 SDs, 0 SdLazy, 270 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1840occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 822 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 42755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 92/92 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...