/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 NUM_FUNCTIONS --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/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 23:55:31,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 23:55:31,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 23:55:31,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 23:55:31,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 23:55:31,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 23:55:31,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 23:55:31,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 23:55:31,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 23:55:31,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 23:55:31,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 23:55:31,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 23:55:31,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 23:55:31,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 23:55:31,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 23:55:31,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 23:55:31,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 23:55:31,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 23:55:31,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 23:55:31,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 23:55:31,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 23:55:31,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 23:55:31,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 23:55:31,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 23:55:31,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 23:55:31,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 23:55:31,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 23:55:31,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 23:55:31,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 23:55:31,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 23:55:31,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 23:55:31,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 23:55:31,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 23:55:31,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 23:55:31,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 23:55:31,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 23:55:31,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 23:55:31,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 23:55:31,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 23:55:31,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 23:55:31,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 23:55:31,425 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-19 23:55:31,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 23:55:31,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 23:55:31,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 23:55:31,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 23:55:31,444 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 23:55:31,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 23:55:31,445 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 23:55:31,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 23:55:31,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 23:55:31,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 23:55:31,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 23:55:31,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 23:55:31,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 23:55:31,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 23:55:31,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 23:55:31,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 23:55:31,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 23:55:31,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 23:55:31,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 23:55:31,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 23:55:31,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 23:55:31,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 23:55:31,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 23:55:31,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 23:55:31,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 23:55:31,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 23:55:31,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 23:55:31,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 23:55:31,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 23:55:31,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS 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-19 23:55:31,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 23:55:31,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 23:55:31,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 23:55:31,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 23:55:31,812 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 23:55:31,813 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-19 23:55:31,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33168b3c/845c1e0f80644b90857ce367cab5a21d/FLAGce5e6c17e [2020-07-19 23:55:32,479 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 23:55:32,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-19 23:55:32,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33168b3c/845c1e0f80644b90857ce367cab5a21d/FLAGce5e6c17e [2020-07-19 23:55:32,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33168b3c/845c1e0f80644b90857ce367cab5a21d [2020-07-19 23:55:32,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 23:55:32,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 23:55:32,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 23:55:32,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 23:55:32,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 23:55:32,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:55:32" (1/1) ... [2020-07-19 23:55:32,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e20604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:32, skipping insertion in model container [2020-07-19 23:55:32,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:55:32" (1/1) ... [2020-07-19 23:55:32,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 23:55:32,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 23:55:33,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:55:33,185 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 23:55:33,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:55:33,365 INFO L208 MainTranslator]: Completed translation [2020-07-19 23:55:33,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33 WrapperNode [2020-07-19 23:55:33,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 23:55:33,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 23:55:33,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 23:55:33,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 23:55:33,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (1/1) ... [2020-07-19 23:55:33,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 23:55:33,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 23:55:33,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 23:55:33,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 23:55:33,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (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-19 23:55:33,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 23:55:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 23:55:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-19 23:55:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-19 23:55:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-19 23:55:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-19 23:55:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-19 23:55:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-19 23:55:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-19 23:55:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-19 23:55:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-19 23:55:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-19 23:55:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-19 23:55:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-19 23:55:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-19 23:55:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-19 23:55:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-19 23:55:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-19 23:55:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-19 23:55:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-19 23:55:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 23:55:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 23:55:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 23:55:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-19 23:55:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-19 23:55:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-19 23:55:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-19 23:55:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-19 23:55:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-19 23:55:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-19 23:55:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-19 23:55:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-19 23:55:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-19 23:55:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-19 23:55:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-19 23:55:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-19 23:55:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-19 23:55:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-19 23:55:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-19 23:55:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-19 23:55:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-19 23:55:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 23:55:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 23:55:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 23:55:34,112 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 23:55:34,113 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-19 23:55:34,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:55:34 BoogieIcfgContainer [2020-07-19 23:55:34,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 23:55:34,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 23:55:34,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 23:55:34,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 23:55:34,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:55:32" (1/3) ... [2020-07-19 23:55:34,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71490969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:55:34, skipping insertion in model container [2020-07-19 23:55:34,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:33" (2/3) ... [2020-07-19 23:55:34,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71490969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:55:34, skipping insertion in model container [2020-07-19 23:55:34,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:55:34" (3/3) ... [2020-07-19 23:55:34,130 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-07-19 23:55:34,143 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 23:55:34,154 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 23:55:34,171 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 23:55:34,202 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 23:55:34,202 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 23:55:34,202 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 23:55:34,202 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 23:55:34,203 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 23:55:34,203 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 23:55:34,203 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 23:55:34,203 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 23:55:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-07-19 23:55:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-19 23:55:34,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:34,245 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] [2020-07-19 23:55:34,245 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2020-07-19 23:55:34,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:34,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139563947] [2020-07-19 23:55:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:34,805 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-19 23:55:34,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139563947] [2020-07-19 23:55:34,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:34,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 23:55:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988965924] [2020-07-19 23:55:34,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 23:55:34,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:34,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 23:55:34,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:55:34,840 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 9 states. [2020-07-19 23:55:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:37,049 INFO L93 Difference]: Finished difference Result 479 states and 724 transitions. [2020-07-19 23:55:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:55:37,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-19 23:55:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:37,071 INFO L225 Difference]: With dead ends: 479 [2020-07-19 23:55:37,072 INFO L226 Difference]: Without dead ends: 340 [2020-07-19 23:55:37,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-19 23:55:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-19 23:55:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2020-07-19 23:55:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-19 23:55:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2020-07-19 23:55:37,194 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 75 [2020-07-19 23:55:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:37,195 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2020-07-19 23:55:37,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 23:55:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2020-07-19 23:55:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-19 23:55:37,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:37,200 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] [2020-07-19 23:55:37,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 23:55:37,201 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1022106246, now seen corresponding path program 1 times [2020-07-19 23:55:37,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:37,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422446191] [2020-07-19 23:55:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,490 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-19 23:55:37,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422446191] [2020-07-19 23:55:37,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:37,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:37,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916969392] [2020-07-19 23:55:37,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:37,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:37,495 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand 10 states. [2020-07-19 23:55:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:38,583 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2020-07-19 23:55:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 23:55:38,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-19 23:55:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:38,590 INFO L225 Difference]: With dead ends: 545 [2020-07-19 23:55:38,590 INFO L226 Difference]: Without dead ends: 331 [2020-07-19 23:55:38,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:55:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-07-19 23:55:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2020-07-19 23:55:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-19 23:55:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2020-07-19 23:55:38,670 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 75 [2020-07-19 23:55:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:38,671 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2020-07-19 23:55:38,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2020-07-19 23:55:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-19 23:55:38,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:38,680 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] [2020-07-19 23:55:38,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 23:55:38,681 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash -437656962, now seen corresponding path program 1 times [2020-07-19 23:55:38,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:38,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103731250] [2020-07-19 23:55:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:38,919 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-19 23:55:38,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103731250] [2020-07-19 23:55:38,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:38,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:38,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566493712] [2020-07-19 23:55:38,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:38,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:38,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:38,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:38,922 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand 10 states. [2020-07-19 23:55:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:40,371 INFO L93 Difference]: Finished difference Result 548 states and 738 transitions. [2020-07-19 23:55:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 23:55:40,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-19 23:55:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:40,384 INFO L225 Difference]: With dead ends: 548 [2020-07-19 23:55:40,385 INFO L226 Difference]: Without dead ends: 335 [2020-07-19 23:55:40,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-19 23:55:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-07-19 23:55:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 238. [2020-07-19 23:55:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-19 23:55:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2020-07-19 23:55:40,471 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 75 [2020-07-19 23:55:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:40,474 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2020-07-19 23:55:40,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2020-07-19 23:55:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-19 23:55:40,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:40,480 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] [2020-07-19 23:55:40,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 23:55:40,480 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2011943168, now seen corresponding path program 1 times [2020-07-19 23:55:40,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:40,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119928973] [2020-07-19 23:55:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:40,701 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-19 23:55:40,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119928973] [2020-07-19 23:55:40,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:40,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 23:55:40,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188036344] [2020-07-19 23:55:40,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 23:55:40,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 23:55:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:55:40,706 INFO L87 Difference]: Start difference. First operand 238 states and 297 transitions. Second operand 9 states. [2020-07-19 23:55:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:42,611 INFO L93 Difference]: Finished difference Result 848 states and 1162 transitions. [2020-07-19 23:55:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 23:55:42,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-19 23:55:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:42,625 INFO L225 Difference]: With dead ends: 848 [2020-07-19 23:55:42,625 INFO L226 Difference]: Without dead ends: 630 [2020-07-19 23:55:42,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-07-19 23:55:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-07-19 23:55:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 459. [2020-07-19 23:55:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-07-19 23:55:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 573 transitions. [2020-07-19 23:55:42,718 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 573 transitions. Word has length 75 [2020-07-19 23:55:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:42,719 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 573 transitions. [2020-07-19 23:55:42,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 23:55:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 573 transitions. [2020-07-19 23:55:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-19 23:55:42,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:42,722 INFO L422 BasicCegarLoop]: trace histogram [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-19 23:55:42,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 23:55:42,727 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -3480132, now seen corresponding path program 1 times [2020-07-19 23:55:42,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:42,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999085544] [2020-07-19 23:55:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-19 23:55:42,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999085544] [2020-07-19 23:55:43,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:43,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 23:55:43,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761087372] [2020-07-19 23:55:43,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 23:55:43,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 23:55:43,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:55:43,002 INFO L87 Difference]: Start difference. First operand 459 states and 573 transitions. Second operand 11 states. [2020-07-19 23:55:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:44,557 INFO L93 Difference]: Finished difference Result 1125 states and 1520 transitions. [2020-07-19 23:55:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:55:44,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-19 23:55:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:44,566 INFO L225 Difference]: With dead ends: 1125 [2020-07-19 23:55:44,568 INFO L226 Difference]: Without dead ends: 686 [2020-07-19 23:55:44,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-07-19 23:55:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-07-19 23:55:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-07-19 23:55:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-07-19 23:55:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2020-07-19 23:55:44,646 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 93 [2020-07-19 23:55:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:44,647 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2020-07-19 23:55:44,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 23:55:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2020-07-19 23:55:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-19 23:55:44,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:44,649 INFO L422 BasicCegarLoop]: trace histogram [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-19 23:55:44,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 23:55:44,650 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2020-07-19 23:55:44,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:44,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568436476] [2020-07-19 23:55:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-19 23:55:44,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568436476] [2020-07-19 23:55:44,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:44,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 23:55:44,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868343484] [2020-07-19 23:55:44,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 23:55:44,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 23:55:44,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:55:44,840 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 11 states. [2020-07-19 23:55:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:46,734 INFO L93 Difference]: Finished difference Result 1387 states and 1883 transitions. [2020-07-19 23:55:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-19 23:55:46,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-19 23:55:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:46,744 INFO L225 Difference]: With dead ends: 1387 [2020-07-19 23:55:46,745 INFO L226 Difference]: Without dead ends: 859 [2020-07-19 23:55:46,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2020-07-19 23:55:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-07-19 23:55:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2020-07-19 23:55:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-07-19 23:55:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 788 transitions. [2020-07-19 23:55:46,844 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 788 transitions. Word has length 93 [2020-07-19 23:55:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:46,846 INFO L479 AbstractCegarLoop]: Abstraction has 647 states and 788 transitions. [2020-07-19 23:55:46,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 23:55:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 788 transitions. [2020-07-19 23:55:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-19 23:55:46,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:46,849 INFO L422 BasicCegarLoop]: trace histogram [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-19 23:55:46,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 23:55:46,850 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2020-07-19 23:55:46,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:46,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994601900] [2020-07-19 23:55:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 23:55:47,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994601900] [2020-07-19 23:55:47,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502528819] [2020-07-19 23:55:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1af6ff1b 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-19 23:55:47,148 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1af6ff1b issued 1 check-sat command(s) [2020-07-19 23:55:47,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:55:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:55:47,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:55:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 23:55:47,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:55:47,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-07-19 23:55:47,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672438202] [2020-07-19 23:55:47,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:55:47,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:47,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:55:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:55:47,305 INFO L87 Difference]: Start difference. First operand 647 states and 788 transitions. Second operand 3 states. [2020-07-19 23:55:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:47,472 INFO L93 Difference]: Finished difference Result 1832 states and 2257 transitions. [2020-07-19 23:55:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:55:47,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-07-19 23:55:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:47,483 INFO L225 Difference]: With dead ends: 1832 [2020-07-19 23:55:47,483 INFO L226 Difference]: Without dead ends: 932 [2020-07-19 23:55:47,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:55:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-07-19 23:55:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 868. [2020-07-19 23:55:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-07-19 23:55:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2020-07-19 23:55:47,618 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 93 [2020-07-19 23:55:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:47,619 INFO L479 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2020-07-19 23:55:47,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:55:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2020-07-19 23:55:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-19 23:55:47,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:47,623 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:55:47,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-19 23:55:47,838 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash 785362142, now seen corresponding path program 1 times [2020-07-19 23:55:47,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:47,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762842371] [2020-07-19 23:55:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-19 23:55:48,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762842371] [2020-07-19 23:55:48,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840124737] [2020-07-19 23:55:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6ba71be5 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-19 23:55:48,067 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6ba71be5 issued 1 check-sat command(s) [2020-07-19 23:55:48,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:55:48,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 23:55:48,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:55:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 23:55:48,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:55:48,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-19 23:55:48,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595959420] [2020-07-19 23:55:48,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:55:48,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:48,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:55:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:48,108 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 3 states. [2020-07-19 23:55:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:48,246 INFO L93 Difference]: Finished difference Result 2320 states and 2806 transitions. [2020-07-19 23:55:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:55:48,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-07-19 23:55:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:48,259 INFO L225 Difference]: With dead ends: 2320 [2020-07-19 23:55:48,259 INFO L226 Difference]: Without dead ends: 1473 [2020-07-19 23:55:48,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-07-19 23:55:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1400. [2020-07-19 23:55:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2020-07-19 23:55:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1657 transitions. [2020-07-19 23:55:48,399 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1657 transitions. Word has length 128 [2020-07-19 23:55:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:48,400 INFO L479 AbstractCegarLoop]: Abstraction has 1400 states and 1657 transitions. [2020-07-19 23:55:48,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:55:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1657 transitions. [2020-07-19 23:55:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-07-19 23:55:48,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:48,404 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:55:48,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:55:48,618 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2020-07-19 23:55:48,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:48,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567379534] [2020-07-19 23:55:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a3f2be1 [2020-07-19 23:55:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:55:48,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:55:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:55:48,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:55:48,708 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-19 23:55:48,709 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 23:55:48,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-19 23:55:48,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:55:48 BoogieIcfgContainer [2020-07-19 23:55:48,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 23:55:48,823 INFO L168 Benchmark]: Toolchain (without parser) took 15980.24 ms. Allocated memory was 142.6 MB in the beginning and 404.8 MB in the end (delta: 262.1 MB). Free memory was 98.5 MB in the beginning and 86.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 274.4 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,824 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 142.6 MB. Free memory was 117.5 MB in the beginning and 117.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.45 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 178.4 MB in the end (delta: -80.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,825 INFO L168 Benchmark]: Boogie Preprocessor took 54.09 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 175.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,826 INFO L168 Benchmark]: RCFGBuilder took 692.86 ms. Allocated memory is still 200.3 MB. Free memory was 175.5 MB in the beginning and 146.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,827 INFO L168 Benchmark]: TraceAbstraction took 14698.53 ms. Allocated memory was 200.3 MB in the beginning and 404.8 MB in the end (delta: 204.5 MB). Free memory was 145.4 MB in the beginning and 86.2 MB in the end (delta: 59.2 MB). Peak memory consumption was 263.6 MB. Max. memory is 7.1 GB. [2020-07-19 23:55:48,831 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.27 ms. Allocated memory is still 142.6 MB. Free memory was 117.5 MB in the beginning and 117.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 522.45 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 178.4 MB in the end (delta: -80.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.09 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 175.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 692.86 ms. Allocated memory is still 200.3 MB. Free memory was 175.5 MB in the beginning and 146.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14698.53 ms. Allocated memory was 200.3 MB in the beginning and 404.8 MB in the end (delta: 204.5 MB). Free memory was 145.4 MB in the beginning and 86.2 MB in the end (delta: 59.2 MB). Peak memory consumption was 263.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=7, \old(M_E)=12, \old(m_i)=6, \old(m_pc)=10, \old(m_st)=9, \old(T1_E)=4, \old(t1_i)=11, \old(t1_pc)=8, \old(t1_st)=5, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=3] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1346 SDtfs, 3574 SDslu, 717 SDs, 0 SdLazy, 5735 SolverSat, 1976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1400occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 961 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 167785 SizeOfPredicates, 1 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 118/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...