/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 02:16:37,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 02:16:37,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 02:16:37,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 02:16:37,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 02:16:37,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 02:16:37,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 02:16:37,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 02:16:37,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 02:16:37,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 02:16:37,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 02:16:37,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 02:16:37,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 02:16:37,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 02:16:37,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 02:16:37,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 02:16:37,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 02:16:37,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 02:16:37,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 02:16:37,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 02:16:37,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 02:16:37,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 02:16:37,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 02:16:37,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 02:16:37,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 02:16:37,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 02:16:37,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 02:16:37,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 02:16:37,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 02:16:37,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 02:16:37,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 02:16:37,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 02:16:37,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 02:16:37,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 02:16:37,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 02:16:37,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 02:16:37,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 02:16:37,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 02:16:37,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 02:16:37,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 02:16:37,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 02:16:37,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 02:16:37,736 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 02:16:37,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 02:16:37,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 02:16:37,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 02:16:37,738 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 02:16:37,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 02:16:37,738 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 02:16:37,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 02:16:37,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 02:16:37,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 02:16:37,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 02:16:37,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 02:16:37,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 02:16:37,739 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 02:16:37,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 02:16:37,740 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 02:16:37,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 02:16:37,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 02:16:37,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 02:16:37,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 02:16:37,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 02:16:37,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 02:16:37,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 02:16:37,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 02:16:37,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 02:16:37,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 02:16:37,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:37,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 02:16:37,742 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 02:16:37,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 02:16:38,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 02:16:38,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 02:16:38,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 02:16:38,065 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 02:16:38,066 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 02:16:38,066 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 02:16:38,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf1d46ce/cd322818545e45b1afa7a07c1ea5903d/FLAGc4c2d4840 [2020-07-21 02:16:38,628 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 02:16:38,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 02:16:38,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf1d46ce/cd322818545e45b1afa7a07c1ea5903d/FLAGc4c2d4840 [2020-07-21 02:16:38,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf1d46ce/cd322818545e45b1afa7a07c1ea5903d [2020-07-21 02:16:38,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 02:16:38,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 02:16:38,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 02:16:38,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 02:16:38,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 02:16:38,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:16:38" (1/1) ... [2020-07-21 02:16:38,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb8bbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:38, skipping insertion in model container [2020-07-21 02:16:38,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:16:38" (1/1) ... [2020-07-21 02:16:39,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 02:16:39,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 02:16:39,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:16:39,244 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 02:16:39,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:16:39,313 INFO L208 MainTranslator]: Completed translation [2020-07-21 02:16:39,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39 WrapperNode [2020-07-21 02:16:39,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 02:16:39,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 02:16:39,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 02:16:39,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 02:16:39,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (1/1) ... [2020-07-21 02:16:39,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 02:16:39,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 02:16:39,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 02:16:39,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 02:16:39,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (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-07-21 02:16:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 02:16:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 02:16:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 02:16:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 02:16:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 02:16:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 02:16:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 02:16:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 02:16:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 02:16:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 02:16:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 02:16:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 02:16:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 02:16:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 02:16:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 02:16:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 02:16:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 02:16:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 02:16:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 02:16:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 02:16:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 02:16:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 02:16:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 02:16:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 02:16:40,063 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 02:16:40,063 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 02:16:40,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:16:40 BoogieIcfgContainer [2020-07-21 02:16:40,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 02:16:40,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 02:16:40,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 02:16:40,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 02:16:40,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:16:38" (1/3) ... [2020-07-21 02:16:40,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f73e0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:16:40, skipping insertion in model container [2020-07-21 02:16:40,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:16:39" (2/3) ... [2020-07-21 02:16:40,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f73e0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:16:40, skipping insertion in model container [2020-07-21 02:16:40,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:16:40" (3/3) ... [2020-07-21 02:16:40,078 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-21 02:16:40,089 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 02:16:40,097 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 02:16:40,111 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 02:16:40,139 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 02:16:40,139 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 02:16:40,139 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 02:16:40,140 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 02:16:40,140 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 02:16:40,140 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 02:16:40,140 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 02:16:40,141 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 02:16:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-21 02:16:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:40,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:40,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:40,179 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-21 02:16:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:40,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476439945] [2020-07-21 02:16:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:40,355 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:16:40,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:40,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 02:16:40,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:40,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:40,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476439945] [2020-07-21 02:16:40,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 02:16:40,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719485253] [2020-07-21 02:16:40,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 02:16:40,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 02:16:40,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 02:16:40,501 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2020-07-21 02:16:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:41,165 INFO L93 Difference]: Finished difference Result 328 states and 479 transitions. [2020-07-21 02:16:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 02:16:41,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 02:16:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:41,183 INFO L225 Difference]: With dead ends: 328 [2020-07-21 02:16:41,184 INFO L226 Difference]: Without dead ends: 191 [2020-07-21 02:16:41,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 02:16:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-07-21 02:16:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2020-07-21 02:16:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-21 02:16:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2020-07-21 02:16:41,264 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 77 [2020-07-21 02:16:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:41,265 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2020-07-21 02:16:41,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 02:16:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2020-07-21 02:16:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:41,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:41,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:41,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:41,483 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-21 02:16:41,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:41,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102869338] [2020-07-21 02:16:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:41,575 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:16:41,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:41,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 02:16:41,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:41,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:41,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102869338] [2020-07-21 02:16:41,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:41,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 02:16:41,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27881124] [2020-07-21 02:16:41,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 02:16:41,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 02:16:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 02:16:41,622 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand 5 states. [2020-07-21 02:16:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:42,239 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2020-07-21 02:16:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 02:16:42,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 02:16:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:42,248 INFO L225 Difference]: With dead ends: 459 [2020-07-21 02:16:42,251 INFO L226 Difference]: Without dead ends: 317 [2020-07-21 02:16:42,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 02:16:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-07-21 02:16:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2020-07-21 02:16:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-21 02:16:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 369 transitions. [2020-07-21 02:16:42,332 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 369 transitions. Word has length 77 [2020-07-21 02:16:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:42,333 INFO L479 AbstractCegarLoop]: Abstraction has 291 states and 369 transitions. [2020-07-21 02:16:42,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 02:16:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 369 transitions. [2020-07-21 02:16:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:42,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:42,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:42,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:42,544 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-21 02:16:42,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:42,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496433056] [2020-07-21 02:16:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:42,619 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:16:42,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:42,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 02:16:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:42,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:42,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496433056] [2020-07-21 02:16:42,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:42,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 02:16:42,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018314793] [2020-07-21 02:16:42,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 02:16:42,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 02:16:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 02:16:42,676 INFO L87 Difference]: Start difference. First operand 291 states and 369 transitions. Second operand 5 states. [2020-07-21 02:16:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:43,024 INFO L93 Difference]: Finished difference Result 563 states and 724 transitions. [2020-07-21 02:16:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 02:16:43,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 02:16:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:43,027 INFO L225 Difference]: With dead ends: 563 [2020-07-21 02:16:43,028 INFO L226 Difference]: Without dead ends: 291 [2020-07-21 02:16:43,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 02:16:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-21 02:16:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-07-21 02:16:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-21 02:16:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 363 transitions. [2020-07-21 02:16:43,058 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 363 transitions. Word has length 77 [2020-07-21 02:16:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:43,059 INFO L479 AbstractCegarLoop]: Abstraction has 291 states and 363 transitions. [2020-07-21 02:16:43,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 02:16:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 363 transitions. [2020-07-21 02:16:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:43,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:43,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:43,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:43,276 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-21 02:16:43,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:43,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530240768] [2020-07-21 02:16:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:43,341 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:16:43,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:43,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 02:16:43,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:43,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:43,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530240768] [2020-07-21 02:16:43,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:43,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 02:16:43,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941673690] [2020-07-21 02:16:43,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 02:16:43,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 02:16:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 02:16:43,383 INFO L87 Difference]: Start difference. First operand 291 states and 363 transitions. Second operand 6 states. [2020-07-21 02:16:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:43,432 INFO L93 Difference]: Finished difference Result 602 states and 775 transitions. [2020-07-21 02:16:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 02:16:43,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-21 02:16:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:43,436 INFO L225 Difference]: With dead ends: 602 [2020-07-21 02:16:43,437 INFO L226 Difference]: Without dead ends: 331 [2020-07-21 02:16:43,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 02:16:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-07-21 02:16:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 311. [2020-07-21 02:16:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-07-21 02:16:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 383 transitions. [2020-07-21 02:16:43,468 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 383 transitions. Word has length 77 [2020-07-21 02:16:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:43,469 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 383 transitions. [2020-07-21 02:16:43,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 02:16:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 383 transitions. [2020-07-21 02:16:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:43,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:43,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:43,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:43,685 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-07-21 02:16:43,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:43,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [447485047] [2020-07-21 02:16:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:43,781 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:16:43,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:43,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 02:16:43,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:43,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:43,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [447485047] [2020-07-21 02:16:43,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:43,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 02:16:43,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894998896] [2020-07-21 02:16:43,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 02:16:43,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 02:16:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 02:16:43,867 INFO L87 Difference]: Start difference. First operand 311 states and 383 transitions. Second operand 5 states. [2020-07-21 02:16:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:44,352 INFO L93 Difference]: Finished difference Result 732 states and 960 transitions. [2020-07-21 02:16:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 02:16:44,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 02:16:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:44,360 INFO L225 Difference]: With dead ends: 732 [2020-07-21 02:16:44,360 INFO L226 Difference]: Without dead ends: 440 [2020-07-21 02:16:44,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 02:16:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-07-21 02:16:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 347. [2020-07-21 02:16:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-07-21 02:16:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 413 transitions. [2020-07-21 02:16:44,423 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 413 transitions. Word has length 77 [2020-07-21 02:16:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:44,423 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 413 transitions. [2020-07-21 02:16:44,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 02:16:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 413 transitions. [2020-07-21 02:16:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:44,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:44,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:44,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:44,630 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -472732083, now seen corresponding path program 1 times [2020-07-21 02:16:44,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:44,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583295597] [2020-07-21 02:16:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:44,704 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:16:44,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:44,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 02:16:44,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:44,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:44,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583295597] [2020-07-21 02:16:44,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:44,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 02:16:44,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877774297] [2020-07-21 02:16:44,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 02:16:44,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 02:16:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 02:16:44,740 INFO L87 Difference]: Start difference. First operand 347 states and 413 transitions. Second operand 6 states. [2020-07-21 02:16:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:44,785 INFO L93 Difference]: Finished difference Result 688 states and 835 transitions. [2020-07-21 02:16:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 02:16:44,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-21 02:16:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:44,789 INFO L225 Difference]: With dead ends: 688 [2020-07-21 02:16:44,789 INFO L226 Difference]: Without dead ends: 361 [2020-07-21 02:16:44,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 02:16:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-07-21 02:16:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2020-07-21 02:16:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-07-21 02:16:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 419 transitions. [2020-07-21 02:16:44,817 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 419 transitions. Word has length 77 [2020-07-21 02:16:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:44,817 INFO L479 AbstractCegarLoop]: Abstraction has 357 states and 419 transitions. [2020-07-21 02:16:44,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 02:16:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 419 transitions. [2020-07-21 02:16:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 02:16:44,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:44,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:45,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:45,034 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-21 02:16:45,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:45,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553074158] [2020-07-21 02:16:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:45,121 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:16:45,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:45,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 02:16:45,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:16:45,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:45,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553074158] [2020-07-21 02:16:45,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:45,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:45,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217737815] [2020-07-21 02:16:45,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:45,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:45,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:45,172 INFO L87 Difference]: Start difference. First operand 357 states and 419 transitions. Second operand 3 states. [2020-07-21 02:16:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:45,230 INFO L93 Difference]: Finished difference Result 1005 states and 1209 transitions. [2020-07-21 02:16:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:45,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 02:16:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:45,237 INFO L225 Difference]: With dead ends: 1005 [2020-07-21 02:16:45,237 INFO L226 Difference]: Without dead ends: 668 [2020-07-21 02:16:45,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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-07-21 02:16:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-07-21 02:16:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2020-07-21 02:16:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2020-07-21 02:16:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2020-07-21 02:16:45,296 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 77 [2020-07-21 02:16:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:45,297 INFO L479 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2020-07-21 02:16:45,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2020-07-21 02:16:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 02:16:45,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:45,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:45,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:45,514 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:45,515 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-07-21 02:16:45,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:45,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82641625] [2020-07-21 02:16:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:45,622 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:16:45,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:45,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 02:16:45,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 02:16:45,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:45,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82641625] [2020-07-21 02:16:45,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:45,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:45,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096578601] [2020-07-21 02:16:45,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:45,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:45,679 INFO L87 Difference]: Start difference. First operand 666 states and 775 transitions. Second operand 3 states. [2020-07-21 02:16:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:45,774 INFO L93 Difference]: Finished difference Result 1797 states and 2146 transitions. [2020-07-21 02:16:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:45,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 02:16:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:45,782 INFO L225 Difference]: With dead ends: 1797 [2020-07-21 02:16:45,782 INFO L226 Difference]: Without dead ends: 1151 [2020-07-21 02:16:45,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2020-07-21 02:16:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1140. [2020-07-21 02:16:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2020-07-21 02:16:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1333 transitions. [2020-07-21 02:16:45,869 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1333 transitions. Word has length 121 [2020-07-21 02:16:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:45,870 INFO L479 AbstractCegarLoop]: Abstraction has 1140 states and 1333 transitions. [2020-07-21 02:16:45,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1333 transitions. [2020-07-21 02:16:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 02:16:45,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:45,875 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:46,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:46,089 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2020-07-21 02:16:46,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:46,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452292963] [2020-07-21 02:16:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:46,180 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:16:46,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:46,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 02:16:46,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-21 02:16:46,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:46,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452292963] [2020-07-21 02:16:46,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:46,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:46,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204225138] [2020-07-21 02:16:46,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:46,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:46,221 INFO L87 Difference]: Start difference. First operand 1140 states and 1333 transitions. Second operand 3 states. [2020-07-21 02:16:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:46,370 INFO L93 Difference]: Finished difference Result 2852 states and 3403 transitions. [2020-07-21 02:16:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:46,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 02:16:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:46,380 INFO L225 Difference]: With dead ends: 2852 [2020-07-21 02:16:46,380 INFO L226 Difference]: Without dead ends: 1323 [2020-07-21 02:16:46,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2020-07-21 02:16:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2020-07-21 02:16:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2020-07-21 02:16:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1552 transitions. [2020-07-21 02:16:46,471 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1552 transitions. Word has length 121 [2020-07-21 02:16:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:46,472 INFO L479 AbstractCegarLoop]: Abstraction has 1323 states and 1552 transitions. [2020-07-21 02:16:46,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1552 transitions. [2020-07-21 02:16:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 02:16:46,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:46,477 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:46,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:46,690 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-21 02:16:46,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:46,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211695680] [2020-07-21 02:16:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:46,802 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:16:46,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:46,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 02:16:46,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-21 02:16:46,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:46,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211695680] [2020-07-21 02:16:46,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:46,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:46,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708535068] [2020-07-21 02:16:46,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:46,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:46,847 INFO L87 Difference]: Start difference. First operand 1323 states and 1552 transitions. Second operand 3 states. [2020-07-21 02:16:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:46,945 INFO L93 Difference]: Finished difference Result 2619 states and 3118 transitions. [2020-07-21 02:16:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:46,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 02:16:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:46,954 INFO L225 Difference]: With dead ends: 2619 [2020-07-21 02:16:46,954 INFO L226 Difference]: Without dead ends: 1317 [2020-07-21 02:16:46,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 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-07-21 02:16:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2020-07-21 02:16:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2020-07-21 02:16:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2020-07-21 02:16:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1528 transitions. [2020-07-21 02:16:47,044 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1528 transitions. Word has length 174 [2020-07-21 02:16:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:47,045 INFO L479 AbstractCegarLoop]: Abstraction has 1317 states and 1528 transitions. [2020-07-21 02:16:47,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1528 transitions. [2020-07-21 02:16:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 02:16:47,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:47,050 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:47,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:47,264 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-21 02:16:47,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:47,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937715812] [2020-07-21 02:16:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:47,398 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:16:47,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:47,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 02:16:47,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-21 02:16:47,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:47,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937715812] [2020-07-21 02:16:47,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:47,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:47,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281877120] [2020-07-21 02:16:47,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:47,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:47,434 INFO L87 Difference]: Start difference. First operand 1317 states and 1528 transitions. Second operand 3 states. [2020-07-21 02:16:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:47,534 INFO L93 Difference]: Finished difference Result 3085 states and 3612 transitions. [2020-07-21 02:16:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:47,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 02:16:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:47,541 INFO L225 Difference]: With dead ends: 3085 [2020-07-21 02:16:47,541 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 02:16:47,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 02:16:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 02:16:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 02:16:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1013 transitions. [2020-07-21 02:16:47,614 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1013 transitions. Word has length 175 [2020-07-21 02:16:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:47,614 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1013 transitions. [2020-07-21 02:16:47,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1013 transitions. [2020-07-21 02:16:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 02:16:47,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:47,620 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:47,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:47,836 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-21 02:16:47,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:47,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910378048] [2020-07-21 02:16:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:47,962 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:16:47,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:47,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 02:16:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-21 02:16:48,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:16:48,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910378048] [2020-07-21 02:16:48,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:16:48,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:16:48,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664576347] [2020-07-21 02:16:48,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:16:48,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:16:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:16:48,005 INFO L87 Difference]: Start difference. First operand 896 states and 1013 transitions. Second operand 3 states. [2020-07-21 02:16:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:48,078 INFO L93 Difference]: Finished difference Result 1594 states and 1836 transitions. [2020-07-21 02:16:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:16:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 02:16:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:48,085 INFO L225 Difference]: With dead ends: 1594 [2020-07-21 02:16:48,086 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 02:16:48,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-07-21 02:16:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 02:16:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 02:16:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 02:16:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-21 02:16:48,144 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 175 [2020-07-21 02:16:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:48,144 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-21 02:16:48,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:16:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-21 02:16:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 02:16:48,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:16:48,148 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 02:16:48,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:48,362 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:16:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:16:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-21 02:16:48,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:16:48,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191780434] [2020-07-21 02:16:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:48,473 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:16:48,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:16:48,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 02:16:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:16:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 02:16:48,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:16:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-21 02:16:48,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191780434] [2020-07-21 02:16:48,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 02:16:48,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-21 02:16:48,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094915417] [2020-07-21 02:16:48,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 02:16:48,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:16:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 02:16:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 02:16:48,791 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-21 02:16:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:16:49,328 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-21 02:16:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 02:16:49,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 02:16:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:16:49,330 INFO L225 Difference]: With dead ends: 920 [2020-07-21 02:16:49,331 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 02:16:49,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 02:16:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 02:16:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 02:16:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 02:16:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 02:16:49,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-21 02:16:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:16:49,335 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 02:16:49,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 02:16:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 02:16:49,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 02:16:49,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:16:49,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 02:16:49,696 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-21 02:16:52,143 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 02:16:52,598 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 47 [2020-07-21 02:16:52,889 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:53,151 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:53,433 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:53,803 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:54,081 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:54,431 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:55,009 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-07-21 02:16:55,371 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:55,932 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2020-07-21 02:16:56,202 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:56,775 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-21 02:16:57,292 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2020-07-21 02:16:57,740 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-21 02:16:58,008 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:16:58,850 WARN L193 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2020-07-21 02:16:58,993 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-21 02:16:59,272 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2020-07-21 02:16:59,432 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 02:17:00,237 WARN L193 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2020-07-21 02:17:00,498 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-21 02:17:00,768 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:17:01,616 WARN L193 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2020-07-21 02:17:01,925 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-07-21 02:17:02,384 WARN L193 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-21 02:17:02,618 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-21 02:17:02,826 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-21 02:17:03,070 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 02:17:03,666 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2020-07-21 02:17:03,844 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-07-21 02:17:04,194 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-07-21 02:17:04,601 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-21 02:17:04,874 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-07-21 02:17:05,532 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-21 02:17:05,903 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-07-21 02:17:06,270 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-21 02:17:06,459 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-07-21 02:17:06,684 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-07-21 02:17:06,984 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-07-21 02:17:07,038 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-21 02:17:07,038 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse4 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (<= 2 ~m_st~0)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 (not (<= ~t1_pc~0 0)) .cse4) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse8 .cse1 .cse2 .cse3) (or .cse8 .cse5 .cse6 .cse1 (not (= ~token~0 ~local~0)) .cse7))) [2020-07-21 02:17:07,038 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-21 02:17:07,038 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0))) (let ((.cse8 (and .cse11 .cse2 .cse3)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse11)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse10 (not (= |old(~token~0)| ~local~0))) (.cse9 (= 0 ~m_st~0)) (.cse6 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse8 .cse5) (or .cse0 .cse1 (and .cse9 (= 1 ~t1_pc~0) .cse2 (= ~token~0 (+ ~local~0 1))) .cse4 .cse10 .cse8 .cse5 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) .cse4 .cse10 (and .cse9 .cse2 (= ~token~0 ~local~0)) .cse6)))) [2020-07-21 02:17:07,039 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-21 02:17:07,039 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse2 (= ~token~0 ~local~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse3 .cse4) .cse5 .cse7 .cse8) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse9) .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse8) (or .cse0 .cse1 (and .cse3 .cse9 .cse4) .cse10 .cse5 .cse7))) [2020-07-21 02:17:07,039 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-21 02:17:07,039 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= 2 ~m_st~0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) .cse5 .cse6) .cse3 .cse7 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse5 .cse6) .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse7 .cse8))) [2020-07-21 02:17:07,039 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-21 02:17:07,039 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~m_st~0))) (let ((.cse8 (and .cse2 .cse11 .cse3)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse9 (= 0 ~m_st~0)) (.cse10 (= 1 ~t1_pc~0)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse12 (not (= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse8 .cse5) (or .cse0 (and .cse9 .cse10 .cse2 .cse11 (= ~token~0 (+ ~local~0 1))) .cse1 .cse4 .cse12 .cse8 .cse5 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 (and .cse9 .cse10 .cse2 .cse11 (= ~token~0 ~local~0)) .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) .cse4 .cse12 .cse6)))) [2020-07-21 02:17:07,040 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) .cse5) .cse3 .cse6 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 .cse7))) [2020-07-21 02:17:07,040 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-21 02:17:07,040 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-21 02:17:07,040 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-21 02:17:07,040 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-21 02:17:07,040 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-21 02:17:07,040 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-21 02:17:07,041 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse13 (not (= ~token~0 (+ ~local~0 1)))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (<= 2 ~m_st~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse0 (= 0 ~m_st~0)) (.cse3 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse12 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse4 .cse6 .cse9 .cse10 .cse11) (or .cse1 .cse6 .cse10 .cse11 .cse8) (or .cse1 .cse4 .cse5 .cse6 .cse10 (and .cse12 .cse11)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 (and .cse0 .cse12) .cse6) (or .cse4 .cse5 .cse6 .cse12 .cse9 .cse8) (or .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8) (or .cse1 .cse0 .cse13 .cse2 .cse6 .cse10 .cse11) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse10 .cse11) (or .cse1 .cse0 .cse3 .cse4 .cse6 .cse7 .cse9 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse7 .cse12))) [2020-07-21 02:17:07,041 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-21 02:17:07,041 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-21 02:17:07,041 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-21 02:17:07,042 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-21 02:17:07,042 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-21 02:17:07,042 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-21 02:17:07,043 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse3 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (<= ~t1_pc~0 0)) .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse0 (not (<= 2 ~t1_st~0)) .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3) (or .cse4 (not (<= 2 ~m_st~0)) .cse1 .cse2) (or .cse4 (not (= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse1 .cse2))) [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 02:17:07,043 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 02:17:07,044 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 02:17:07,044 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-21 02:17:07,044 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-21 02:17:07,044 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-21 02:17:07,044 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-21 02:17:07,045 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-21 02:17:07,045 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 0 ~m_st~0) (not (= 0 |old(~m_st~0)|)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (= ~token~0 ~local~0)) (not (<= ~t1_pc~0 0)) (not (<= ~m_pc~0 0))) [2020-07-21 02:17:07,045 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-21 02:17:07,045 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,048 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-21 02:17:07,048 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-21 02:17:07,049 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-21 02:17:07,049 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,049 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,049 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-21 02:17:07,049 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-21 02:17:07,050 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-21 02:17:07,053 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-21 02:17:07,053 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-21 02:17:07,053 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-21 02:17:07,053 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-21 02:17:07,054 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~E_1~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse8 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse3 (and .cse7 .cse11 .cse8)) (.cse6 (and .cse7 .cse12 .cse13 (= ~token~0 ~local~0) .cse8)) (.cse1 (not .cse13)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse12)) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6) (or (and .cse7 .cse8) .cse1 .cse4 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse9 .cse5 .cse11 .cse10)))) [2020-07-21 02:17:07,054 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-21 02:17:07,054 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-21 02:17:07,054 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (<= 2 ~t1_st~0)) (.cse5 (<= ~m_pc~0 0)) (.cse9 (= ~token~0 ~local~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse7 .cse1 .cse3 (and .cse8 .cse9)) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 .cse4) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse6 .cse0 .cse7 (and .cse8 .cse5 .cse9) .cse1 .cse2 .cse3))) [2020-07-21 02:17:07,054 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-21 02:17:07,055 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-21 02:17:07,055 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-21 02:17:07,055 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-21 02:17:07,055 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (= ~token~0 ~local~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (<= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse8 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse4 .cse5 .cse10 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse8 .cse4 .cse10 .cse6 .cse9) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse7 .cse2 .cse8 .cse4 .cse6))) [2020-07-21 02:17:07,055 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-21 02:17:07,055 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 02:17:07,056 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (not (= |old(~token~0)| ~local~0)) (= ~token~0 ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0)) [2020-07-21 02:17:07,056 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 02:17:07,056 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse15 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= ~m_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse4 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 (and .cse3 .cse4 .cse9 .cse5) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse2 .cse3 .cse14 .cse4 .cse9)) (or .cse0 .cse11 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse6 .cse7 (and .cse13 .cse15 (not (= |old(~token~0)| ~local~0)) .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) .cse16) (or .cse17 .cse0 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse15 .cse2 .cse3 .cse14 .cse18 .cse4) .cse16) (or .cse0 .cse6 .cse12 .cse7 .cse8 (and .cse3 .cse14 .cse4 .cse5)) (or .cse17 .cse0 .cse6 .cse7 .cse8 .cse16 (and .cse15 .cse3 .cse18 .cse4 .cse5)) (or .cse17 .cse0 .cse10 .cse11 .cse6 .cse12 .cse7 (and .cse13 .cse3 .cse14 .cse18 .cse4 .cse9)))) [2020-07-21 02:17:07,056 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-21 02:17:07,056 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-21 02:17:07,056 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-21 02:17:07,057 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-21 02:17:07,057 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (<= 2 ~T1_E~0)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse23 (<= 2 ~m_st~0))) (let ((.cse6 (and .cse16 .cse17 .cse18 .cse20 .cse23)) (.cse21 (and .cse16 .cse24 .cse18 .cse20 .cse23)) (.cse14 (and .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse22)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (and .cse15 .cse16 .cse25 .cse17 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse10 (and .cse16 .cse24 .cse25 .cse18 .cse22 .cse23)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (and .cse16 .cse17 .cse18 .cse23)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not .cse24)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse12 .cse5) (or .cse0 .cse1 .cse9 .cse2 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse3 .cse11 .cse4 .cse6) (or .cse7 .cse8 .cse0 .cse10 .cse3 .cse4 .cse12 .cse5 .cse13) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse12 .cse5) (or .cse21 .cse11 .cse4 (and .cse15 .cse16 .cse18 .cse19 .cse22 .cse20) .cse14 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse3 .cse12) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse12 .cse13) (or (and .cse16 .cse18 .cse19 .cse23) .cse0 .cse3 .cse11 .cse4 .cse5)))) [2020-07-21 02:17:07,057 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse15 (= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse18 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse0 (and .cse12 .cse18 .cse13 .cse16 .cse17)) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse7 (and .cse12 .cse18 (= 1 ~t1_pc~0) .cse13 .cse15 .cse17)) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse14 (<= ~m_pc~0 0)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not .cse18)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse8 .cse3 .cse4 .cse9) (or .cse1 .cse2 .cse6 .cse8 .cse3 .cse10 .cse4) (or .cse1 .cse8 .cse3 .cse4 .cse5) (or .cse11 .cse0 .cse1 .cse2 .cse6 .cse7 .cse3 .cse10 .cse4 (and (= 0 ~m_st~0) .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse11 .cse1 .cse6 .cse7 .cse8 .cse3 .cse10 .cse4 .cse9) (or .cse11 .cse1 .cse7 .cse3 .cse4 .cse5 .cse9) (or (and .cse12 .cse13 .cse14 .cse17) .cse1 .cse3 .cse10 .cse4 .cse5)))) [2020-07-21 02:17:07,057 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (<= 2 ~T1_E~0)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse23 (<= 2 ~m_st~0))) (let ((.cse6 (and .cse16 .cse17 .cse18 .cse20 .cse23)) (.cse21 (and .cse16 .cse24 .cse18 .cse20 .cse23)) (.cse14 (and .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse22)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (and .cse15 .cse16 .cse25 .cse17 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse10 (and .cse16 .cse24 .cse25 .cse18 .cse22 .cse23)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (and .cse16 .cse17 .cse18 .cse23)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not .cse24)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse12 .cse5) (or .cse0 .cse1 .cse9 .cse2 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse3 .cse11 .cse4 .cse6) (or .cse7 .cse8 .cse0 .cse10 .cse3 .cse4 .cse12 .cse5 .cse13) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse12 .cse5) (or .cse21 .cse11 .cse4 (and .cse15 .cse16 .cse18 .cse19 .cse22 .cse20) .cse14 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse3 .cse12) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse12 .cse13) (or (and .cse16 .cse18 .cse19 .cse23) .cse0 .cse3 .cse11 .cse4 .cse5)))) [2020-07-21 02:17:07,057 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse4 (<= 2 ~E_1~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= ~m_pc~0 0))) (let ((.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse8 (<= ~t1_pc~0 0)) (.cse14 (and .cse4 .cse17 .cse5 .cse6 .cse7 (= ~token~0 ~local~0))) (.cse2 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse13 (and .cse4 .cse17 .cse5 .cse6 (= ~token~0 (+ ~local~0 1)))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~T1_E~0))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (= 1 |old(~t1_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse2 .cse3 .cse13 .cse9 .cse10 .cse11 .cse14 .cse15) (or .cse0 .cse3 .cse9 .cse11 .cse16) (or .cse0 .cse1 .cse9 .cse11 .cse16) (or .cse0 .cse9 .cse10 .cse11 .cse16) (or .cse12 .cse0 .cse1 .cse2 .cse13 .cse9 .cse10 .cse11 (and .cse4 .cse6 .cse7 .cse8) .cse14) (or .cse0 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse3 .cse13 .cse9 .cse11 .cse15) (or .cse12 .cse0 .cse13 .cse9 .cse11 .cse16 .cse15)))) [2020-07-21 02:17:07,058 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (<= 2 ~T1_E~0)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse23 (<= 2 ~m_st~0))) (let ((.cse6 (and .cse16 .cse17 .cse18 .cse20 .cse23)) (.cse21 (and .cse16 .cse24 .cse18 .cse20 .cse23)) (.cse14 (and .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse22)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (and .cse15 .cse16 .cse25 .cse17 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse10 (and .cse16 .cse24 .cse25 .cse18 .cse22 .cse23)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (and .cse16 .cse17 .cse18 .cse23)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not .cse24)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse12 .cse5) (or .cse0 .cse1 .cse9 .cse2 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse3 .cse11 .cse4 .cse6) (or .cse7 .cse8 .cse0 .cse10 .cse3 .cse4 .cse12 .cse5 .cse13) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse12 .cse5) (or .cse21 .cse11 .cse4 (and .cse15 .cse16 .cse18 .cse19 .cse22 .cse20) .cse14 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse3 .cse12) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse12 .cse13) (or (and .cse16 .cse18 .cse19 .cse23) .cse0 .cse3 .cse11 .cse4 .cse5)))) [2020-07-21 02:17:07,058 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-21 02:17:07,058 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-21 02:17:07,058 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-21 02:17:07,058 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-21 02:17:07,059 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 02:17:07,059 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-21 02:17:07,060 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,060 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,060 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-21 02:17:07,060 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,060 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse3 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse4 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse8 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse1 .cse8 .cse2 .cse4 .cse9 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,060 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,061 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-21 02:17:07,061 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,062 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,062 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,062 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,062 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,062 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-21 02:17:07,062 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,062 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse5 (= 0 ~m_st~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (<= ~t1_pc~0 0)) (.cse6 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= |old(~m_pc~0)| 0)) (and .cse5 .cse0 .cse6 .cse7 .cse1 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse7 .cse1 .cse2 .cse4) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse8 .cse9) (and .cse5 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 02:17:07,063 INFO L264 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (or (<= 2 ~E_1~0) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 (+ ~local~0 1)))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse5 .cse7) (or .cse1 .cse0 .cse8 .cse6 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse5) (or .cse0 .cse2 .cse5 .cse9 .cse10) (or .cse1 .cse0 .cse6 .cse2 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse6 (<= ~E_M~0 1) .cse4 .cse5) (or .cse0 .cse1 .cse4 .cse5 .cse10))) [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-21 02:17:07,063 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (<= 2 ~T1_E~0) (<= 2 ~E_M~0) (<= ~m_pc~0 0) (= ~token~0 ~local~0) (<= 2 ~M_E~0) (<= ~t1_pc~0 0)) [2020-07-21 02:17:07,064 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse6 (not (= ~token~0 ~local~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse5 .cse10 .cse6 .cse7) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse10 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse5 .cse10 .cse9 .cse7))) [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 02:17:07,064 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 02:17:07,065 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-21 02:17:07,065 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-21 02:17:07,065 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-21 02:17:07,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:17:07 BoogieIcfgContainer [2020-07-21 02:17:07,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 02:17:07,123 INFO L168 Benchmark]: Toolchain (without parser) took 28134.12 ms. Allocated memory was 138.4 MB in the beginning and 523.8 MB in the end (delta: 385.4 MB). Free memory was 103.7 MB in the beginning and 205.6 MB in the end (delta: -102.0 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,123 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 89.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,124 INFO L168 Benchmark]: Boogie Preprocessor took 140.97 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 179.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,125 INFO L168 Benchmark]: RCFGBuilder took 613.60 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 148.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,125 INFO L168 Benchmark]: TraceAbstraction took 27050.59 ms. Allocated memory was 201.9 MB in the beginning and 523.8 MB in the end (delta: 321.9 MB). Free memory was 147.4 MB in the beginning and 205.6 MB in the end (delta: -58.3 MB). Peak memory consumption was 360.8 MB. Max. memory is 7.1 GB. [2020-07-21 02:17:07,128 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 89.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.97 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 179.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 613.60 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 148.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27050.59 ms. Allocated memory was 201.9 MB in the beginning and 523.8 MB in the end (delta: 321.9 MB). Free memory was 147.4 MB in the beginning and 205.6 MB in the end (delta: -58.3 MB). Peak memory consumption was 360.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st)) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && t1_pc <= 0)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((((((((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= E_M) && m_pc <= 0) && token == local) && t1_pc <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) && (((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local))) && (((((((!(2 <= E_1) || 0 == __retres1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || 0 == __retres1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local))) && (((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_pc)) || E_M <= 1) || !(2 <= m_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_1)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(m_pc <= 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st)) && ((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (2 <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0)) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || ((2 <= E_1 && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || !(\old(token) == local)) || ((2 <= E_1 && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((0 == m_st && 2 <= E_M) && token == local)) || !(m_pc <= 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st)) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && t1_pc <= 0)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((((((((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= E_M) && m_pc <= 0) && token == local) && t1_pc <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (2 <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0)) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || ((2 <= E_M && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((!(2 <= E_1) || ((((0 == m_st && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && token == local + 1)) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((2 <= E_M && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((!(2 <= E_1) || ((((0 == m_st && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && token == local)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(m_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(m_pc <= 0)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= E_1 && 2 <= E_M) && \old(T1_E) <= T1_E) && t1_pc <= 0) && 2 <= m_st) || !(\old(m_pc) <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && \old(T1_E) <= T1_E)) || !(\old(token) == \old(local))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((0 == m_st && 2 <= E_1) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local) && t1_pc <= 0)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local)) || ((((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && t1_pc <= 0)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= E_M) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= m_st)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && ((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 0 == __retres1) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(m_pc <= 0))) && (((!(2 <= E_1) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1)) && (((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= T1_E)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && (((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (\old(E_1) <= E_1 && m_pc <= 0))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.4s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2633 SDtfs, 2272 SDslu, 2594 SDs, 0 SdLazy, 1305 SolverSat, 601 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1654 GetRequests, 1607 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1323occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 186 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3242 PreInvPairs, 3933 NumberOfFragments, 9809 HoareAnnotationTreeSize, 3242 FomulaSimplifications, 25128 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 62 FomulaSimplificationsInter, 33583 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1481 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1643 ConstructedInterpolants, 0 QuantifiedInterpolants, 335090 SizeOfPredicates, 22 NumberOfNonLiveVariables, 5589 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 569/592 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 correct! Received shutdown request...