/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --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 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-20 04:12:52,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 04:12:52,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 04:12:52,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 04:12:52,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 04:12:52,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 04:12:52,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 04:12:52,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 04:12:52,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 04:12:52,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 04:12:52,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 04:12:52,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 04:12:52,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 04:12:52,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 04:12:52,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 04:12:52,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 04:12:52,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 04:12:52,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 04:12:52,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 04:12:52,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 04:12:53,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 04:12:53,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 04:12:53,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 04:12:53,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 04:12:53,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 04:12:53,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 04:12:53,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 04:12:53,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 04:12:53,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 04:12:53,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 04:12:53,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 04:12:53,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 04:12:53,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 04:12:53,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 04:12:53,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 04:12:53,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 04:12:53,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 04:12:53,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 04:12:53,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 04:12:53,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 04:12:53,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 04:12:53,043 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 04:12:53,082 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 04:12:53,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 04:12:53,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 04:12:53,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 04:12:53,087 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 04:12:53,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 04:12:53,088 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 04:12:53,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 04:12:53,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 04:12:53,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 04:12:53,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 04:12:53,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 04:12:53,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 04:12:53,089 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 04:12:53,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 04:12:53,090 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 04:12:53,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 04:12:53,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 04:12:53,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 04:12:53,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 04:12:53,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 04:12:53,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 04:12:53,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 04:12:53,092 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 04:12:53,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 04:12:53,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 04:12:53,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 04:12:53,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 04:12:53,507 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 04:12:53,508 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 04:12:53,509 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 04:12:53,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7e4efd3/b872c7ad8672476ab120ecdf792bbe70/FLAG157950d8b [2020-07-20 04:12:54,291 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 04:12:54,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 04:12:54,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7e4efd3/b872c7ad8672476ab120ecdf792bbe70/FLAG157950d8b [2020-07-20 04:12:54,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7e4efd3/b872c7ad8672476ab120ecdf792bbe70 [2020-07-20 04:12:54,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 04:12:54,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 04:12:54,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 04:12:54,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 04:12:54,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 04:12:54,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:54" (1/1) ... [2020-07-20 04:12:54,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a316d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:54, skipping insertion in model container [2020-07-20 04:12:54,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:54" (1/1) ... [2020-07-20 04:12:54,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 04:12:54,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 04:12:54,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:12:54,999 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 04:12:55,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:12:55,099 INFO L208 MainTranslator]: Completed translation [2020-07-20 04:12:55,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55 WrapperNode [2020-07-20 04:12:55,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 04:12:55,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 04:12:55,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 04:12:55,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 04:12:55,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... [2020-07-20 04:12:55,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 04:12:55,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 04:12:55,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 04:12:55,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 04:12:55,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 04:12:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 04:12:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 04:12:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 04:12:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 04:12:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 04:12:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 04:12:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 04:12:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 04:12:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 04:12:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 04:12:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 04:12:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 04:12:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 04:12:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 04:12:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 04:12:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 04:12:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 04:12:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 04:12:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 04:12:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 04:12:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 04:12:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 04:12:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 04:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 04:12:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 04:12:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 04:12:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 04:12:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 04:12:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 04:12:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 04:12:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 04:12:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 04:12:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 04:12:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 04:12:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 04:12:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 04:12:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 04:12:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 04:12:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 04:12:56,085 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 04:12:56,085 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 04:12:56,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:56 BoogieIcfgContainer [2020-07-20 04:12:56,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 04:12:56,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 04:12:56,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 04:12:56,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 04:12:56,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:12:54" (1/3) ... [2020-07-20 04:12:56,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24637b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:56, skipping insertion in model container [2020-07-20 04:12:56,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:55" (2/3) ... [2020-07-20 04:12:56,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24637b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:56, skipping insertion in model container [2020-07-20 04:12:56,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:56" (3/3) ... [2020-07-20 04:12:56,106 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-20 04:12:56,121 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 04:12:56,131 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 04:12:56,146 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 04:12:56,180 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 04:12:56,181 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 04:12:56,181 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 04:12:56,181 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 04:12:56,181 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 04:12:56,181 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 04:12:56,182 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 04:12:56,182 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 04:12:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-20 04:12:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:12:56,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:12:56,228 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 04:12:56,229 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:12:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:12:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-20 04:12:56,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:12:56,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224920429] [2020-07-20 04:12:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:12:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:12:56,947 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 04:12:56,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224920429] [2020-07-20 04:12:56,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:12:56,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:12:56,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745533157] [2020-07-20 04:12:56,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:12:56,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:12:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:12:56,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:12:56,976 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2020-07-20 04:13:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:00,014 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2020-07-20 04:13:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 04:13:00,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2020-07-20 04:13:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:00,044 INFO L225 Difference]: With dead ends: 501 [2020-07-20 04:13:00,044 INFO L226 Difference]: Without dead ends: 357 [2020-07-20 04:13:00,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-20 04:13:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-07-20 04:13:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2020-07-20 04:13:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-20 04:13:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2020-07-20 04:13:00,193 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2020-07-20 04:13:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:00,194 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2020-07-20 04:13:00,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:13:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2020-07-20 04:13:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:00,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:00,201 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 04:13:00,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 04:13:00,202 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2020-07-20 04:13:00,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:00,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173263840] [2020-07-20 04:13:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:00,506 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 04:13:00,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173263840] [2020-07-20 04:13:00,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:00,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:00,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064707996] [2020-07-20 04:13:00,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:00,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:00,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:00,513 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2020-07-20 04:13:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:02,220 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2020-07-20 04:13:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:13:02,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-20 04:13:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:02,243 INFO L225 Difference]: With dead ends: 573 [2020-07-20 04:13:02,244 INFO L226 Difference]: Without dead ends: 348 [2020-07-20 04:13:02,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 04:13:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-07-20 04:13:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2020-07-20 04:13:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-20 04:13:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2020-07-20 04:13:02,376 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2020-07-20 04:13:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:02,377 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2020-07-20 04:13:02,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:13:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2020-07-20 04:13:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:02,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:02,387 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 04:13:02,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 04:13:02,388 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2020-07-20 04:13:02,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:02,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472409969] [2020-07-20 04:13:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:02,714 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 04:13:02,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472409969] [2020-07-20 04:13:02,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:02,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:02,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721939129] [2020-07-20 04:13:02,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:02,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:02,719 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2020-07-20 04:13:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:04,942 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2020-07-20 04:13:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 04:13:04,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-20 04:13:04,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:04,950 INFO L225 Difference]: With dead ends: 696 [2020-07-20 04:13:04,950 INFO L226 Difference]: Without dead ends: 471 [2020-07-20 04:13:04,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-20 04:13:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-07-20 04:13:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2020-07-20 04:13:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-20 04:13:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2020-07-20 04:13:05,030 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2020-07-20 04:13:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:05,031 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2020-07-20 04:13:05,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:13:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2020-07-20 04:13:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:05,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:05,034 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 04:13:05,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 04:13:05,034 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-20 04:13:05,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:05,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550538384] [2020-07-20 04:13:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:05,333 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 04:13:05,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550538384] [2020-07-20 04:13:05,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:05,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:05,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141297497] [2020-07-20 04:13:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:05,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:05,342 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2020-07-20 04:13:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:07,281 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2020-07-20 04:13:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 04:13:07,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-20 04:13:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:07,289 INFO L225 Difference]: With dead ends: 718 [2020-07-20 04:13:07,289 INFO L226 Difference]: Without dead ends: 442 [2020-07-20 04:13:07,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 04:13:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-07-20 04:13:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2020-07-20 04:13:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-07-20 04:13:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2020-07-20 04:13:07,353 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2020-07-20 04:13:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:07,353 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2020-07-20 04:13:07,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:13:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2020-07-20 04:13:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:07,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:07,359 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 04:13:07,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 04:13:07,393 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-07-20 04:13:07,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:07,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477234768] [2020-07-20 04:13:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:07,636 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 04:13:07,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477234768] [2020-07-20 04:13:07,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:07,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:07,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412397968] [2020-07-20 04:13:07,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:07,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:07,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:07,640 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2020-07-20 04:13:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:09,349 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2020-07-20 04:13:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 04:13:09,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-20 04:13:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:09,358 INFO L225 Difference]: With dead ends: 748 [2020-07-20 04:13:09,358 INFO L226 Difference]: Without dead ends: 452 [2020-07-20 04:13:09,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 04:13:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-07-20 04:13:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2020-07-20 04:13:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-07-20 04:13:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2020-07-20 04:13:09,435 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2020-07-20 04:13:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:09,436 INFO L479 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2020-07-20 04:13:09,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:13:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2020-07-20 04:13:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:09,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:09,447 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 04:13:09,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 04:13:09,448 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-20 04:13:09,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:09,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923055089] [2020-07-20 04:13:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:09,717 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 04:13:09,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923055089] [2020-07-20 04:13:09,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:09,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:09,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964582021] [2020-07-20 04:13:09,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:09,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:09,724 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2020-07-20 04:13:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:11,614 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2020-07-20 04:13:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 04:13:11,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-20 04:13:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:11,626 INFO L225 Difference]: With dead ends: 894 [2020-07-20 04:13:11,627 INFO L226 Difference]: Without dead ends: 587 [2020-07-20 04:13:11,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-20 04:13:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-07-20 04:13:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2020-07-20 04:13:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-07-20 04:13:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2020-07-20 04:13:11,698 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2020-07-20 04:13:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:11,701 INFO L479 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2020-07-20 04:13:11,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:13:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2020-07-20 04:13:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 04:13:11,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:11,708 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 04:13:11,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 04:13:11,709 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:11,710 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-20 04:13:11,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:11,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161575263] [2020-07-20 04:13:11,711 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:11,959 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 04:13:11,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161575263] [2020-07-20 04:13:11,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:11,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 04:13:11,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465875425] [2020-07-20 04:13:11,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 04:13:11,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 04:13:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 04:13:11,969 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2020-07-20 04:13:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:13,695 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2020-07-20 04:13:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 04:13:13,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-07-20 04:13:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:13,710 INFO L225 Difference]: With dead ends: 1180 [2020-07-20 04:13:13,710 INFO L226 Difference]: Without dead ends: 838 [2020-07-20 04:13:13,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 04:13:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-07-20 04:13:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2020-07-20 04:13:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-07-20 04:13:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2020-07-20 04:13:13,822 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2020-07-20 04:13:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:13,823 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2020-07-20 04:13:13,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 04:13:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2020-07-20 04:13:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-20 04:13:13,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:13,828 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:13:13,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 04:13:13,829 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-07-20 04:13:13,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:13,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179173565] [2020-07-20 04:13:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 04:13:14,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179173565] [2020-07-20 04:13:14,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166887819] [2020-07-20 04:13:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@64f88689 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:14,276 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@64f88689 issued 1 check-sat command(s) [2020-07-20 04:13:14,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:13:14,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 04:13:14,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:13:14,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-20 04:13:14,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138940353] [2020-07-20 04:13:14,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:13:14,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:14,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:13:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:14,441 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2020-07-20 04:13:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:14,669 INFO L93 Difference]: Finished difference Result 2007 states and 2500 transitions. [2020-07-20 04:13:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:13:14,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-20 04:13:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:14,683 INFO L225 Difference]: With dead ends: 2007 [2020-07-20 04:13:14,684 INFO L226 Difference]: Without dead ends: 1018 [2020-07-20 04:13:14,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-07-20 04:13:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2020-07-20 04:13:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-07-20 04:13:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1236 transitions. [2020-07-20 04:13:14,862 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1236 transitions. Word has length 121 [2020-07-20 04:13:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:14,863 INFO L479 AbstractCegarLoop]: Abstraction has 1018 states and 1236 transitions. [2020-07-20 04:13:14,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:13:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1236 transitions. [2020-07-20 04:13:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 04:13:14,867 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:14,867 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:13:15,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 04:13:15,083 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2020-07-20 04:13:15,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:15,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320558231] [2020-07-20 04:13:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 04:13:15,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320558231] [2020-07-20 04:13:15,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444770640] [2020-07-20 04:13:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a743260 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:15,474 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a743260 issued 3 check-sat command(s) [2020-07-20 04:13:15,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:15,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 04:13:15,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 04:13:15,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:13:15,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-20 04:13:15,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117035838] [2020-07-20 04:13:15,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:13:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:13:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:13:15,583 INFO L87 Difference]: Start difference. First operand 1018 states and 1236 transitions. Second operand 3 states. [2020-07-20 04:13:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:15,877 INFO L93 Difference]: Finished difference Result 2466 states and 3031 transitions. [2020-07-20 04:13:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:13:15,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-20 04:13:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:15,894 INFO L225 Difference]: With dead ends: 2466 [2020-07-20 04:13:15,895 INFO L226 Difference]: Without dead ends: 1468 [2020-07-20 04:13:15,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:13:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-07-20 04:13:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1456. [2020-07-20 04:13:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2020-07-20 04:13:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1754 transitions. [2020-07-20 04:13:16,153 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1754 transitions. Word has length 156 [2020-07-20 04:13:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:16,154 INFO L479 AbstractCegarLoop]: Abstraction has 1456 states and 1754 transitions. [2020-07-20 04:13:16,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:13:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1754 transitions. [2020-07-20 04:13:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 04:13:16,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:16,161 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 04:13:16,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:16,377 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-20 04:13:16,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:16,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567466540] [2020-07-20 04:13:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-20 04:13:16,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567466540] [2020-07-20 04:13:16,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673258942] [2020-07-20 04:13:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@efa5b01 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:16,926 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@efa5b01 issued 2 check-sat command(s) [2020-07-20 04:13:16,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:16,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 04:13:16,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:16,981 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 04:13:16,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:13:16,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 04:13:16,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593427344] [2020-07-20 04:13:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:13:16,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:16,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:13:16,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:13:16,985 INFO L87 Difference]: Start difference. First operand 1456 states and 1754 transitions. Second operand 3 states. [2020-07-20 04:13:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:17,216 INFO L93 Difference]: Finished difference Result 2885 states and 3538 transitions. [2020-07-20 04:13:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:13:17,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 04:13:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:17,236 INFO L225 Difference]: With dead ends: 2885 [2020-07-20 04:13:17,237 INFO L226 Difference]: Without dead ends: 1450 [2020-07-20 04:13:17,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:13:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-07-20 04:13:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-07-20 04:13:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-07-20 04:13:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1726 transitions. [2020-07-20 04:13:17,551 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1726 transitions. Word has length 174 [2020-07-20 04:13:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:17,552 INFO L479 AbstractCegarLoop]: Abstraction has 1450 states and 1726 transitions. [2020-07-20 04:13:17,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:13:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1726 transitions. [2020-07-20 04:13:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 04:13:17,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:17,558 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 04:13:17,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 04:13:17,773 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-20 04:13:17,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:17,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838402047] [2020-07-20 04:13:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-20 04:13:18,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838402047] [2020-07-20 04:13:18,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248342134] [2020-07-20 04:13:18,152 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67807a67 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:18,235 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67807a67 issued 1 check-sat command(s) [2020-07-20 04:13:18,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:18,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:13:18,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:18,283 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 04:13:18,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:13:18,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 04:13:18,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147852101] [2020-07-20 04:13:18,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:13:18,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:18,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:13:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:18,287 INFO L87 Difference]: Start difference. First operand 1450 states and 1726 transitions. Second operand 3 states. [2020-07-20 04:13:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:18,543 INFO L93 Difference]: Finished difference Result 3356 states and 4007 transitions. [2020-07-20 04:13:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:13:18,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 04:13:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:18,555 INFO L225 Difference]: With dead ends: 3356 [2020-07-20 04:13:18,555 INFO L226 Difference]: Without dead ends: 954 [2020-07-20 04:13:18,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-07-20 04:13:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 952. [2020-07-20 04:13:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-07-20 04:13:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1084 transitions. [2020-07-20 04:13:18,691 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1084 transitions. Word has length 175 [2020-07-20 04:13:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:18,692 INFO L479 AbstractCegarLoop]: Abstraction has 952 states and 1084 transitions. [2020-07-20 04:13:18,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:13:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1084 transitions. [2020-07-20 04:13:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 04:13:18,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:18,698 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 04:13:18,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:18,912 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-20 04:13:18,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:18,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686091098] [2020-07-20 04:13:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-07-20 04:13:19,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686091098] [2020-07-20 04:13:19,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411701287] [2020-07-20 04:13:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@48bcd5ac No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:19,539 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@48bcd5ac issued 4 check-sat command(s) [2020-07-20 04:13:19,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:19,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 04:13:19,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:19,598 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 04:13:19,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:13:19,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 04:13:19,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977245624] [2020-07-20 04:13:19,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:13:19,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:19,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:13:19,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:19,601 INFO L87 Difference]: Start difference. First operand 952 states and 1084 transitions. Second operand 3 states. [2020-07-20 04:13:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:19,760 INFO L93 Difference]: Finished difference Result 1701 states and 1978 transitions. [2020-07-20 04:13:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:13:19,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 04:13:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:19,773 INFO L225 Difference]: With dead ends: 1701 [2020-07-20 04:13:19,773 INFO L226 Difference]: Without dead ends: 952 [2020-07-20 04:13:19,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2020-07-20 04:13:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2020-07-20 04:13:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-07-20 04:13:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1076 transitions. [2020-07-20 04:13:19,910 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1076 transitions. Word has length 175 [2020-07-20 04:13:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:19,915 INFO L479 AbstractCegarLoop]: Abstraction has 952 states and 1076 transitions. [2020-07-20 04:13:19,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:13:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1076 transitions. [2020-07-20 04:13:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 04:13:19,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:19,921 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 04:13:20,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 04:13:20,137 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-20 04:13:20,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:20,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298418185] [2020-07-20 04:13:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d98d13b [2020-07-20 04:13:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-20 04:13:20,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298418185] [2020-07-20 04:13:20,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147441379] [2020-07-20 04:13:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b82f352 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:21,016 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b82f352 issued 4 check-sat command(s) [2020-07-20 04:13:21,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:13:21,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 04:13:21,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:13:21,148 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 04:13:21,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 04:13:21,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-20 04:13:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437792085] [2020-07-20 04:13:21,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 04:13:21,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 04:13:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-20 04:13:21,153 INFO L87 Difference]: Start difference. First operand 952 states and 1076 transitions. Second operand 12 states. [2020-07-20 04:13:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:24,617 INFO L93 Difference]: Finished difference Result 1204 states and 1390 transitions. [2020-07-20 04:13:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 04:13:24,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2020-07-20 04:13:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:24,620 INFO L225 Difference]: With dead ends: 1204 [2020-07-20 04:13:24,620 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 04:13:24,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-20 04:13:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 04:13:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 04:13:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 04:13:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 04:13:24,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-20 04:13:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:24,629 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 04:13:24,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 04:13:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 04:13:24,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 04:13:24,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:13:24,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 04:13:25,609 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-20 04:13:25,745 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-20 04:13:25,881 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-20 04:13:26,008 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-20 04:13:26,185 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-20 04:13:38,446 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-20 04:13:39,459 WARN L193 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-07-20 04:13:39,864 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-07-20 04:13:40,441 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:40,986 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:41,120 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-07-20 04:13:41,639 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:42,162 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:42,808 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:43,589 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 81 [2020-07-20 04:13:44,351 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-07-20 04:13:45,417 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 160 DAG size of output: 65 [2020-07-20 04:13:45,836 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-07-20 04:13:46,575 WARN L193 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 55 [2020-07-20 04:13:47,598 WARN L193 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2020-07-20 04:13:48,298 WARN L193 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-20 04:13:48,852 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:50,633 WARN L193 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-20 04:13:50,937 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-07-20 04:13:51,415 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 51 [2020-07-20 04:13:51,634 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-07-20 04:13:53,380 WARN L193 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-20 04:13:53,755 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-07-20 04:13:54,362 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:13:56,127 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 166 DAG size of output: 96 [2020-07-20 04:13:56,236 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-07-20 04:13:56,351 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-20 04:13:56,662 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-20 04:13:57,347 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-20 04:13:57,698 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-20 04:13:58,074 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2020-07-20 04:13:58,435 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-07-20 04:13:59,403 WARN L193 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2020-07-20 04:13:59,749 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-07-20 04:14:00,439 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-07-20 04:14:01,299 WARN L193 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 67 [2020-07-20 04:14:01,879 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2020-07-20 04:14:02,878 WARN L193 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 55 [2020-07-20 04:14:03,425 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-07-20 04:14:03,886 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-07-20 04:14:04,281 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2020-07-20 04:14:04,387 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-07-20 04:14:04,650 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-20 04:14:04,771 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-20 04:14:05,177 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-07-20 04:14:05,289 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-20 04:14:05,290 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (= 1 ~m_pc~0)) (.cse8 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 (not (<= ~token~0 ~local~0)) .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 (not (<= ~local~0 ~token~0))) (let ((.cse9 (+ ~local~0 1))) (or .cse1 .cse0 .cse6 .cse2 .cse3 (not (<= .cse9 ~token~0)) .cse5 (not (<= ~token~0 .cse9)))) (or .cse1 .cse7 .cse2 .cse3 (not (<= ~t1_pc~0 0)) .cse4 .cse8))) [2020-07-20 04:14:05,290 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-20 04:14:05,290 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse1 (<= 2 ~T1_E~0)) (.cse0 (<= 2 ~E_1~0)) (.cse18 (= 1 ~m_pc~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (<= 2 ~E_M~0))) (let ((.cse17 (and (not .cse18) .cse14 .cse15 .cse4)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not .cse0)) (.cse6 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse9 (not .cse1)) (.cse11 (not (<= |old(~token~0)| ~local~0)))) (and (let ((.cse3 (not .cse8))) (or (let ((.cse2 (+ ~local~0 1))) (and (= 0 ~m_st~0) .cse0 .cse1 (<= ~token~0 .cse2) (<= .cse2 ~token~0) (= 1 ~t1_pc~0) .cse3 .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse3 .cse4 (<= 2 ~m_st~0)) .cse10 (not (= 1 |old(~t1_pc~0)|)) .cse11)) (or .cse5 .cse6 .cse12 (and .cse13 .cse14 .cse15 .cse16 (= |old(~token~0)| ~token~0)) .cse17 .cse8 .cse9 .cse10) (or .cse5 .cse6 .cse17 .cse8 .cse9 .cse18 .cse10) (or .cse5 .cse6 .cse12 (not (= 0 |old(~m_st~0)|)) (and .cse13 .cse14 .cse15 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0)) .cse7 .cse8 .cse9 .cse18 .cse11)))) [2020-07-20 04:14:05,290 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-20 04:14:05,291 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse8 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse2 (and .cse8 .cse9 .cse10 .cse12 (= |old(~token~0)| ~token~0))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6) (or .cse0 .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse3 .cse4 .cse5 .cse15) (or .cse0 .cse1 .cse14 .cse3 .cse4 (and .cse9 .cse10 .cse11 (= 1 ~t1_pc~0) .cse12 .cse13) .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse15)))) [2020-07-20 04:14:05,291 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-20 04:14:05,291 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse7 (= 1 ~m_pc~0)) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4 (= |old(~token~0)| ~token~0)) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse9 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse10 .cse5 .cse6 (and .cse2 .cse3 (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) .cse4 (<= ~local~0 ~token~0)) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse11))) [2020-07-20 04:14:05,291 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-20 04:14:05,292 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse10 (= 1 ~m_pc~0)) (.cse16 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0))) (let ((.cse5 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not .cse17)) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (not (<= 2 ~T1_E~0))) (.cse12 (= 0 ~m_st~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (and .cse17 (not .cse10) .cse16 .cse3)) (.cse14 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9) (or .cse0 .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse11 .cse6 .cse7 (and .cse12 (<= ~token~0 ~local~0) .cse13 .cse1 .cse2 (<= ~local~0 ~token~0)) .cse10 .cse14) (or .cse0 .cse4 .cse11 .cse6 .cse7 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse16 .cse1)) .cse8 (and .cse16 .cse1 .cse3) .cse9 (not (= 1 |old(~t1_pc~0)|)) .cse14)))) [2020-07-20 04:14:05,292 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse7 (+ ~local~0 1))) (and .cse5 .cse6 (<= ~token~0 .cse7) (<= .cse7 ~token~0) (= 1 ~t1_pc~0))) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9) (or .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse11 .cse9) (or .cse0 (and .cse5 .cse6) .cse1 .cse3 .cse4 .cse11 .cse8) (or .cse0 .cse1 .cse10 .cse3 .cse4 .cse8))) [2020-07-20 04:14:05,292 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-20 04:14:05,292 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-20 04:14:05,293 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-20 04:14:05,293 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-20 04:14:05,293 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-20 04:14:05,293 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse0 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse1 .cse0 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-20 04:14:05,293 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse18 (<= 2 ~T1_E~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (+ ~local~0 1)) (.cse15 (<= 2 ~E_1~0))) (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse15)) (.cse2 (not (= 1 ~t1_pc~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse21 ~token~0))) (.cse14 (not (<= ~token~0 .cse21))) (.cse1 (and .cse16 .cse17)) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not .cse18)) (.cse9 (not (<= ~t1_pc~0 0))) (.cse20 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse0 .cse1 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse8) (let ((.cse12 (let ((.cse19 (not .cse5))) (or (and .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 (= 1 ~E_M~0) .cse18 .cse19))))) (or .cse0 .cse2 (and (= 0 ~m_st~0) .cse12) (and .cse12 (<= 2 ~m_st~0)) .cse5 .cse6 .cse13 .cse7 .cse14)) (or .cse1 .cse0 .cse5 .cse6 .cse20 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse4 .cse10 .cse5 .cse6 .cse13 .cse14) (or .cse1 .cse4 .cse5 .cse6 .cse9 .cse20 .cse11)))) [2020-07-20 04:14:05,294 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-20 04:14:05,294 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse0 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse1 .cse0 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-20 04:14:05,294 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-20 04:14:05,294 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-20 04:14:05,294 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-20 04:14:05,294 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-20 04:14:05,295 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-20 04:14:05,295 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-20 04:14:05,295 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-20 04:14:05,295 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-20 04:14:05,295 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-20 04:14:05,295 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-20 04:14:05,296 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse1 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (<= 2 ~m_st~0)) .cse2 .cse3) (or .cse4 .cse1 .cse2 .cse3 (not (<= ~t1_pc~0 0)) .cse5 (= 0 ~E_1~0)) (or .cse0 .cse6 .cse7 (not (<= ~token~0 ~local~0)) .cse4 (not (<= 2 ~t1_st~0)) .cse1 .cse2 .cse3 .cse5 (not (<= ~local~0 ~token~0))) (let ((.cse8 (+ ~local~0 1))) (or .cse0 .cse6 .cse7 .cse1 .cse2 .cse3 (not (<= .cse8 ~token~0)) (not (<= ~token~0 .cse8)))))) [2020-07-20 04:14:05,296 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-20 04:14:05,296 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-20 04:14:05,296 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-20 04:14:05,296 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 04:14:05,297 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 04:14:05,297 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 04:14:05,297 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-20 04:14:05,297 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-20 04:14:05,297 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-20 04:14:05,297 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-20 04:14:05,298 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-20 04:14:05,298 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) (not (= 0 |old(~m_st~0)|)) (not (<= ~token~0 ~local~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-20 04:14:05,298 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-20 04:14:05,298 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,298 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-20 04:14:05,299 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-20 04:14:05,299 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-20 04:14:05,299 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,299 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,299 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-20 04:14:05,300 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-20 04:14:05,300 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-20 04:14:05,300 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-20 04:14:05,300 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-20 04:14:05,300 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-20 04:14:05,301 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse10 (+ |old(~local~0)| 1))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse8 (not (<= |old(~token~0)| .cse10))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= .cse10 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (<= ~t1_pc~0 0))) (or (let ((.cse7 (+ ~local~0 1))) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 .cse7) (= ~local~0 |old(~local~0)|) (<= .cse7 ~token~0))) .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9)))) [2020-07-20 04:14:05,301 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (and .cse12 .cse9 .cse14 .cse13)) (.cse8 (and .cse12 (<= ~token~0 ~local~0) .cse14 (<= ~local~0 ~token~0) .cse13)) (.cse1 (not .cse14)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse11)) .cse2 .cse3 .cse4 .cse6 .cse7 (not (<= .cse11 |old(~token~0)|)) .cse8)) (or (and .cse12 .cse13) .cse1 .cse3 .cse4 .cse5 .cse6 .cse10)))) [2020-07-20 04:14:05,301 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse7)) .cse2 .cse3 .cse4 .cse6 (not (<= .cse7 |old(~token~0)|)))) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (<= ~t1_pc~0 0))))) [2020-07-20 04:14:05,302 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~local~0 |old(~local~0)|))) (let ((.cse3 (and .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~token~0)| ~token~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 .cse1 .cse2 .cse3 .cse5 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 (and .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))))) [2020-07-20 04:14:05,302 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse17 (+ |old(~local~0)| 1)) (.cse15 (not (= 1 ~m_pc~0))) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (not (= 0 ~E_1~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse16 (<= 2 ~E_M~0)) (.cse8 (<= ~local~0 ~token~0))) (let ((.cse13 (and .cse15 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t1_st~0) .cse16 .cse8)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= |old(~token~0)| .cse17))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse17 |old(~token~0)|))) (.cse1 (not .cse16)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~m_pc~0)|)) (.cse11 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse3 .cse9 (not (<= |old(~token~0)| |old(~local~0)|)) .cse10 .cse14 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse14 .cse11 .cse12) (or (and .cse15 .cse4 .cse5 .cse6) .cse1 .cse9 .cse10 .cse14 .cse11 (not (<= ~t1_pc~0 0)))))) [2020-07-20 04:14:05,302 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-20 04:14:05,303 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse11 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~m_pc~0)|)) (.cse9 (not (<= 2 ~T1_E~0))) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~local~0 |old(~local~0)|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~token~0)| ~token~0)) .cse8 .cse9 (not (<= ~t1_pc~0 0))) (let ((.cse12 (+ |old(~local~0)| 1))) (or (let ((.cse10 (+ ~local~0 1))) (and .cse3 .cse4 .cse5 .cse6 (<= ~token~0 .cse10) .cse7 (<= .cse10 ~token~0))) .cse11 .cse0 (not (<= |old(~token~0)| .cse12)) .cse13 .cse1 .cse2 .cse9 (not (<= .cse12 |old(~token~0)|)))) (or .cse11 .cse0 .cse13 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse8 (not (<= |old(~local~0)| |old(~token~0)|)) .cse9 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0))))) [2020-07-20 04:14:05,303 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-20 04:14:05,303 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-20 04:14:05,303 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~m_st~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (not (= 0 ~m_st~0))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (= 1 ~m_pc~0)) (.cse10 (not (<= ~local~0 ~token~0))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse6) (or .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse6) (or .cse0 .cse8 .cse12 .cse9 .cse1 .cse2 .cse11 .cse4 .cse7 .cse10 .cse6) (or .cse0 .cse12 .cse1 .cse11 .cse2 .cse4 .cse5 .cse7 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse8 .cse12 .cse1 .cse11 .cse2 .cse4 (not (<= .cse13 ~token~0)) (not (<= ~token~0 .cse13)) .cse6)) (or .cse0 .cse12 .cse9 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse6))) [2020-07-20 04:14:05,303 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-20 04:14:05,303 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 04:14:05,304 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~token~0 |old(~token~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-07-20 04:14:05,304 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 04:14:05,304 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~local~0 |old(~local~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (<= ~local~0 ~token~0))) (let ((.cse10 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22)) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 (= |old(~token~0)| ~token~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 |old(~t1_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5) (or .cse0 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse6 .cse13) (or .cse0 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse2 .cse11 .cse3 .cse9 .cse12 .cse4) (or .cse0 .cse8 .cse1 .cse10 .cse2 .cse11 .cse3 .cse9 .cse12 .cse4 .cse13) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse23)) .cse1 .cse2 .cse3 .cse4 (let ((.cse24 (+ ~local~0 1))) (and .cse15 .cse16 .cse17 .cse18 (<= ~token~0 .cse24) .cse19 (<= .cse24 ~token~0) .cse25 .cse21)) (not (<= .cse23 |old(~token~0)|)) .cse13))))) [2020-07-20 04:14:05,304 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-20 04:14:05,304 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-20 04:14:05,305 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-20 04:14:05,305 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-20 04:14:05,305 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-20 04:14:05,306 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse18 (= 0 ~M_E~0))) (let ((.cse0 (not (= 1 ~m_pc~0))) (.cse6 (<= 2 ~E_1~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse7 (not .cse18)) (.cse8 (<= 2 ~E_M~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse9 (<= 2 ~m_st~0))) (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (<= ~t1_pc~0 0)) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse17 (and .cse6 .cse2 (= 1 ~t1_pc~0) .cse7 .cse8 .cse4 .cse9)) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse22 (not (= 1 |old(~t1_pc~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse14 (not (<= 2 |old(~E_M~0)|))) (.cse10 (and .cse6 .cse0 .cse7 .cse8 .cse9)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse19 (not (<= 2 |old(~E_1~0)|))) (.cse13 (not (<= 2 ~T1_E~0))) (.cse21 (not (<= 2 |old(~m_st~0)|)))) (and (or (and (= 0 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~token~0)| ~token~0)) (and .cse6 .cse7 .cse8 .cse5 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse14 .cse10 .cse17 .cse19 .cse11 .cse18 .cse12 .cse13 .cse21 .cse22) (or .cse14 .cse15 .cse16 .cse10 .cse23 .cse19 .cse18 .cse20 .cse13) (let ((.cse24 (+ |old(~local~0)| 1))) (or .cse14 .cse16 .cse10 .cse17 (not (<= |old(~token~0)| .cse24)) .cse23 .cse19 .cse18 .cse13 (not (<= .cse24 |old(~token~0)|)) .cse22)) (or (and .cse1 .cse3 .cse5 .cse9) .cse14 .cse15 .cse10 .cse19 .cse18 .cse13 .cse21) (or .cse14 .cse16 .cse10 .cse17 .cse23 .cse19 .cse11 .cse18 .cse20 .cse12 .cse13 .cse22) (or .cse14 .cse10 .cse19 .cse18 .cse20 .cse13 .cse21) (or .cse14 .cse10 .cse23 .cse19 .cse18 .cse13 .cse21))))) [2020-07-20 04:14:05,306 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-20 04:14:05,307 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-20 04:14:05,307 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse3 (= 0 ~M_E~0))) (let ((.cse13 (<= 2 ~E_1~0)) (.cse22 (= 1 ~t1_pc~0)) (.cse16 (not .cse3)) (.cse18 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~E_M~0)) (.cse15 (<= 2 ~T1_E~0))) (let ((.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (= 1 |old(~m_pc~0)|)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not .cse15)) (.cse8 (let ((.cse27 (+ ~local~0 1))) (and .cse13 .cse15 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse22 .cse16 .cse18 .cse17))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse14 (not (= 1 ~m_pc~0))) (.cse20 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (<= ~token~0 ~local~0)) (.cse23 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (<= ~local~0 ~token~0)) (.cse25 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse2 .cse6 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9) (or .cse0 .cse2 .cse3 .cse10 .cse4 .cse5) (or .cse0 .cse11 .cse12 .cse1 .cse2 .cse3 .cse10 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse11 .cse12 .cse2 .cse6 .cse3 .cse10 .cse7 .cse4 .cse8 (and .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17 .cse18 .cse23 .cse24 .cse25) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse19)) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse0 .cse12 (not (<= |old(~token~0)| .cse26)) .cse1 .cse2 .cse3 .cse4 .cse8 (not (<= .cse26 |old(~token~0)|)) .cse9)) (or .cse0 .cse12 .cse1 .cse2 .cse6 .cse3 .cse10 .cse7 .cse4 .cse8 .cse9 (and .cse14 .cse20 .cse21 .cse22 .cse18 .cse23 .cse24 .cse25)))))) [2020-07-20 04:14:05,307 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-20 04:14:05,308 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse4 (= 0 ~M_E~0))) (let ((.cse34 (not (= 1 ~m_pc~0))) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse29 (not .cse4)) (.cse30 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~m_st~0))) (let ((.cse15 (not (= 1 |old(~t1_pc~0)|))) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse31)) (.cse10 (let ((.cse36 (+ ~local~0 1))) (and .cse32 .cse27 .cse28 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse29 .cse21 .cse30 .cse33))) (.cse11 (and .cse27 .cse28 .cse20 .cse29 .cse21 .cse30 .cse23 .cse31)) (.cse24 (= |old(~token~0)| ~token~0)) (.cse35 (and .cse27 .cse28 .cse19 .cse29 .cse30 .cse33 .cse22 .cse31)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse9 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse28)) (.cse6 (and .cse27 .cse34 .cse28 .cse29 .cse30 .cse31)) (.cse8 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse12 .cse4 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse15) (or .cse2 .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse4 .cse3 .cse9 .cse6 .cse15) (let ((.cse26 (+ |old(~local~0)| 1))) (or .cse2 .cse5 .cse14 .cse10 .cse0 .cse11 .cse25 (not (<= |old(~token~0)| .cse26)) .cse4 .cse3 .cse6 (not (<= .cse26 |old(~token~0)|)) .cse15)) (or (and .cse27 .cse28 .cse29 .cse30 .cse8 .cse31) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) .cse12 .cse13 .cse5 .cse14 .cse10 .cse0 .cse11 .cse1 .cse25 .cse4 .cse3 .cse9 .cse6 (and .cse32 .cse27 .cse28 .cse30 .cse33 .cse24 .cse34 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23)) (or (and .cse19 .cse22 .cse8 .cse31) .cse0 .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7) (or (and .cse32 .cse34 .cse19 .cse33 .cse22 .cse8) .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse33 .cse8 .cse31)))))) [2020-07-20 04:14:05,308 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-20 04:14:05,308 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-20 04:14:05,308 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-20 04:14:05,308 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-20 04:14:05,309 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-20 04:14:05,309 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-20 04:14:05,309 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-20 04:14:05,309 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-20 04:14:05,309 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-20 04:14:05,309 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-20 04:14:05,310 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-20 04:14:05,310 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 04:14:05,310 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 04:14:05,310 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-20 04:14:05,310 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-20 04:14:05,311 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 04:14:05,311 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-20 04:14:05,311 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 04:14:05,311 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,311 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-20 04:14:05,312 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,312 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse12 (= |old(~token~0)| ~token~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse13 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse11 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse4 .cse6 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse8 .cse2 .cse4 .cse6 .cse13) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse10 .cse13) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse1 .cse2 .cse4 .cse6 .cse11 .cse13) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse11))) [2020-07-20 04:14:05,313 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,313 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,313 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,314 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,314 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,314 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-20 04:14:05,315 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,315 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-20 04:14:05,315 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,315 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,316 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 04:14:05,316 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (<= ~t1_pc~0 0))) (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t1_st~0) .cse5 .cse6) (and .cse1 .cse3 .cse2 .cse4 .cse5 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 04:14:05,316 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,316 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-20 04:14:05,317 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,317 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-20 04:14:05,317 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= 0 ~M_E~0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~t1_pc~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7)) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse2 .cse4 .cse6 .cse8) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse11 .cse8) (and .cse1 .cse2 .cse4 .cse6 .cse12 .cse8) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse6 .cse7 .cse12))) [2020-07-20 04:14:05,318 INFO L264 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (or (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(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (= 0 ~M_E~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 04:14:05,318 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-20 04:14:05,318 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-20 04:14:05,318 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= .cse15 ~token~0))) (.cse9 (not (<= ~token~0 .cse15))) (.cse0 (not (<= 2 ~E_1~0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse11 (= 1 ~m_pc~0)) (.cse7 (not (= 1 ~t1_pc~0))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 ~t1_st~0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (= 0 ~E_1~0)) (.cse6 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 (not (= 0 ~m_st~0)) .cse1 .cse2 .cse4 .cse5 .cse8 .cse6 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse10 .cse6) (or .cse1 .cse4 .cse5 .cse10 .cse11 .cse12 .cse6) (or .cse0 .cse7 (= 1 ~E_M~0) .cse3 .cse4 .cse5 .cse8 .cse6 .cse9) (or .cse0 .cse7 .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6) (or .cse0 .cse3 .cse4 .cse5 .cse11 .cse6) (or .cse7 .cse13 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse14)))) [2020-07-20 04:14:05,318 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-20 04:14:05,319 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-20 04:14:05,319 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-20 04:14:05,319 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-20 04:14:05,319 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-20 04:14:05,319 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-20 04:14:05,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 04:14:05,320 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~m_pc~0)) (<= 2 ~T1_E~0) (<= ~token~0 ~local~0) (<= 2 ~E_M~0) (<= 2 ~M_E~0) (<= ~local~0 ~token~0) (<= ~t1_pc~0 0)) [2020-07-20 04:14:05,320 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 04:14:05,320 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 04:14:05,320 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-20 04:14:05,320 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 04:14:05,320 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-20 04:14:05,321 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-20 04:14:05,321 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 04:14:05,321 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 04:14:05,321 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-20 04:14:05,321 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-20 04:14:05,321 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 0 ~m_st~0)) (not (<= ~token~0 ~local~0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-20 04:14:05,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 04:14:05 BoogieIcfgContainer [2020-07-20 04:14:05,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 04:14:05,475 INFO L168 Benchmark]: Toolchain (without parser) took 70866.76 ms. Allocated memory was 144.7 MB in the beginning and 880.3 MB in the end (delta: 735.6 MB). Free memory was 102.3 MB in the beginning and 678.4 MB in the end (delta: -576.1 MB). Peak memory consumption was 763.8 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:05,476 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 04:14:05,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.16 ms. Allocated memory is still 144.7 MB. Free memory was 102.1 MB in the beginning and 88.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 04:14:05,480 INFO L168 Benchmark]: Boogie Preprocessor took 200.67 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 88.6 MB in the beginning and 180.3 MB in the end (delta: -91.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:05,481 INFO L168 Benchmark]: RCFGBuilder took 789.86 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 148.6 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:05,481 INFO L168 Benchmark]: TraceAbstraction took 69372.40 ms. Allocated memory was 203.4 MB in the beginning and 880.3 MB in the end (delta: 676.9 MB). Free memory was 148.6 MB in the beginning and 678.4 MB in the end (delta: -529.8 MB). Peak memory consumption was 751.3 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:05,488 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 489.16 ms. Allocated memory is still 144.7 MB. Free memory was 102.1 MB in the beginning and 88.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 200.67 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 88.6 MB in the beginning and 180.3 MB in the end (delta: -91.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.86 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 148.6 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69372.40 ms. Allocated memory was 203.4 MB in the beginning and 880.3 MB in the end (delta: 676.9 MB). Free memory was 148.6 MB in the beginning and 678.4 MB in the end (delta: -529.8 MB). Peak memory consumption was 751.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 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0) && ((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc)))) && ((((((((((((((((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || ((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token))) && (((((((((((E_1 == \old(E_1) && E_M == \old(E_M)) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((((((((((0 == m_st && !(1 == m_pc)) && E_1 == \old(E_1)) && 2 <= t1_st) && E_M == \old(E_M)) && t1_pc <= 0) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) && 2 <= m_st)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) && (((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1))) && ((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((!(2 <= E_M) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local <= token)) || (0 <= __retres1 && __retres1 <= 0))) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(1 == t1_pc) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0)) || !(local <= token)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st)) && (((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0))) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st))) && (((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && !(0 == M_E)) && 2 <= E_M) || !(2 <= E_1)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st)))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0) && ((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc)))) && ((((((((((((((((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st) || ((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token))) && (((((((((((E_1 == \old(E_1) && E_M == \old(E_M)) && t1_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && E_1 == \old(E_1)) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && (((((((((((((((0 == m_st && !(1 == m_pc)) && E_1 == \old(E_1)) && 2 <= t1_st) && E_M == \old(E_M)) && t1_pc <= 0) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) && 2 <= m_st)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || ((2 <= t1_st && E_M == \old(E_M)) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc) || !(\old(token) <= local))) && ((((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(m_st))) || ((2 <= E_M && 2 <= t1_st) && 2 <= m_st)) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 == m_st && 2 <= E_1) && \old(T1_E) == T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || (((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || (((((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 2 <= E_M) && local <= token) && t1_pc <= 0) && \old(token) == token)) || !(\old(token) <= \old(local))) || (((((2 <= E_1 && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) <= \old(token))) || ((((((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && local <= token) && \old(token) == token)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || (((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E))) || (((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && t1_pc <= 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local + 1) && local == \old(local)) && local + 1 <= token) || !(1 == t1_pc)) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_1) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) && ((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1)) && ((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(local <= token))) && (((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || !(token <= local + 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(0 == M_E)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token)))) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && token <= local) && local <= token)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2265 SDtfs, 4749 SDslu, 1153 SDs, 0 SdLazy, 7828 SolverSat, 2488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1573 GetRequests, 1391 SyntacticMatches, 4 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1456occurred 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: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 985 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3447 PreInvPairs, 4665 NumberOfFragments, 12964 HoareAnnotationTreeSize, 3447 FomulaSimplifications, 26849855 FormulaSimplificationTreeSizeReduction, 13.3s HoareSimplificationTime, 62 FomulaSimplificationsInter, 424619 FormulaSimplificationTreeSizeReductionInter, 26.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2493 NumberOfCodeBlocks, 2147 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2474 ConstructedInterpolants, 0 QuantifiedInterpolants, 760279 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2646 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 979/1054 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...