/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 00:32:49,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 00:32:49,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 00:32:49,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 00:32:49,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 00:32:49,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 00:32:49,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 00:32:49,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 00:32:49,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 00:32:49,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 00:32:49,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 00:32:49,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 00:32:49,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 00:32:49,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 00:32:49,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 00:32:49,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 00:32:49,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 00:32:49,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 00:32:49,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 00:32:49,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 00:32:49,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 00:32:49,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 00:32:49,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 00:32:49,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 00:32:49,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 00:32:49,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 00:32:49,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 00:32:49,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 00:32:49,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 00:32:49,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 00:32:49,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 00:32:49,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 00:32:49,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 00:32:49,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 00:32:49,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 00:32:49,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 00:32:49,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 00:32:49,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 00:32:49,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 00:32:49,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 00:32:49,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 00:32:49,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-24 00:32:49,688 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 00:32:49,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 00:32:49,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 00:32:49,691 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 00:32:49,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 00:32:49,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 00:32:49,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 00:32:49,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 00:32:49,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 00:32:49,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 00:32:49,693 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 00:32:49,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 00:32:49,693 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 00:32:49,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 00:32:49,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 00:32:49,694 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 00:32:49,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 00:32:49,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 00:32:49,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:32:49,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 00:32:49,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 00:32:49,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 00:32:49,696 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-24 00:32:50,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 00:32:50,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 00:32:50,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 00:32:50,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 00:32:50,114 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 00:32:50,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2021-02-24 00:32:50,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f343504/03ba775dc40f48ada5b58b3b2ac2b5d5/FLAG054aa3f0d [2021-02-24 00:32:50,883 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 00:32:50,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2021-02-24 00:32:50,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f343504/03ba775dc40f48ada5b58b3b2ac2b5d5/FLAG054aa3f0d [2021-02-24 00:32:51,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f343504/03ba775dc40f48ada5b58b3b2ac2b5d5 [2021-02-24 00:32:51,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 00:32:51,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 00:32:51,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:51,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 00:32:51,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 00:32:51,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b96f890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51, skipping insertion in model container [2021-02-24 00:32:51,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 00:32:51,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 00:32:51,539 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c[401,414] [2021-02-24 00:32:51,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:51,676 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 00:32:51,698 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c[401,414] [2021-02-24 00:32:51,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:51,766 INFO L208 MainTranslator]: Completed translation [2021-02-24 00:32:51,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51 WrapperNode [2021-02-24 00:32:51,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:51,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 00:32:51,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 00:32:51,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 00:32:51,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (1/1) ... [2021-02-24 00:32:51,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 00:32:51,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 00:32:51,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 00:32:51,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 00:32:51,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (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 [2021-02-24 00:32:51,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 00:32:51,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 00:32:51,964 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 00:32:51,964 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-24 00:32:51,964 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-24 00:32:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-24 00:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-24 00:32:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-24 00:32:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-24 00:32:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-24 00:32:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-24 00:32:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 00:32:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-24 00:32:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-24 00:32:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-24 00:32:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 00:32:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 00:32:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 00:32:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 00:32:52,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 00:32:52,480 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-02-24 00:32:52,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:52 BoogieIcfgContainer [2021-02-24 00:32:52,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 00:32:52,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 00:32:52,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 00:32:52,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 00:32:52,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:32:51" (1/3) ... [2021-02-24 00:32:52,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f6406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:52, skipping insertion in model container [2021-02-24 00:32:52,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:51" (2/3) ... [2021-02-24 00:32:52,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f6406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:52, skipping insertion in model container [2021-02-24 00:32:52,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:52" (3/3) ... [2021-02-24 00:32:52,494 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2021-02-24 00:32:52,501 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 00:32:52,507 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 00:32:52,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 00:32:52,554 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 00:32:52,554 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 00:32:52,554 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-24 00:32:52,554 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 00:32:52,554 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 00:32:52,555 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 00:32:52,555 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 00:32:52,555 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 00:32:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2021-02-24 00:32:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-02-24 00:32:52,608 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:52,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:52,610 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2035889959, now seen corresponding path program 1 times [2021-02-24 00:32:52,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:52,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072238748] [2021-02-24 00:32:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,127 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-24 00:32:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,265 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 00:32:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,291 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-02-24 00:32:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,310 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-24 00:32:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,327 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,328 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,343 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,344 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-02-24 00:32:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-02-24 00:32:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:53,371 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,371 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:53,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:53,373 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:32:53,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072238748] [2021-02-24 00:32:53,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:53,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:32:53,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430776312] [2021-02-24 00:32:53,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:32:53,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:32:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:32:53,432 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 8 states. [2021-02-24 00:32:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:56,232 INFO L93 Difference]: Finished difference Result 809 states and 1163 transitions. [2021-02-24 00:32:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-24 00:32:56,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2021-02-24 00:32:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:56,257 INFO L225 Difference]: With dead ends: 809 [2021-02-24 00:32:56,257 INFO L226 Difference]: Without dead ends: 612 [2021-02-24 00:32:56,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2021-02-24 00:32:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-02-24 00:32:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 358. [2021-02-24 00:32:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-02-24 00:32:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 442 transitions. [2021-02-24 00:32:56,514 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 442 transitions. Word has length 110 [2021-02-24 00:32:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:56,515 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 442 transitions. [2021-02-24 00:32:56,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:32:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 442 transitions. [2021-02-24 00:32:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-02-24 00:32:56,522 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:56,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:56,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 00:32:56,523 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1391662035, now seen corresponding path program 1 times [2021-02-24 00:32:56,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:56,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379495203] [2021-02-24 00:32:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,599 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,600 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,601 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,601 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:56,605 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-24 00:32:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,703 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,704 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:32:56,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 00:32:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,733 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:56,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-02-24 00:32:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-24 00:32:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,775 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-02-24 00:32:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-02-24 00:32:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,791 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:32:56,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379495203] [2021-02-24 00:32:56,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:56,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-24 00:32:56,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636329567] [2021-02-24 00:32:56,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:32:56,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:32:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:32:56,814 INFO L87 Difference]: Start difference. First operand 358 states and 442 transitions. Second operand 8 states. [2021-02-24 00:32:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:58,300 INFO L93 Difference]: Finished difference Result 844 states and 1092 transitions. [2021-02-24 00:32:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-24 00:32:58,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2021-02-24 00:32:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:58,307 INFO L225 Difference]: With dead ends: 844 [2021-02-24 00:32:58,307 INFO L226 Difference]: Without dead ends: 529 [2021-02-24 00:32:58,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-02-24 00:32:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-02-24 00:32:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 349. [2021-02-24 00:32:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2021-02-24 00:32:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 427 transitions. [2021-02-24 00:32:58,400 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 427 transitions. Word has length 111 [2021-02-24 00:32:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:58,403 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 427 transitions. [2021-02-24 00:32:58,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:32:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 427 transitions. [2021-02-24 00:32:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-02-24 00:32:58,414 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:58,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:58,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 00:32:58,415 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1382199411, now seen corresponding path program 1 times [2021-02-24 00:32:58,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:58,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921308113] [2021-02-24 00:32:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,498 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,502 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,503 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,505 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,586 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:58,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-24 00:32:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 00:32:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,602 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,603 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,618 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,618 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-02-24 00:32:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,635 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,636 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-24 00:32:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-02-24 00:32:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-02-24 00:32:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:58,664 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:58,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:32:58,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921308113] [2021-02-24 00:32:58,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:58,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-24 00:32:58,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97782122] [2021-02-24 00:32:58,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-24 00:32:58,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:58,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-24 00:32:58,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-24 00:32:58,687 INFO L87 Difference]: Start difference. First operand 349 states and 427 transitions. Second operand 7 states. [2021-02-24 00:33:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:00,682 INFO L93 Difference]: Finished difference Result 1287 states and 1730 transitions. [2021-02-24 00:33:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-24 00:33:00,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2021-02-24 00:33:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:00,691 INFO L225 Difference]: With dead ends: 1287 [2021-02-24 00:33:00,691 INFO L226 Difference]: Without dead ends: 981 [2021-02-24 00:33:00,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:33:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-02-24 00:33:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 670. [2021-02-24 00:33:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2021-02-24 00:33:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 833 transitions. [2021-02-24 00:33:00,851 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 833 transitions. Word has length 115 [2021-02-24 00:33:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:00,852 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 833 transitions. [2021-02-24 00:33:00,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-24 00:33:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 833 transitions. [2021-02-24 00:33:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-02-24 00:33:00,855 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:00,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:00,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 00:33:00,856 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:00,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 654511625, now seen corresponding path program 1 times [2021-02-24 00:33:00,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:00,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950043380] [2021-02-24 00:33:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,905 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:00,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:00,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:00,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,987 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:00,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:00,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:00,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-24 00:33:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 00:33:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,036 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-02-24 00:33:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,054 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,055 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-24 00:33:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-02-24 00:33:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-02-24 00:33:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,099 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,119 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:01,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-02-24 00:33:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:01,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:01,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-02-24 00:33:01,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950043380] [2021-02-24 00:33:01,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:01,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-24 00:33:01,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217258878] [2021-02-24 00:33:01,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-24 00:33:01,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-24 00:33:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-02-24 00:33:01,161 INFO L87 Difference]: Start difference. First operand 670 states and 833 transitions. Second operand 10 states. [2021-02-24 00:33:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:08,650 INFO L93 Difference]: Finished difference Result 5675 states and 8243 transitions. [2021-02-24 00:33:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-02-24 00:33:08,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2021-02-24 00:33:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:08,696 INFO L225 Difference]: With dead ends: 5675 [2021-02-24 00:33:08,696 INFO L226 Difference]: Without dead ends: 5047 [2021-02-24 00:33:08,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=709, Invalid=2153, Unknown=0, NotChecked=0, Total=2862 [2021-02-24 00:33:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2021-02-24 00:33:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 3834. [2021-02-24 00:33:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3834 states. [2021-02-24 00:33:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 5099 transitions. [2021-02-24 00:33:09,677 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 5099 transitions. Word has length 147 [2021-02-24 00:33:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:09,678 INFO L480 AbstractCegarLoop]: Abstraction has 3834 states and 5099 transitions. [2021-02-24 00:33:09,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-24 00:33:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5099 transitions. [2021-02-24 00:33:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-02-24 00:33:09,688 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:09,688 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:09,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 00:33:09,689 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash 592410842, now seen corresponding path program 1 times [2021-02-24 00:33:09,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:09,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228264807] [2021-02-24 00:33:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,743 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:09,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-24 00:33:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,823 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,824 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 00:33:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-02-24 00:33:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-24 00:33:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,869 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,873 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-02-24 00:33:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-02-24 00:33:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,885 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,886 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-02-24 00:33:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,903 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:09,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-02-24 00:33:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-02-24 00:33:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,951 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-02-24 00:33:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:09,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:09,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:09,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:10,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:10,030 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-24 00:33:10,032 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-24 00:33:10,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:10,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:10,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:10,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:10,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:10,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,075 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:10,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:10,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-02-24 00:33:10,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228264807] [2021-02-24 00:33:10,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:10,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-24 00:33:10,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086812258] [2021-02-24 00:33:10,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-24 00:33:10,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-24 00:33:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-02-24 00:33:10,153 INFO L87 Difference]: Start difference. First operand 3834 states and 5099 transitions. Second operand 13 states. [2021-02-24 00:33:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:15,257 INFO L93 Difference]: Finished difference Result 8368 states and 11746 transitions. [2021-02-24 00:33:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-02-24 00:33:15,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 189 [2021-02-24 00:33:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:15,290 INFO L225 Difference]: With dead ends: 8368 [2021-02-24 00:33:15,290 INFO L226 Difference]: Without dead ends: 3616 [2021-02-24 00:33:15,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=556, Invalid=1606, Unknown=0, NotChecked=0, Total=2162 [2021-02-24 00:33:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2021-02-24 00:33:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2522. [2021-02-24 00:33:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2021-02-24 00:33:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3197 transitions. [2021-02-24 00:33:15,997 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3197 transitions. Word has length 189 [2021-02-24 00:33:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:15,998 INFO L480 AbstractCegarLoop]: Abstraction has 2522 states and 3197 transitions. [2021-02-24 00:33:15,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-24 00:33:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3197 transitions. [2021-02-24 00:33:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-02-24 00:33:16,004 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:16,005 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:16,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 00:33:16,006 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -569679469, now seen corresponding path program 1 times [2021-02-24 00:33:16,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:16,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579733534] [2021-02-24 00:33:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:33:16,040 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:33:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:33:16,067 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:33:16,163 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2021-02-24 00:33:16,163 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-24 00:33:16,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 00:33:16,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:33:16 BoogieIcfgContainer [2021-02-24 00:33:16,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 00:33:16,353 INFO L168 Benchmark]: Toolchain (without parser) took 25128.87 ms. Allocated memory was 151.0 MB in the beginning and 685.8 MB in the end (delta: 534.8 MB). Free memory was 127.8 MB in the beginning and 476.8 MB in the end (delta: -348.9 MB). Peak memory consumption was 186.9 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:16,354 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 00:33:16,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.20 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 114.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:16,355 INFO L168 Benchmark]: Boogie Preprocessor took 66.66 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 112.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:16,355 INFO L168 Benchmark]: RCFGBuilder took 648.27 ms. Allocated memory is still 151.0 MB. Free memory was 112.2 MB in the beginning and 108.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:16,355 INFO L168 Benchmark]: TraceAbstraction took 23865.70 ms. Allocated memory was 151.0 MB in the beginning and 685.8 MB in the end (delta: 534.8 MB). Free memory was 107.8 MB in the beginning and 476.8 MB in the end (delta: -369.0 MB). Peak memory consumption was 165.8 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:16,359 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 524.20 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 114.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.66 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 112.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 648.27 ms. Allocated memory is still 151.0 MB. Free memory was 112.2 MB in the beginning and 108.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23865.70 ms. Allocated memory was 151.0 MB in the beginning and 685.8 MB in the end (delta: 534.8 MB). Free memory was 107.8 MB in the beginning and 476.8 MB in the end (delta: -369.0 MB). Peak memory consumption was 165.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=63, t1_pc=54, t1_st=51] [L18] int t1_pc = 0; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=63, t1_pc=0, t1_st=51] [L19] int m_st ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=51] [L20] int t1_st ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=0] [L21] int m_i ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=0] [L22] int t1_i ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0] [L23] int M_E = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0] [L24] int T1_E = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L25] int E_1 = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, 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] [L441] 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] [L445] 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] [L356] m_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=0, t1_pc=0, t1_st=0] [L357] 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] [L445] 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] [L446] 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] [L382] int kernel_st ; 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] [L383] 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] [L384] 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] [L388] 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] [L389] 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] [L390] 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] [L153] COND TRUE m_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] [L154] 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] [L158] COND TRUE 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] [L159] 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] [L390] 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] [L391] 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] [L242] 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] [L247] 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] [L252] 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] [L391] 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] [L392] 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] [L285] 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] [L286] 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] [L290] 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] [L104] 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] [L107] 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] [L117] __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] [L119] 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] [L290] 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] [L290] tmp = 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, tmp=0] [L292] 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] [L298] 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] [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L298] 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] [L298] tmp___0 = 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, tmp___0=0] [L300] 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] [L392] 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] [L393] 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] [L265] 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] [L270] 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] [L275] 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] [L393] 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] [L396] 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] [L399] 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] [L400] 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] [L189] 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] [L193] 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] [L196] 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] [L168] 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] [L171] COND TRUE 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] [L172] __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] [L184] 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] [L196] 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] [L196] tmp = 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, tmp=1] [L198] 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] [L203] COND TRUE 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, tmp=1] [L204] int 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] [L205] tmp_ndt_1 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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] [L206] 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] [L217] COND TRUE 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, tmp=1, tmp_ndt_1=0] [L218] int tmp_ndt_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)=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] [L219] tmp_ndt_2 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L220] COND TRUE \read(tmp_ndt_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)=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, tmp_ndt_2=1] [L222] 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] [L223] 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] [L74] 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] [L85] 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] [L87] 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)=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=1] [L88] 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] [L223] 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] [L193] 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] [L196] 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] [L168] 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] [L171] COND TRUE 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=1, t1_st=2] [L172] __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] [L184] 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] [L196] 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] [L196] tmp = 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] [L198] 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] [L203] COND TRUE 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=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] int 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=1, t1_st=2, tmp=1, tmp_ndt_2=1] [L205] tmp_ndt_1 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L206] COND TRUE \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=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L208] 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=1, tmp_ndt_2=1] [L209] 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] [L33] 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] [L44] 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] [L47] 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] [L48] 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] [L314] 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] [L285] int 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] [L286] 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] [L290] 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] [L104] 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] [L107] 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] [L117] __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] [L119] 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] [L290] 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] [L290] tmp = 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, tmp=0] [L292] 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] [L298] 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] [L123] 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] [L126] 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] [L127] COND TRUE 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] [L128] __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] [L138] 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] [L298] 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] [L298] tmp___0 = 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, tmp___0=1] [L300] COND TRUE \read(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, tmp=0, tmp___0=1] [L301] 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] [L314] 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] [L48] 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] [L49] 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] [L52] 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] [L54] 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=2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L55] 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] [L209] 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=1, tmp_ndt_2=1] [L217] COND TRUE 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=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L218] int tmp_ndt_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)=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=1] [L219] tmp_ndt_2 = __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=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=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L220] COND TRUE \read(tmp_ndt_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)=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=1, tmp_ndt_2=1] [L222] 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=1, tmp_ndt_2=1] [L223] 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] [L74] 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] [L77] 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] [L93] 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] [L13] reach_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 22 procedures, 213 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.6s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1319 SDtfs, 5952 SDslu, 632 SDs, 0 SdLazy, 7872 SolverSat, 2532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3834occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3052 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 210078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 80/80 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...