/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:53:39,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:53:39,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:53:39,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:53:39,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:53:39,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:53:39,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:53:39,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:53:39,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:53:39,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:53:39,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:53:39,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:53:39,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:53:39,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:53:39,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:53:39,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:53:39,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:53:39,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:53:39,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:53:39,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:53:39,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:53:39,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:53:39,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:53:39,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:53:39,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:53:39,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:53:39,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:53:39,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:53:39,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:53:39,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:53:39,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:53:39,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:53:39,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:53:39,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:53:39,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:53:39,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:53:39,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:53:39,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:53:39,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:53:39,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:53:39,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:53:39,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:53:39,358 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:53:39,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:53:39,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:53:39,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:53:39,360 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:53:39,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:53:39,360 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:53:39,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:53:39,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:53:39,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:53:39,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:53:39,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:53:39,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:53:39,362 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:53:39,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:53:39,362 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:53:39,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:53:39,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:53:39,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:53:39,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:53:39,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:53:39,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:53:39,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:53:39,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:53:39,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:53:39,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:53:39,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:53:39,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:53:39,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:53:39,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2020-11-06 22:53:39,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:53:39,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:53:39,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:53:39,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:53:39,799 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:53:39,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-11-06 22:53:39,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27b0faf3/cafb877b73de4e78b50a58faffc0f860/FLAGed7d00c8a [2020-11-06 22:53:40,563 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:53:40,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-11-06 22:53:40,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27b0faf3/cafb877b73de4e78b50a58faffc0f860/FLAGed7d00c8a [2020-11-06 22:53:40,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27b0faf3/cafb877b73de4e78b50a58faffc0f860 [2020-11-06 22:53:40,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:53:40,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:53:40,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:53:40,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:53:40,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:53:40,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:40" (1/1) ... [2020-11-06 22:53:40,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e77a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40, skipping insertion in model container [2020-11-06 22:53:40,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:40" (1/1) ... [2020-11-06 22:53:40,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:53:41,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:53:41,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:53:41,222 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:53:41,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:53:41,281 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:53:41,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41 WrapperNode [2020-11-06 22:53:41,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:53:41,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:53:41,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:53:41,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:53:41,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... [2020-11-06 22:53:41,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:53:41,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:53:41,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:53:41,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:53:41,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:53:41,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:53:41,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-06 22:53:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-06 22:53:41,425 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-06 22:53:41,425 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:53:41,425 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:53:41,425 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:53:41,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-06 22:53:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:53:41,427 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:53:41,427 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:53:41,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:53:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:53:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:53:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:53:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:53:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:53:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:53:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-06 22:53:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:53:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-06 22:53:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:53:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:53:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:53:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:53:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:53:41,985 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:53:41,985 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-06 22:53:41,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:41 BoogieIcfgContainer [2020-11-06 22:53:41,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:53:41,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:53:41,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:53:41,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:53:41,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:40" (1/3) ... [2020-11-06 22:53:41,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f00517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:41, skipping insertion in model container [2020-11-06 22:53:41,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:41" (2/3) ... [2020-11-06 22:53:41,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f00517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:41, skipping insertion in model container [2020-11-06 22:53:41,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:41" (3/3) ... [2020-11-06 22:53:41,999 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-11-06 22:53:42,014 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:53:42,019 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:53:42,031 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:53:42,059 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:53:42,060 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:53:42,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:53:42,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:53:42,060 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:53:42,060 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:53:42,060 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:53:42,061 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:53:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-11-06 22:53:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:42,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:42,092 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] [2020-11-06 22:53:42,093 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash -154404590, now seen corresponding path program 1 times [2020-11-06 22:53:42,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:42,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226962165] [2020-11-06 22:53:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:42,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226962165] [2020-11-06 22:53:42,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:42,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:53:42,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924292286] [2020-11-06 22:53:42,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:53:42,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:53:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:53:42,689 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 8 states. [2020-11-06 22:53:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:44,326 INFO L93 Difference]: Finished difference Result 337 states and 496 transitions. [2020-11-06 22:53:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:53:44,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-11-06 22:53:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:44,343 INFO L225 Difference]: With dead ends: 337 [2020-11-06 22:53:44,344 INFO L226 Difference]: Without dead ends: 197 [2020-11-06 22:53:44,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:53:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-11-06 22:53:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-11-06 22:53:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-11-06 22:53:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2020-11-06 22:53:44,428 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 76 [2020-11-06 22:53:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:44,429 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2020-11-06 22:53:44,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:53:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2020-11-06 22:53:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:44,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:44,433 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] [2020-11-06 22:53:44,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:53:44,433 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash -356228524, now seen corresponding path program 1 times [2020-11-06 22:53:44,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:44,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073988541] [2020-11-06 22:53:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:44,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073988541] [2020-11-06 22:53:44,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:44,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:53:44,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214601613] [2020-11-06 22:53:44,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:53:44,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:53:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:53:44,767 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand 9 states. [2020-11-06 22:53:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:47,036 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2020-11-06 22:53:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:53:47,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2020-11-06 22:53:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:47,044 INFO L225 Difference]: With dead ends: 454 [2020-11-06 22:53:47,044 INFO L226 Difference]: Without dead ends: 342 [2020-11-06 22:53:47,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:53:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-11-06 22:53:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 234. [2020-11-06 22:53:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-06 22:53:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 300 transitions. [2020-11-06 22:53:47,107 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 300 transitions. Word has length 76 [2020-11-06 22:53:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:47,107 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 300 transitions. [2020-11-06 22:53:47,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:53:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 300 transitions. [2020-11-06 22:53:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:47,110 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] [2020-11-06 22:53:47,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:53:47,111 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1645780151, now seen corresponding path program 1 times [2020-11-06 22:53:47,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:47,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408839139] [2020-11-06 22:53:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:47,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408839139] [2020-11-06 22:53:47,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:47,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:47,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639792836] [2020-11-06 22:53:47,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:47,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:47,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:47,404 INFO L87 Difference]: Start difference. First operand 234 states and 300 transitions. Second operand 10 states. [2020-11-06 22:53:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:48,774 INFO L93 Difference]: Finished difference Result 547 states and 745 transitions. [2020-11-06 22:53:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:53:48,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-11-06 22:53:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:48,778 INFO L225 Difference]: With dead ends: 547 [2020-11-06 22:53:48,778 INFO L226 Difference]: Without dead ends: 332 [2020-11-06 22:53:48,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:53:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-11-06 22:53:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 234. [2020-11-06 22:53:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-06 22:53:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2020-11-06 22:53:48,855 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 76 [2020-11-06 22:53:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:48,855 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2020-11-06 22:53:48,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2020-11-06 22:53:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:48,859 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:48,859 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] [2020-11-06 22:53:48,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:53:48,860 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1711128525, now seen corresponding path program 1 times [2020-11-06 22:53:48,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:48,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924163788] [2020-11-06 22:53:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:48,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:49,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924163788] [2020-11-06 22:53:49,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:49,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:49,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398060319] [2020-11-06 22:53:49,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:49,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:49,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:49,148 INFO L87 Difference]: Start difference. First operand 234 states and 293 transitions. Second operand 10 states. [2020-11-06 22:53:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:51,011 INFO L93 Difference]: Finished difference Result 564 states and 764 transitions. [2020-11-06 22:53:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:53:51,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-11-06 22:53:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:51,019 INFO L225 Difference]: With dead ends: 564 [2020-11-06 22:53:51,020 INFO L226 Difference]: Without dead ends: 350 [2020-11-06 22:53:51,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:53:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-11-06 22:53:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 244. [2020-11-06 22:53:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-11-06 22:53:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 303 transitions. [2020-11-06 22:53:51,099 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 303 transitions. Word has length 76 [2020-11-06 22:53:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:51,101 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 303 transitions. [2020-11-06 22:53:51,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 303 transitions. [2020-11-06 22:53:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:51,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:51,110 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] [2020-11-06 22:53:51,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:53:51,110 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1009528651, now seen corresponding path program 1 times [2020-11-06 22:53:51,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:51,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731779409] [2020-11-06 22:53:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:51,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731779409] [2020-11-06 22:53:51,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:51,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:51,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235171087] [2020-11-06 22:53:51,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:51,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:51,426 INFO L87 Difference]: Start difference. First operand 244 states and 303 transitions. Second operand 10 states. [2020-11-06 22:53:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:53,277 INFO L93 Difference]: Finished difference Result 702 states and 934 transitions. [2020-11-06 22:53:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:53:53,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-11-06 22:53:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:53,285 INFO L225 Difference]: With dead ends: 702 [2020-11-06 22:53:53,285 INFO L226 Difference]: Without dead ends: 477 [2020-11-06 22:53:53,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:53:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-11-06 22:53:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 290. [2020-11-06 22:53:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-06 22:53:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 345 transitions. [2020-11-06 22:53:53,355 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 345 transitions. Word has length 76 [2020-11-06 22:53:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:53,356 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 345 transitions. [2020-11-06 22:53:53,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 345 transitions. [2020-11-06 22:53:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-06 22:53:53,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:53,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:53:53,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:53:53,360 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -868980041, now seen corresponding path program 1 times [2020-11-06 22:53:53,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:53,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561199226] [2020-11-06 22:53:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:53,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561199226] [2020-11-06 22:53:53,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:53,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:53:53,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584647041] [2020-11-06 22:53:53,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:53:53,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:53:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:53:53,593 INFO L87 Difference]: Start difference. First operand 290 states and 345 transitions. Second operand 8 states. [2020-11-06 22:53:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:55,638 INFO L93 Difference]: Finished difference Result 1021 states and 1379 transitions. [2020-11-06 22:53:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:53:55,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-11-06 22:53:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:55,645 INFO L225 Difference]: With dead ends: 1021 [2020-11-06 22:53:55,646 INFO L226 Difference]: Without dead ends: 752 [2020-11-06 22:53:55,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:53:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-11-06 22:53:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 497. [2020-11-06 22:53:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-06 22:53:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 609 transitions. [2020-11-06 22:53:55,730 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 609 transitions. Word has length 76 [2020-11-06 22:53:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:55,731 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 609 transitions. [2020-11-06 22:53:55,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:53:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 609 transitions. [2020-11-06 22:53:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-06 22:53:55,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:55,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:53:55,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:53:55,733 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1749976708, now seen corresponding path program 1 times [2020-11-06 22:53:55,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:55,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281347967] [2020-11-06 22:53:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:55,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281347967] [2020-11-06 22:53:55,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:55,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:53:55,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125236212] [2020-11-06 22:53:55,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:53:55,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:53:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:53:55,893 INFO L87 Difference]: Start difference. First operand 497 states and 609 transitions. Second operand 7 states. [2020-11-06 22:53:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:57,818 INFO L93 Difference]: Finished difference Result 1704 states and 2354 transitions. [2020-11-06 22:53:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:53:57,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-06 22:53:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:57,829 INFO L225 Difference]: With dead ends: 1704 [2020-11-06 22:53:57,829 INFO L226 Difference]: Without dead ends: 1227 [2020-11-06 22:53:57,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:53:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-11-06 22:53:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1023. [2020-11-06 22:53:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2020-11-06 22:53:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1328 transitions. [2020-11-06 22:53:57,977 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1328 transitions. Word has length 77 [2020-11-06 22:53:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:57,978 INFO L481 AbstractCegarLoop]: Abstraction has 1023 states and 1328 transitions. [2020-11-06 22:53:57,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:53:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1328 transitions. [2020-11-06 22:53:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-06 22:53:57,987 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:57,987 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:53:57,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:53:57,987 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 824465844, now seen corresponding path program 1 times [2020-11-06 22:53:57,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:57,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069677491] [2020-11-06 22:53:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:53:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:53:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-06 22:53:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-06 22:53:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:53:58,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069677491] [2020-11-06 22:53:58,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:58,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:53:58,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602578100] [2020-11-06 22:53:58,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:53:58,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:53:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:53:58,220 INFO L87 Difference]: Start difference. First operand 1023 states and 1328 transitions. Second operand 8 states. [2020-11-06 22:54:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:00,631 INFO L93 Difference]: Finished difference Result 3514 states and 5024 transitions. [2020-11-06 22:54:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:54:00,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-11-06 22:54:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:00,648 INFO L225 Difference]: With dead ends: 3514 [2020-11-06 22:54:00,648 INFO L226 Difference]: Without dead ends: 1927 [2020-11-06 22:54:00,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:54:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2020-11-06 22:54:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1663. [2020-11-06 22:54:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2020-11-06 22:54:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2233 transitions. [2020-11-06 22:54:00,934 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2233 transitions. Word has length 96 [2020-11-06 22:54:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:00,934 INFO L481 AbstractCegarLoop]: Abstraction has 1663 states and 2233 transitions. [2020-11-06 22:54:00,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:54:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2233 transitions. [2020-11-06 22:54:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-06 22:54:00,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:00,938 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:54:00,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:54:00,939 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash 52839137, now seen corresponding path program 1 times [2020-11-06 22:54:00,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:00,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267425463] [2020-11-06 22:54:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:54:00,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:54:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:54:00,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:54:01,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:54:01,041 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:54:01,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:54:01,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:54:01 BoogieIcfgContainer [2020-11-06 22:54:01,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:54:01,200 INFO L168 Benchmark]: Toolchain (without parser) took 20266.37 ms. Allocated memory was 161.5 MB in the beginning and 404.8 MB in the end (delta: 243.3 MB). Free memory was 136.5 MB in the beginning and 294.8 MB in the end (delta: -158.4 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:01,201 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 161.5 MB. Free memory is still 134.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:54:01,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.62 ms. Allocated memory is still 161.5 MB. Free memory was 135.9 MB in the beginning and 123.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:01,203 INFO L168 Benchmark]: Boogie Preprocessor took 46.96 ms. Allocated memory is still 161.5 MB. Free memory was 123.5 MB in the beginning and 121.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:01,204 INFO L168 Benchmark]: RCFGBuilder took 658.77 ms. Allocated memory is still 161.5 MB. Free memory was 121.5 MB in the beginning and 126.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:01,207 INFO L168 Benchmark]: TraceAbstraction took 19203.05 ms. Allocated memory was 161.5 MB in the beginning and 404.8 MB in the end (delta: 243.3 MB). Free memory was 125.8 MB in the beginning and 294.8 MB in the end (delta: -169.1 MB). Peak memory consumption was 74.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:01,213 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.18 ms. Allocated memory is still 161.5 MB. Free memory is still 134.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 343.62 ms. Allocated memory is still 161.5 MB. Free memory was 135.9 MB in the beginning and 123.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.96 ms. Allocated memory is still 161.5 MB. Free memory was 123.5 MB in the beginning and 121.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 658.77 ms. Allocated memory is still 161.5 MB. Free memory was 121.5 MB in the beginning and 126.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19203.05 ms. Allocated memory was 161.5 MB in the beginning and 404.8 MB in the end (delta: 243.3 MB). Free memory was 125.8 MB in the beginning and 294.8 MB in the end (delta: -169.1 MB). Peak memory consumption was 74.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [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 [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 ; [L383] int tmp ; [L384] int tmp___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 [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 [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 ; [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() [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() [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 [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() [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 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [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 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [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 [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 [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() [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 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND TRUE \read(tmp_ndt_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=-2, 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 ; [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() [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 [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() [L300] COND TRUE \read(tmp___0) [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 [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=-2, tmp_ndt_2=-1] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [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=-2, tmp_ndt_2=-3] [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] CALL 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] [L3] __assert_fail("0", "transmitter.01.cil.c", 3, "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, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.9s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1042 SDtfs, 3632 SDslu, 298 SDs, 0 SdLazy, 6113 SolverSat, 2261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1663occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 130931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 15/15 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...