/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 DAGSIZE --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-20 22:58:03,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 22:58:03,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 22:58:03,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 22:58:03,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 22:58:03,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 22:58:03,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 22:58:03,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 22:58:03,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 22:58:03,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 22:58:03,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 22:58:03,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 22:58:03,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 22:58:03,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 22:58:03,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 22:58:03,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 22:58:03,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 22:58:03,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 22:58:03,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 22:58:03,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 22:58:03,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 22:58:03,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 22:58:03,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 22:58:03,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 22:58:03,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 22:58:03,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 22:58:03,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 22:58:03,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 22:58:03,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 22:58:03,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 22:58:03,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 22:58:03,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 22:58:03,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 22:58:03,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 22:58:03,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 22:58:03,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 22:58:03,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 22:58:03,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 22:58:03,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 22:58:03,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 22:58:03,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 22:58:03,146 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-20 22:58:03,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 22:58:03,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 22:58:03,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 22:58:03,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 22:58:03,171 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 22:58:03,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 22:58:03,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 22:58:03,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 22:58:03,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 22:58:03,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 22:58:03,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 22:58:03,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 22:58:03,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 22:58:03,175 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 22:58:03,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 22:58:03,175 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 22:58:03,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 22:58:03,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 22:58:03,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 22:58:03,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 22:58:03,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 22:58:03,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 22:58:03,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 22:58:03,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 22:58:03,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 22:58:03,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 22:58:03,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:03,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 22:58:03,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 22:58:03,178 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 -> DAGSIZE 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-20 22:58:03,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 22:58:03,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 22:58:03,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 22:58:03,585 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 22:58:03,586 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 22:58:03,586 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-20 22:58:03,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a8f2d58/b77c8373c5db45a18dcc614036b22cbc/FLAG5e9313e7d [2020-07-20 22:58:04,182 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 22:58:04,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 22:58:04,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a8f2d58/b77c8373c5db45a18dcc614036b22cbc/FLAG5e9313e7d [2020-07-20 22:58:04,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a8f2d58/b77c8373c5db45a18dcc614036b22cbc [2020-07-20 22:58:04,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 22:58:04,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 22:58:04,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 22:58:04,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 22:58:04,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 22:58:04,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36565262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04, skipping insertion in model container [2020-07-20 22:58:04,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 22:58:04,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 22:58:04,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:58:04,790 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 22:58:04,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:58:04,860 INFO L208 MainTranslator]: Completed translation [2020-07-20 22:58:04,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04 WrapperNode [2020-07-20 22:58:04,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 22:58:04,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 22:58:04,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 22:58:04,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 22:58:04,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (1/1) ... [2020-07-20 22:58:04,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 22:58:04,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 22:58:04,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 22:58:04,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 22:58:04,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (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-20 22:58:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 22:58:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 22:58:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 22:58:05,061 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 22:58:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 22:58:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 22:58:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 22:58:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 22:58:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 22:58:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 22:58:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 22:58:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 22:58:05,571 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 22:58:05,571 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 22:58:05,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:58:05 BoogieIcfgContainer [2020-07-20 22:58:05,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 22:58:05,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 22:58:05,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 22:58:05,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 22:58:05,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:58:04" (1/3) ... [2020-07-20 22:58:05,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33702090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:58:05, skipping insertion in model container [2020-07-20 22:58:05,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:04" (2/3) ... [2020-07-20 22:58:05,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33702090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:58:05, skipping insertion in model container [2020-07-20 22:58:05,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:58:05" (3/3) ... [2020-07-20 22:58:05,586 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-20 22:58:05,597 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 22:58:05,606 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 22:58:05,620 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 22:58:05,645 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 22:58:05,646 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 22:58:05,646 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 22:58:05,646 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 22:58:05,647 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 22:58:05,647 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 22:58:05,647 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 22:58:05,647 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 22:58:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-20 22:58:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:05,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:05,695 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-20 22:58:05,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-20 22:58:05,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:05,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586880886] [2020-07-20 22:58:05,713 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-20 22:58:05,886 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:05,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:05,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:58:05,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:05,998 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-20 22:58:05,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:06,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586880886] [2020-07-20 22:58:06,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:06,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:06,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664199656] [2020-07-20 22:58:06,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:06,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:06,031 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2020-07-20 22:58:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:06,138 INFO L93 Difference]: Finished difference Result 276 states and 389 transitions. [2020-07-20 22:58:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:06,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 22:58:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:06,165 INFO L225 Difference]: With dead ends: 276 [2020-07-20 22:58:06,165 INFO L226 Difference]: Without dead ends: 145 [2020-07-20 22:58:06,176 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-20 22:58:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-20 22:58:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2020-07-20 22:58:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-20 22:58:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2020-07-20 22:58:06,246 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 77 [2020-07-20 22:58:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:06,247 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2020-07-20 22:58:06,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2020-07-20 22:58:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:06,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:06,252 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-20 22:58:06,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:06,462 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1166188342, now seen corresponding path program 1 times [2020-07-20 22:58:06,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:06,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537362739] [2020-07-20 22:58:06,465 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-20 22:58:06,582 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:06,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:06,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 22:58:06,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:06,633 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-20 22:58:06,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:06,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537362739] [2020-07-20 22:58:06,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:06,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:06,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173921774] [2020-07-20 22:58:06,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:06,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:06,637 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand 3 states. [2020-07-20 22:58:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:06,692 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2020-07-20 22:58:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:06,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 22:58:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:06,697 INFO L225 Difference]: With dead ends: 373 [2020-07-20 22:58:06,697 INFO L226 Difference]: Without dead ends: 253 [2020-07-20 22:58:06,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-20 22:58:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-20 22:58:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2020-07-20 22:58:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-20 22:58:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 325 transitions. [2020-07-20 22:58:06,739 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 325 transitions. Word has length 77 [2020-07-20 22:58:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:06,739 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 325 transitions. [2020-07-20 22:58:06,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2020-07-20 22:58:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:06,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:06,742 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-20 22:58:06,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:06,960 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash -40928373, now seen corresponding path program 1 times [2020-07-20 22:58:06,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:06,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [375671974] [2020-07-20 22:58:06,961 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-20 22:58:07,042 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:07,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:07,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:58:07,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:07,095 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-20 22:58:07,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:07,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [375671974] [2020-07-20 22:58:07,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:07,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:07,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815468190] [2020-07-20 22:58:07,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:07,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:07,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:07,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:07,098 INFO L87 Difference]: Start difference. First operand 248 states and 325 transitions. Second operand 6 states. [2020-07-20 22:58:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:07,147 INFO L93 Difference]: Finished difference Result 483 states and 651 transitions. [2020-07-20 22:58:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:07,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 22:58:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:07,152 INFO L225 Difference]: With dead ends: 483 [2020-07-20 22:58:07,152 INFO L226 Difference]: Without dead ends: 255 [2020-07-20 22:58:07,155 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-20 22:58:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-07-20 22:58:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2020-07-20 22:58:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-20 22:58:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2020-07-20 22:58:07,183 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 77 [2020-07-20 22:58:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:07,184 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2020-07-20 22:58:07,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2020-07-20 22:58:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:07,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:07,186 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-20 22:58:07,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:07,400 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash 660671501, now seen corresponding path program 1 times [2020-07-20 22:58:07,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:07,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564704431] [2020-07-20 22:58:07,402 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-20 22:58:07,488 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:07,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:07,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:07,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:07,553 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-20 22:58:07,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:07,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564704431] [2020-07-20 22:58:07,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:07,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:07,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395263379] [2020-07-20 22:58:07,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:07,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:07,558 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand 5 states. [2020-07-20 22:58:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:08,069 INFO L93 Difference]: Finished difference Result 605 states and 829 transitions. [2020-07-20 22:58:08,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:08,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 22:58:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:08,074 INFO L225 Difference]: With dead ends: 605 [2020-07-20 22:58:08,074 INFO L226 Difference]: Without dead ends: 371 [2020-07-20 22:58:08,076 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-20 22:58:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-20 22:58:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 311. [2020-07-20 22:58:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-07-20 22:58:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 386 transitions. [2020-07-20 22:58:08,110 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 386 transitions. Word has length 77 [2020-07-20 22:58:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:08,111 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 386 transitions. [2020-07-20 22:58:08,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 386 transitions. [2020-07-20 22:58:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:08,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:08,113 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-20 22:58:08,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:08,327 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash 970558669, now seen corresponding path program 1 times [2020-07-20 22:58:08,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:08,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805685732] [2020-07-20 22:58:08,328 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-20 22:58:08,407 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:08,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:08,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:08,443 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-20 22:58:08,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:08,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805685732] [2020-07-20 22:58:08,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:08,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:08,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437763596] [2020-07-20 22:58:08,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:08,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:08,446 INFO L87 Difference]: Start difference. First operand 311 states and 386 transitions. Second operand 5 states. [2020-07-20 22:58:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:09,095 INFO L93 Difference]: Finished difference Result 925 states and 1173 transitions. [2020-07-20 22:58:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:09,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 22:58:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:09,101 INFO L225 Difference]: With dead ends: 925 [2020-07-20 22:58:09,101 INFO L226 Difference]: Without dead ends: 633 [2020-07-20 22:58:09,103 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-20 22:58:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-20 22:58:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 584. [2020-07-20 22:58:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-20 22:58:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 723 transitions. [2020-07-20 22:58:09,147 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 723 transitions. Word has length 77 [2020-07-20 22:58:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:09,147 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 723 transitions. [2020-07-20 22:58:09,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 723 transitions. [2020-07-20 22:58:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:09,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:09,149 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-20 22:58:09,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:09,363 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1360505843, now seen corresponding path program 1 times [2020-07-20 22:58:09,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:09,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565635496] [2020-07-20 22:58:09,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 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-20 22:58:09,435 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:09,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:09,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:09,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:09,476 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-20 22:58:09,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:09,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565635496] [2020-07-20 22:58:09,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:09,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:09,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440832819] [2020-07-20 22:58:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:09,480 INFO L87 Difference]: Start difference. First operand 584 states and 723 transitions. Second operand 5 states. [2020-07-20 22:58:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:09,816 INFO L93 Difference]: Finished difference Result 1149 states and 1439 transitions. [2020-07-20 22:58:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:09,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 22:58:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:09,821 INFO L225 Difference]: With dead ends: 1149 [2020-07-20 22:58:09,821 INFO L226 Difference]: Without dead ends: 584 [2020-07-20 22:58:09,823 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-20 22:58:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-07-20 22:58:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-07-20 22:58:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-20 22:58:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 711 transitions. [2020-07-20 22:58:09,863 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 711 transitions. Word has length 77 [2020-07-20 22:58:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:09,864 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 711 transitions. [2020-07-20 22:58:09,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 711 transitions. [2020-07-20 22:58:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:09,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:09,866 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-20 22:58:10,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:10,068 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-20 22:58:10,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:10,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177956052] [2020-07-20 22:58:10,070 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-20 22:58:10,169 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:58:10,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:10,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 22:58:10,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:10,207 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-20 22:58:10,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:10,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177956052] [2020-07-20 22:58:10,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:10,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:10,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003608707] [2020-07-20 22:58:10,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:10,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:10,210 INFO L87 Difference]: Start difference. First operand 584 states and 711 transitions. Second operand 5 states. [2020-07-20 22:58:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:10,666 INFO L93 Difference]: Finished difference Result 1258 states and 1614 transitions. [2020-07-20 22:58:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:10,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 22:58:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:10,672 INFO L225 Difference]: With dead ends: 1258 [2020-07-20 22:58:10,672 INFO L226 Difference]: Without dead ends: 693 [2020-07-20 22:58:10,675 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-20 22:58:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-20 22:58:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 608. [2020-07-20 22:58:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-07-20 22:58:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 713 transitions. [2020-07-20 22:58:10,718 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 713 transitions. Word has length 77 [2020-07-20 22:58:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:10,719 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 713 transitions. [2020-07-20 22:58:10,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 713 transitions. [2020-07-20 22:58:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 22:58:10,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:10,721 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-20 22:58:10,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:10,928 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-20 22:58:10,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:10,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476344542] [2020-07-20 22:58:10,931 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-20 22:58:11,003 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:58:11,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:11,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 22:58:11,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:11,039 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-20 22:58:11,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:11,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476344542] [2020-07-20 22:58:11,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:11,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:11,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114719017] [2020-07-20 22:58:11,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:11,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:11,042 INFO L87 Difference]: Start difference. First operand 608 states and 713 transitions. Second operand 3 states. [2020-07-20 22:58:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:11,127 INFO L93 Difference]: Finished difference Result 1748 states and 2108 transitions. [2020-07-20 22:58:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:11,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 22:58:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:11,135 INFO L225 Difference]: With dead ends: 1748 [2020-07-20 22:58:11,136 INFO L226 Difference]: Without dead ends: 1160 [2020-07-20 22:58:11,139 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-20 22:58:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-07-20 22:58:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2020-07-20 22:58:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-07-20 22:58:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1349 transitions. [2020-07-20 22:58:11,236 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1349 transitions. Word has length 77 [2020-07-20 22:58:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:11,236 INFO L479 AbstractCegarLoop]: Abstraction has 1156 states and 1349 transitions. [2020-07-20 22:58:11,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1349 transitions. [2020-07-20 22:58:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-20 22:58:11,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:11,239 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-20 22:58:11,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:11,454 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2020-07-20 22:58:11,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:11,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692314362] [2020-07-20 22:58:11,457 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-20 22:58:11,504 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:11,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:11,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:11,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:11,528 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-20 22:58:11,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:11,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692314362] [2020-07-20 22:58:11,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:11,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:11,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748004601] [2020-07-20 22:58:11,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:11,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:11,531 INFO L87 Difference]: Start difference. First operand 1156 states and 1349 transitions. Second operand 3 states. [2020-07-20 22:58:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:11,646 INFO L93 Difference]: Finished difference Result 2900 states and 3451 transitions. [2020-07-20 22:58:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:11,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-20 22:58:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:11,657 INFO L225 Difference]: With dead ends: 2900 [2020-07-20 22:58:11,657 INFO L226 Difference]: Without dead ends: 1347 [2020-07-20 22:58:11,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-20 22:58:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-07-20 22:58:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2020-07-20 22:58:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-07-20 22:58:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1576 transitions. [2020-07-20 22:58:11,757 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1576 transitions. Word has length 121 [2020-07-20 22:58:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:11,757 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1576 transitions. [2020-07-20 22:58:11,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1576 transitions. [2020-07-20 22:58:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 22:58:11,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:11,762 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-20 22:58:11,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:11,976 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-20 22:58:11,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:11,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524423648] [2020-07-20 22:58:11,977 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-20 22:58:12,056 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:12,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:12,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:12,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:12,108 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-20 22:58:12,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:12,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524423648] [2020-07-20 22:58:12,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:12,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:12,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071348022] [2020-07-20 22:58:12,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:12,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:12,111 INFO L87 Difference]: Start difference. First operand 1347 states and 1576 transitions. Second operand 3 states. [2020-07-20 22:58:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:12,207 INFO L93 Difference]: Finished difference Result 2667 states and 3166 transitions. [2020-07-20 22:58:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:12,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 22:58:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:12,218 INFO L225 Difference]: With dead ends: 2667 [2020-07-20 22:58:12,218 INFO L226 Difference]: Without dead ends: 1341 [2020-07-20 22:58:12,225 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-20 22:58:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-07-20 22:58:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2020-07-20 22:58:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2020-07-20 22:58:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1552 transitions. [2020-07-20 22:58:12,310 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1552 transitions. Word has length 174 [2020-07-20 22:58:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:12,310 INFO L479 AbstractCegarLoop]: Abstraction has 1341 states and 1552 transitions. [2020-07-20 22:58:12,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1552 transitions. [2020-07-20 22:58:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 22:58:12,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:12,316 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-20 22:58:12,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:12,529 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-20 22:58:12,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:12,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601455925] [2020-07-20 22:58:12,530 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-20 22:58:12,596 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:12,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:12,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:12,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 22:58:12,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:12,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601455925] [2020-07-20 22:58:12,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:12,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:12,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443141964] [2020-07-20 22:58:12,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:12,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:12,634 INFO L87 Difference]: Start difference. First operand 1341 states and 1552 transitions. Second operand 3 states. [2020-07-20 22:58:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:12,740 INFO L93 Difference]: Finished difference Result 3117 states and 3644 transitions. [2020-07-20 22:58:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:12,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 22:58:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:12,747 INFO L225 Difference]: With dead ends: 3117 [2020-07-20 22:58:12,747 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 22:58:12,754 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-20 22:58:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 22:58:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 22:58:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 22:58:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1013 transitions. [2020-07-20 22:58:12,813 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1013 transitions. Word has length 175 [2020-07-20 22:58:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:12,814 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1013 transitions. [2020-07-20 22:58:12,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1013 transitions. [2020-07-20 22:58:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 22:58:12,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:12,818 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-20 22:58:13,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:13,032 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-20 22:58:13,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:13,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [629522795] [2020-07-20 22:58:13,033 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-20 22:58:13,100 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:13,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:13,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:13,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:13,159 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-20 22:58:13,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:13,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [629522795] [2020-07-20 22:58:13,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:13,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:13,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500756898] [2020-07-20 22:58:13,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:13,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:13,161 INFO L87 Difference]: Start difference. First operand 896 states and 1013 transitions. Second operand 3 states. [2020-07-20 22:58:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:13,232 INFO L93 Difference]: Finished difference Result 1594 states and 1836 transitions. [2020-07-20 22:58:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 22:58:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:13,238 INFO L225 Difference]: With dead ends: 1594 [2020-07-20 22:58:13,238 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 22:58:13,241 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-20 22:58:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 22:58:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 22:58:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 22:58:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-20 22:58:13,300 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 175 [2020-07-20 22:58:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:13,300 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-20 22:58:13,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-20 22:58:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 22:58:13,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:13,304 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-20 22:58:13,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:13,517 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:13,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:13,517 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-20 22:58:13,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:13,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304455200] [2020-07-20 22:58:13,518 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-20 22:58:13,629 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:58:13,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:13,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 22:58:13,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:13,691 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-20 22:58:13,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 22:58:13,921 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-20 22:58:13,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304455200] [2020-07-20 22:58:13,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 22:58:13,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-20 22:58:13,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838039888] [2020-07-20 22:58:13,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:13,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:13,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 22:58:13,924 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-20 22:58:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:14,367 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-20 22:58:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:14,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-20 22:58:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:14,370 INFO L225 Difference]: With dead ends: 920 [2020-07-20 22:58:14,371 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 22:58:14,374 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 22:58:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 22:58:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 22:58:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 22:58:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 22:58:14,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-20 22:58:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:14,375 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 22:58:14,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 22:58:14,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 22:58:14,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:14,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 22:58:14,727 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 22:58:17,324 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 22:58:17,814 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 47 [2020-07-20 22:58:18,107 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 22:58:18,448 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:18,773 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:19,176 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:19,487 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:19,875 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:20,375 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-07-20 22:58:20,770 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-20 22:58:21,298 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2020-07-20 22:58:21,579 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 22:58:22,135 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 22:58:22,691 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 22:58:23,153 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-07-20 22:58:23,463 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:24,301 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 22:58:24,445 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-20 22:58:24,747 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2020-07-20 22:58:24,908 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 22:58:25,753 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 22:58:26,009 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-20 22:58:26,323 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:27,196 WARN L193 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 22:58:27,508 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-07-20 22:58:27,965 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 22:58:28,206 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 22:58:28,436 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 22:58:28,660 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 22:58:29,226 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2020-07-20 22:58:29,432 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-07-20 22:58:29,664 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-20 22:58:30,078 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-20 22:58:30,388 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 22:58:31,031 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 22:58:31,381 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-07-20 22:58:31,639 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-07-20 22:58:31,847 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-07-20 22:58:32,076 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-07-20 22:58:32,376 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-07-20 22:58:32,409 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-20 22:58:32,410 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-20 22:58:32,410 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-20 22:58:32,410 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse3 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~m_st~0))) (let ((.cse4 (and .cse3 .cse11)) (.cse2 (= 0 ~m_st~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)|))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= 1 ~t1_pc~0) .cse3 (= ~token~0 (+ ~local~0 1))) .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse5 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse5 (and .cse2 (= ~token~0 ~local~0) .cse10) .cse6 .cse8) (or .cse0 .cse1 .cse9 (and .cse10 .cse11) .cse5 .cse7)))) [2020-07-20 22:58:32,411 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-20 22:58:32,411 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-20 22:58:32,411 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-20 22:58:32,411 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-20 22:58:32,411 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-20 22:58:32,411 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~m_st~0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (= |old(~token~0)| ~local~0))) (.cse2 (= 0 ~m_st~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse11 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1))) .cse6 (and .cse4 .cse5 .cse7) .cse8 .cse9 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse6 (and .cse5 .cse7) .cse9 .cse10) (or (and .cse4 .cse11 .cse7) .cse0 .cse1 .cse12 .cse6 .cse9) (or .cse0 .cse1 .cse12 (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 (and .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse11) .cse10))) [2020-07-20 22:58:32,412 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-20 22:58:32,412 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-20 22:58:32,412 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-20 22:58:32,412 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-20 22:58:32,412 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-20 22:58:32,412 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-20 22:58:32,413 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-20 22:58:32,413 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse12 (= 0 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse10 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~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 .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) (or .cse12 .cse0 .cse9 .cse10 .cse2 .cse4 .cse5))) [2020-07-20 22:58:32,413 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-20 22:58:32,413 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-20 22:58:32,414 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-20 22:58:32,414 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-20 22:58:32,414 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-20 22:58:32,414 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-20 22:58:32,414 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-20 22:58:32,414 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-20 22:58:32,414 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-20 22:58:32,415 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-20 22:58:32,415 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-20 22:58:32,415 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-20 22:58:32,415 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-20 22:58:32,415 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-20 22:58:32,415 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-20 22:58:32,415 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-20 22:58:32,416 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 22:58:32,416 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 22:58:32,416 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 22:58:32,416 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-20 22:58:32,416 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-20 22:58:32,416 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-20 22:58:32,417 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-20 22:58:32,417 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-20 22:58:32,417 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-20 22:58:32,417 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-20 22:58:32,417 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-20 22:58:32,417 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-20 22:58:32,418 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-20 22:58:32,418 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-20 22:58:32,418 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-20 22:58:32,418 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-20 22:58:32,418 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-20 22:58:32,418 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-20 22:58:32,419 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-20 22:58:32,419 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-20 22:58:32,419 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-20 22:58:32,419 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-20 22:58:32,419 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-20 22:58:32,420 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-20 22:58:32,420 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-20 22:58:32,420 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-20 22:58:32,420 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-20 22:58:32,420 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-20 22:58:32,421 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-20 22:58:32,421 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-20 22:58:32,421 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-20 22:58:32,421 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-20 22:58:32,421 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-20 22:58:32,422 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 22:58:32,422 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-20 22:58:32,422 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 22:58:32,422 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-20 22:58:32,422 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-20 22:58:32,423 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-20 22:58:32,423 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-20 22:58:32,423 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-20 22:58:32,423 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 22:58:32,423 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse17 (<= |old(~E_M~0)| ~E_M~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse19 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse7 (and .cse12 .cse19 (= 1 ~t1_pc~0) .cse13 .cse16 .cse15)) (.cse14 (<= ~m_pc~0 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not .cse19)) (.cse5 (and .cse12 .cse17 .cse18 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse8 .cse2 .cse3 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse2 .cse10 .cse3) (or .cse0 .cse8 .cse2 .cse3 .cse4) (or .cse11 .cse0 .cse6 .cse7 .cse8 .cse2 .cse10 .cse3 .cse9) (or .cse11 .cse0 .cse7 .cse2 .cse3 .cse4 .cse9) (or (and .cse12 .cse13 .cse14 .cse15) .cse0 .cse2 .cse10 .cse3 .cse4) (or .cse11 .cse0 .cse1 .cse6 .cse7 (and (= 0 ~m_st~0) .cse12 .cse14 .cse16 .cse17 .cse18) .cse2 .cse10 .cse3 .cse5)))) [2020-07-20 22:58:32,424 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 22:58:32,424 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-20 22:58:32,424 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse13 (<= ~m_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0))) (let ((.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse12 .cse17 .cse16 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse8 (and .cse12 .cse17 .cse16 .cse18 .cse13 (= ~token~0 ~local~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse14 (<= |old(~E_M~0)| ~E_M~0)) (.cse15 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse11 .cse5 .cse7 .cse10) (or .cse1 .cse5 .cse6 .cse7 .cse10) (or .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse3 .cse4 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse10 .cse9) (or .cse0 .cse1 .cse11 .cse2 (and .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 (and .cse12 .cse16 .cse13 .cse14 .cse15))))) [2020-07-20 22:58:32,425 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-20 22:58:32,425 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 22:58:32,425 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-20 22:58:32,425 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-20 22:58:32,425 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-20 22:58:32,426 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-20 22:58:32,426 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-20 22:58:32,426 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-20 22:58:32,426 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-20 22:58:32,426 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-20 22:58:32,426 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-20 22:58:32,426 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-20 22:58:32,427 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-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 22:58:32,427 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-20 22:58:32,427 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-20 22:58:32,427 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-20 22:58:32,428 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-20 22:58:32,428 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-20 22:58:32,428 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 (= ~token~0 (+ ~local~0 1))) (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 .cse10 .cse2 .cse3 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (and .cse1 .cse8 .cse9 .cse2 .cse4 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,428 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-20 22:58:32,429 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,429 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-20 22:58:32,430 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,430 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-20 22:58:32,430 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-20 22:58:32,430 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-20 22:58:32,430 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,430 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-20 22:58:32,431 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,431 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-20 22:58:32,431 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 22:58:32,431 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-20 22:58:32,431 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-20 22:58:32,431 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-20 22:58:32,432 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-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-20 22:58:32,432 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-20 22:58:32,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 22:58:32,433 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-20 22:58:32,433 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 22:58:32,433 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 22:58:32,433 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-20 22:58:32,433 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 22:58:32,433 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-20 22:58:32,433 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-20 22:58:32,434 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 22:58:32,434 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 22:58:32,434 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-20 22:58:32,434 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-20 22:58:32,434 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-20 22:58:32,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:58:32 BoogieIcfgContainer [2020-07-20 22:58:32,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 22:58:32,494 INFO L168 Benchmark]: Toolchain (without parser) took 27959.73 ms. Allocated memory was 136.3 MB in the beginning and 532.2 MB in the end (delta: 395.8 MB). Free memory was 100.4 MB in the beginning and 374.2 MB in the end (delta: -273.8 MB). Peak memory consumption was 421.1 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,495 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.55 ms. Allocated memory is still 136.3 MB. Free memory was 100.2 MB in the beginning and 86.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,496 INFO L168 Benchmark]: Boogie Preprocessor took 127.96 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 86.6 MB in the beginning and 176.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,496 INFO L168 Benchmark]: RCFGBuilder took 587.84 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 145.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,497 INFO L168 Benchmark]: TraceAbstraction took 26910.75 ms. Allocated memory was 199.2 MB in the beginning and 532.2 MB in the end (delta: 332.9 MB). Free memory was 144.5 MB in the beginning and 374.2 MB in the end (delta: -229.7 MB). Peak memory consumption was 402.3 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:32,500 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.57 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.55 ms. Allocated memory is still 136.3 MB. Free memory was 100.2 MB in the beginning and 86.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.96 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 86.6 MB in the beginning and 176.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 587.84 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 145.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26910.75 ms. Allocated memory was 199.2 MB in the beginning and 532.2 MB in the end (delta: 332.9 MB). Free memory was 144.5 MB in the beginning and 374.2 MB in the end (delta: -229.7 MB). Peak memory consumption was 402.3 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 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(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)) || !(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 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= 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))) || !(\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))) && ((((((((!(\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)))) && ((((((((((((((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 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((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))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || (2 <= 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))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(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)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(m_pc <= 0))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(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)) || !(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 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= 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))) || !(\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))) && ((((((((!(\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)))) && ((((((((((((((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 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((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))) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || ((2 <= t1_st && 2 <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((2 <= t1_st && \old(E_M) <= E_M) && 2 <= m_st) || !(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))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(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: ((((((((((((((((((((0 == m_st && 2 <= E_1) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || ((((2 <= E_1 && \old(T1_E) <= T1_E) && \old(E_M) <= E_M) && 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 <= t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && \old(E_M) <= E_M) && 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)) || !(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: 1 - 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2636 SDtfs, 2192 SDslu, 2713 SDs, 0 SdLazy, 1315 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1610 GetRequests, 1568 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 210 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3370 PreInvPairs, 4072 NumberOfFragments, 9762 HoareAnnotationTreeSize, 3370 FomulaSimplifications, 17648 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 62 FomulaSimplificationsInter, 35024 FormulaSimplificationTreeSizeReductionInter, 15.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 315150 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4113 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 536/559 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...