/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:07:53,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:07:53,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:07:53,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:07:53,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:07:53,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:07:53,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:07:53,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:07:53,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:07:53,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:07:53,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:07:53,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:07:53,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:07:53,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:07:53,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:07:53,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:07:53,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:07:53,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:07:53,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:07:53,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:07:53,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:07:53,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:07:53,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:07:53,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:07:53,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:07:53,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:07:53,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:07:53,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:07:53,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:07:53,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:07:53,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:07:53,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:07:53,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:07:53,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:07:53,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:07:53,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:07:53,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:07:53,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:07:53,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:07:53,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:07:53,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:07:53,737 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:07:53,800 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:07:53,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:07:53,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:07:53,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:07:53,806 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:07:53,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:07:53,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:07:53,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:07:53,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:07:53,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:07:53,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:07:53,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:07:53,807 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:07:53,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:07:53,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:07:53,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:07:53,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:07:53,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:07:53,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:07:53,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:07:53,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:07:53,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:07:53,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:07:53,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:07:53,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:07:53,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:07:54,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:07:54,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:07:54,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:07:54,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:07:54,384 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:07:54,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-12-22 07:07:54,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4822b448/e30c67fefb0445ca970b6e7b0919ec77/FLAGa52f04571 [2020-12-22 07:07:55,184 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:07:55,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-12-22 07:07:55,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4822b448/e30c67fefb0445ca970b6e7b0919ec77/FLAGa52f04571 [2020-12-22 07:07:55,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4822b448/e30c67fefb0445ca970b6e7b0919ec77 [2020-12-22 07:07:55,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:07:55,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:07:55,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:07:55,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:07:55,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:07:55,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:55,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f96e6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55, skipping insertion in model container [2020-12-22 07:07:55,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:55,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:07:55,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:07:55,816 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2020-12-22 07:07:55,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:07:55,897 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:07:55,910 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2020-12-22 07:07:55,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:07:55,969 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:07:55,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55 WrapperNode [2020-12-22 07:07:55,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:07:55,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:07:55,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:07:55,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:07:55,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:07:56,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:07:56,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:07:56,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:07:56,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (1/1) ... [2020-12-22 07:07:56,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:07:56,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:07:56,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:07:56,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:07:56,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (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 [2020-12-22 07:07:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:07:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:07:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:07:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:07:56,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:07:56,871 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2020-12-22 07:07:56,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:07:56 BoogieIcfgContainer [2020-12-22 07:07:56,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:07:56,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:07:56,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:07:56,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:07:56,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:07:55" (1/3) ... [2020-12-22 07:07:56,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e0b5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:07:56, skipping insertion in model container [2020-12-22 07:07:56,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:07:55" (2/3) ... [2020-12-22 07:07:56,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e0b5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:07:56, skipping insertion in model container [2020-12-22 07:07:56,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:07:56" (3/3) ... [2020-12-22 07:07:56,884 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-12-22 07:07:56,891 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:07:56,897 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 07:07:56,918 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 07:07:56,949 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:07:56,949 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:07:56,949 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:07:56,949 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:07:56,949 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:07:56,950 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:07:56,950 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:07:56,950 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:07:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-12-22 07:07:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:56,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:56,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:56,983 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:56,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-12-22 07:07:57,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:57,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374916683] [2020-12-22 07:07:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:57,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374916683] [2020-12-22 07:07:57,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:57,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:57,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061771586] [2020-12-22 07:07:57,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:07:57,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:07:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:07:57,246 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2020-12-22 07:07:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:57,314 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2020-12-22 07:07:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:07:57,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-22 07:07:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:57,340 INFO L225 Difference]: With dead ends: 291 [2020-12-22 07:07:57,341 INFO L226 Difference]: Without dead ends: 144 [2020-12-22 07:07:57,345 INFO L677 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 [2020-12-22 07:07:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-22 07:07:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-12-22 07:07:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-22 07:07:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2020-12-22 07:07:57,409 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2020-12-22 07:07:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:57,410 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2020-12-22 07:07:57,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:07:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2020-12-22 07:07:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:57,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:57,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:57,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:07:57,413 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-12-22 07:07:57,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:57,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620949835] [2020-12-22 07:07:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:57,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620949835] [2020-12-22 07:07:57,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:57,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:07:57,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706878206] [2020-12-22 07:07:57,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:07:57,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:07:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:07:57,526 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2020-12-22 07:07:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:57,645 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2020-12-22 07:07:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:07:57,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-22 07:07:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:57,649 INFO L225 Difference]: With dead ends: 384 [2020-12-22 07:07:57,650 INFO L226 Difference]: Without dead ends: 246 [2020-12-22 07:07:57,652 INFO L677 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 [2020-12-22 07:07:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-12-22 07:07:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2020-12-22 07:07:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-22 07:07:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2020-12-22 07:07:57,697 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2020-12-22 07:07:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:57,697 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2020-12-22 07:07:57,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:07:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2020-12-22 07:07:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:57,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:57,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:57,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:07:57,700 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-12-22 07:07:57,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:57,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208509206] [2020-12-22 07:07:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:57,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208509206] [2020-12-22 07:07:57,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:57,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:57,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272877892] [2020-12-22 07:07:57,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:07:57,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:07:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:07:57,811 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2020-12-22 07:07:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:57,973 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2020-12-22 07:07:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:07:57,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-22 07:07:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:57,978 INFO L225 Difference]: With dead ends: 578 [2020-12-22 07:07:57,981 INFO L226 Difference]: Without dead ends: 343 [2020-12-22 07:07:57,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:07:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-22 07:07:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2020-12-22 07:07:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-22 07:07:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2020-12-22 07:07:58,052 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2020-12-22 07:07:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:58,052 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2020-12-22 07:07:58,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:07:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2020-12-22 07:07:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:58,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:58,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:58,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:07:58,055 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-12-22 07:07:58,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:58,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023330297] [2020-12-22 07:07:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:58,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023330297] [2020-12-22 07:07:58,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:58,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:07:58,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182822010] [2020-12-22 07:07:58,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:07:58,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:58,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:07:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:07:58,107 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2020-12-22 07:07:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:58,158 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2020-12-22 07:07:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:07:58,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-22 07:07:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:58,161 INFO L225 Difference]: With dead ends: 476 [2020-12-22 07:07:58,161 INFO L226 Difference]: Without dead ends: 242 [2020-12-22 07:07:58,163 INFO L677 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 [2020-12-22 07:07:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-22 07:07:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-12-22 07:07:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-22 07:07:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2020-12-22 07:07:58,190 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2020-12-22 07:07:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:58,191 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2020-12-22 07:07:58,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:07:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2020-12-22 07:07:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:58,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:58,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:58,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:07:58,193 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:58,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-12-22 07:07:58,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:58,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345462333] [2020-12-22 07:07:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:58,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345462333] [2020-12-22 07:07:58,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:58,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:58,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263327502] [2020-12-22 07:07:58,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:07:58,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:07:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:07:58,243 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2020-12-22 07:07:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:58,346 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2020-12-22 07:07:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:07:58,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-22 07:07:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:58,349 INFO L225 Difference]: With dead ends: 560 [2020-12-22 07:07:58,349 INFO L226 Difference]: Without dead ends: 327 [2020-12-22 07:07:58,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:07:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-22 07:07:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2020-12-22 07:07:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-22 07:07:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2020-12-22 07:07:58,372 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2020-12-22 07:07:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:58,373 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2020-12-22 07:07:58,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:07:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2020-12-22 07:07:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 07:07:58,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:58,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:58,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:07:58,375 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-12-22 07:07:58,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:58,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116562294] [2020-12-22 07:07:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:58,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116562294] [2020-12-22 07:07:58,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:58,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:58,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075130852] [2020-12-22 07:07:58,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:07:58,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:07:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:07:58,438 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2020-12-22 07:07:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:58,620 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2020-12-22 07:07:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:07:58,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-22 07:07:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:58,625 INFO L225 Difference]: With dead ends: 820 [2020-12-22 07:07:58,625 INFO L226 Difference]: Without dead ends: 589 [2020-12-22 07:07:58,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:07:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-12-22 07:07:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2020-12-22 07:07:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-12-22 07:07:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2020-12-22 07:07:58,677 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2020-12-22 07:07:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:58,679 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2020-12-22 07:07:58,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:07:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2020-12-22 07:07:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-22 07:07:58,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:58,684 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:58,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:07:58,685 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -251336852, now seen corresponding path program 1 times [2020-12-22 07:07:58,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:58,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687419294] [2020-12-22 07:07:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:07:58,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687419294] [2020-12-22 07:07:58,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:58,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:07:58,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228689530] [2020-12-22 07:07:58,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:07:58,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:07:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:07:58,797 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2020-12-22 07:07:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:58,995 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2020-12-22 07:07:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:07:58,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-12-22 07:07:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:59,003 INFO L225 Difference]: With dead ends: 1379 [2020-12-22 07:07:59,004 INFO L226 Difference]: Without dead ends: 859 [2020-12-22 07:07:59,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:07:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-12-22 07:07:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2020-12-22 07:07:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-12-22 07:07:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2020-12-22 07:07:59,057 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2020-12-22 07:07:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:59,058 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2020-12-22 07:07:59,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:07:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2020-12-22 07:07:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-22 07:07:59,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:59,063 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:59,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:07:59,064 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash 450263022, now seen corresponding path program 1 times [2020-12-22 07:07:59,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:59,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857240301] [2020-12-22 07:07:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 07:07:59,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857240301] [2020-12-22 07:07:59,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:59,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:59,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930594453] [2020-12-22 07:07:59,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:07:59,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:59,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:07:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:07:59,153 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2020-12-22 07:07:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:59,274 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2020-12-22 07:07:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:07:59,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-22 07:07:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:59,279 INFO L225 Difference]: With dead ends: 1340 [2020-12-22 07:07:59,280 INFO L226 Difference]: Without dead ends: 801 [2020-12-22 07:07:59,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:07:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-12-22 07:07:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2020-12-22 07:07:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-12-22 07:07:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2020-12-22 07:07:59,340 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2020-12-22 07:07:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:59,341 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2020-12-22 07:07:59,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:07:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2020-12-22 07:07:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-22 07:07:59,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:59,345 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:59,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:07:59,346 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2020-12-22 07:07:59,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:59,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268516523] [2020-12-22 07:07:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:07:59,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268516523] [2020-12-22 07:07:59,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:59,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:07:59,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781497185] [2020-12-22 07:07:59,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:07:59,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:07:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:07:59,465 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2020-12-22 07:07:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:07:59,598 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2020-12-22 07:07:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:07:59,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-22 07:07:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:07:59,608 INFO L225 Difference]: With dead ends: 1555 [2020-12-22 07:07:59,608 INFO L226 Difference]: Without dead ends: 1018 [2020-12-22 07:07:59,610 INFO L677 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 [2020-12-22 07:07:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-12-22 07:07:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2020-12-22 07:07:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-12-22 07:07:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2020-12-22 07:07:59,706 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2020-12-22 07:07:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:07:59,712 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2020-12-22 07:07:59,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:07:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2020-12-22 07:07:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 07:07:59,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:07:59,714 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:07:59,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:07:59,715 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:07:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:07:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2020-12-22 07:07:59,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:07:59,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294773787] [2020-12-22 07:07:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:07:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:07:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:07:59,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294773787] [2020-12-22 07:07:59,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:07:59,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 07:07:59,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131586244] [2020-12-22 07:07:59,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:07:59,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:07:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:07:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:07:59,814 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2020-12-22 07:08:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:00,000 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2020-12-22 07:08:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:00,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-22 07:08:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:00,016 INFO L225 Difference]: With dead ends: 2328 [2020-12-22 07:08:00,017 INFO L226 Difference]: Without dead ends: 1624 [2020-12-22 07:08:00,019 INFO L677 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 [2020-12-22 07:08:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-12-22 07:08:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2020-12-22 07:08:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-12-22 07:08:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2020-12-22 07:08:00,143 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2020-12-22 07:08:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:00,143 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2020-12-22 07:08:00,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2020-12-22 07:08:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:00,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:00,145 INFO L422 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, 1, 1] [2020-12-22 07:08:00,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:08:00,146 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2020-12-22 07:08:00,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:00,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601367471] [2020-12-22 07:08:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:00,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601367471] [2020-12-22 07:08:00,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:00,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:08:00,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269763574] [2020-12-22 07:08:00,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:08:00,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:08:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:00,241 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2020-12-22 07:08:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:00,476 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2020-12-22 07:08:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:08:00,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-22 07:08:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:00,488 INFO L225 Difference]: With dead ends: 2606 [2020-12-22 07:08:00,488 INFO L226 Difference]: Without dead ends: 1600 [2020-12-22 07:08:00,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:08:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-12-22 07:08:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2020-12-22 07:08:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-12-22 07:08:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2020-12-22 07:08:00,626 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2020-12-22 07:08:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:00,626 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2020-12-22 07:08:00,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:08:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2020-12-22 07:08:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 07:08:00,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:00,628 INFO L422 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, 1, 1] [2020-12-22 07:08:00,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:08:00,629 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2020-12-22 07:08:00,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:00,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591357499] [2020-12-22 07:08:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:00,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591357499] [2020-12-22 07:08:00,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:00,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:00,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041487237] [2020-12-22 07:08:00,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:00,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:00,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:00,708 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2020-12-22 07:08:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:01,012 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2020-12-22 07:08:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:01,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-22 07:08:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:01,027 INFO L225 Difference]: With dead ends: 3754 [2020-12-22 07:08:01,028 INFO L226 Difference]: Without dead ends: 2454 [2020-12-22 07:08:01,031 INFO L677 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 [2020-12-22 07:08:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2020-12-22 07:08:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2020-12-22 07:08:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-22 07:08:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2020-12-22 07:08:01,265 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2020-12-22 07:08:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:01,267 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2020-12-22 07:08:01,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2020-12-22 07:08:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-22 07:08:01,269 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:01,269 INFO L422 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, 1, 1, 1] [2020-12-22 07:08:01,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:08:01,269 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2020-12-22 07:08:01,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:01,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030321498] [2020-12-22 07:08:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:01,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030321498] [2020-12-22 07:08:01,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:01,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:01,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253355520] [2020-12-22 07:08:01,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:01,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:01,335 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2020-12-22 07:08:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:01,598 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2020-12-22 07:08:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:01,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-12-22 07:08:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:01,609 INFO L225 Difference]: With dead ends: 4276 [2020-12-22 07:08:01,609 INFO L226 Difference]: Without dead ends: 1875 [2020-12-22 07:08:01,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-12-22 07:08:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2020-12-22 07:08:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2020-12-22 07:08:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2020-12-22 07:08:01,784 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2020-12-22 07:08:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:01,784 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2020-12-22 07:08:01,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2020-12-22 07:08:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:08:01,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:01,795 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:01,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:08:01,796 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2020-12-22 07:08:01,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:01,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374973801] [2020-12-22 07:08:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:08:01,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374973801] [2020-12-22 07:08:01,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:01,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:01,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346291479] [2020-12-22 07:08:01,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:01,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:01,864 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2020-12-22 07:08:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,110 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2020-12-22 07:08:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:02,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-22 07:08:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,119 INFO L225 Difference]: With dead ends: 3747 [2020-12-22 07:08:02,119 INFO L226 Difference]: Without dead ends: 1634 [2020-12-22 07:08:02,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2020-12-22 07:08:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2020-12-22 07:08:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2020-12-22 07:08:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2020-12-22 07:08:02,252 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2020-12-22 07:08:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,253 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2020-12-22 07:08:02,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2020-12-22 07:08:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:08:02,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,255 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:02,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:08:02,256 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2020-12-22 07:08:02,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674022556] [2020-12-22 07:08:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:02,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674022556] [2020-12-22 07:08:02,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:02,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103335050] [2020-12-22 07:08:02,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:02,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:02,308 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 4 states. [2020-12-22 07:08:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,504 INFO L93 Difference]: Finished difference Result 2614 states and 3137 transitions. [2020-12-22 07:08:02,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:08:02,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-22 07:08:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,508 INFO L225 Difference]: With dead ends: 2614 [2020-12-22 07:08:02,509 INFO L226 Difference]: Without dead ends: 728 [2020-12-22 07:08:02,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:08:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-12-22 07:08:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 716. [2020-12-22 07:08:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-22 07:08:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2020-12-22 07:08:02,597 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2020-12-22 07:08:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,597 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2020-12-22 07:08:02,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2020-12-22 07:08:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:08:02,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,600 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:02,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:08:02,600 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2020-12-22 07:08:02,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547754617] [2020-12-22 07:08:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:08:02,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547754617] [2020-12-22 07:08:02,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:02,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396385882] [2020-12-22 07:08:02,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:02,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:02,664 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2020-12-22 07:08:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:02,743 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2020-12-22 07:08:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:02,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-22 07:08:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:02,747 INFO L225 Difference]: With dead ends: 1048 [2020-12-22 07:08:02,747 INFO L226 Difference]: Without dead ends: 594 [2020-12-22 07:08:02,749 INFO L677 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 [2020-12-22 07:08:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-12-22 07:08:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2020-12-22 07:08:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-22 07:08:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2020-12-22 07:08:02,800 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2020-12-22 07:08:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:02,800 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2020-12-22 07:08:02,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2020-12-22 07:08:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:08:02,802 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:02,802 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:02,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:08:02,803 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2020-12-22 07:08:02,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:02,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140264110] [2020-12-22 07:08:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 07:08:02,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140264110] [2020-12-22 07:08:02,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:02,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:08:02,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139863232] [2020-12-22 07:08:02,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:08:02,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:08:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:02,912 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2020-12-22 07:08:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:03,011 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2020-12-22 07:08:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:08:03,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-22 07:08:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:03,016 INFO L225 Difference]: With dead ends: 598 [2020-12-22 07:08:03,016 INFO L226 Difference]: Without dead ends: 596 [2020-12-22 07:08:03,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:08:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-12-22 07:08:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2020-12-22 07:08:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-12-22 07:08:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2020-12-22 07:08:03,114 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2020-12-22 07:08:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:03,114 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2020-12-22 07:08:03,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:08:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2020-12-22 07:08:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-22 07:08:03,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:03,116 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:03,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:08:03,117 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2020-12-22 07:08:03,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:03,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788442144] [2020-12-22 07:08:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:08:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 07:08:03,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788442144] [2020-12-22 07:08:03,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:08:03,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:08:03,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098361542] [2020-12-22 07:08:03,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:08:03,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:08:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:08:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:08:03,192 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2020-12-22 07:08:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:08:03,306 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2020-12-22 07:08:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:08:03,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-22 07:08:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:08:03,312 INFO L225 Difference]: With dead ends: 1230 [2020-12-22 07:08:03,313 INFO L226 Difference]: Without dead ends: 900 [2020-12-22 07:08:03,314 INFO L677 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 [2020-12-22 07:08:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-12-22 07:08:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2020-12-22 07:08:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-22 07:08:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2020-12-22 07:08:03,387 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2020-12-22 07:08:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:08:03,387 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2020-12-22 07:08:03,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:08:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2020-12-22 07:08:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-22 07:08:03,389 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:08:03,389 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:08:03,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:08:03,390 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:08:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:08:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2020-12-22 07:08:03,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:08:03,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474258098] [2020-12-22 07:08:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:08:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:08:03,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:08:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:08:03,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:08:03,470 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:08:03,470 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:08:03,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:08:03,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:08:03 BoogieIcfgContainer [2020-12-22 07:08:03,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:08:03,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:08:03,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:08:03,614 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:08:03,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:07:56" (3/4) ... [2020-12-22 07:08:03,618 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:08:03,817 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.01.cil-2.c-witness.graphml [2020-12-22 07:08:03,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:08:03,820 INFO L168 Benchmark]: Toolchain (without parser) took 8267.65 ms. Allocated memory was 151.0 MB in the beginning and 275.8 MB in the end (delta: 124.8 MB). Free memory was 126.3 MB in the beginning and 132.2 MB in the end (delta: -5.8 MB). Peak memory consumption was 119.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,820 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:08:03,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.21 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 113.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 151.0 MB. Free memory was 113.3 MB in the beginning and 110.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,822 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 151.0 MB. Free memory was 110.7 MB in the beginning and 108.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,823 INFO L168 Benchmark]: RCFGBuilder took 785.19 ms. Allocated memory is still 151.0 MB. Free memory was 108.6 MB in the beginning and 100.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,823 INFO L168 Benchmark]: TraceAbstraction took 6736.83 ms. Allocated memory was 151.0 MB in the beginning and 275.8 MB in the end (delta: 124.8 MB). Free memory was 99.9 MB in the beginning and 145.3 MB in the end (delta: -45.4 MB). Peak memory consumption was 80.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,823 INFO L168 Benchmark]: Witness Printer took 203.50 ms. Allocated memory is still 275.8 MB. Free memory was 145.3 MB in the beginning and 132.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:08:03,829 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 414.21 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 113.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 151.0 MB. Free memory was 113.3 MB in the beginning and 110.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 151.0 MB. Free memory was 110.7 MB in the beginning and 108.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 785.19 ms. Allocated memory is still 151.0 MB. Free memory was 108.6 MB in the beginning and 100.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6736.83 ms. Allocated memory was 151.0 MB in the beginning and 275.8 MB in the end (delta: 124.8 MB). Free memory was 99.9 MB in the beginning and 145.3 MB in the end (delta: -45.4 MB). Peak memory consumption was 80.5 MB. Max. memory is 8.0 GB. * Witness Printer took 203.50 ms. Allocated memory is still 275.8 MB. Free memory was 145.3 MB in the beginning and 132.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=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, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=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, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=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, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=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, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=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, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=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, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=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, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=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, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=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, token=0] [L138] __retres1 = 0 VAL [E_1=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, token=0] [L140] return (__retres1); VAL [E_1=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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=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, token=0] [L144] int __retres1 ; VAL [E_1=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, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=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, token=0] [L157] __retres1 = 0 VAL [E_1=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, token=0] [L159] return (__retres1); VAL [E_1=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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=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, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=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, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=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, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=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, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=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, token=0] [L432] COND TRUE 1 VAL [E_1=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, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=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, token=0] [L214] COND TRUE 1 VAL [E_1=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, token=0] [L189] int __retres1 ; VAL [E_1=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, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=0] [L205] return (__retres1); VAL [E_1=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, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=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, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=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, token=0] [L103] COND TRUE 1 VAL [E_1=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, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=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, token=0] [L214] COND TRUE 1 VAL [E_1=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, token=0] [L189] int __retres1 ; VAL [E_1=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, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=0] [L205] return (__retres1); VAL [E_1=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, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=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, token=0] [L47] COND TRUE 1 VAL [E_1=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, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, 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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, 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, token=0] [L138] __retres1 = 0 VAL [E_1=1, 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, token=0] [L140] return (__retres1); VAL [E_1=1, 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, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, 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, token=0] [L144] int __retres1 ; VAL [E_1=1, 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, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, 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, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, 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, token=0] [L159] return (__retres1); VAL [E_1=1, 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, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, 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, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=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, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=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, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=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, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=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, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=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=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=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=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=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=1, token=1] [L140] return (__retres1); VAL [E_1=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=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=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=1, token=1] [L144] int __retres1 ; VAL [E_1=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=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=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=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=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=1, token=1] [L157] __retres1 = 0 VAL [E_1=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=1, token=1] [L159] return (__retres1); VAL [E_1=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=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=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=1, token=1] [L114] E_M = 2 VAL [E_1=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=1, token=1] [L103] COND TRUE 1 VAL [E_1=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=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=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, token=1] [L214] COND TRUE 1 VAL [E_1=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, token=1] [L189] int __retres1 ; VAL [E_1=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, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=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, token=1] [L205] return (__retres1); VAL [E_1=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, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=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, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=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, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=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, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=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, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=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, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=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, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=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, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=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, token=1] [L12] reach_error() VAL [E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.5s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3984 SDtfs, 5328 SDslu, 3898 SDs, 0 SdLazy, 453 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred 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: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...