/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 08:22:23,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 08:22:23,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 08:22:23,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 08:22:23,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 08:22:23,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 08:22:23,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 08:22:23,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 08:22:23,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 08:22:23,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 08:22:23,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 08:22:23,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 08:22:23,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 08:22:23,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 08:22:23,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 08:22:23,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 08:22:23,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 08:22:23,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 08:22:23,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 08:22:23,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 08:22:23,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 08:22:23,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 08:22:23,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 08:22:23,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 08:22:23,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 08:22:23,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 08:22:23,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 08:22:23,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 08:22:23,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 08:22:23,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 08:22:23,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 08:22:23,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 08:22:23,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 08:22:23,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 08:22:23,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 08:22:23,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 08:22:23,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 08:22:23,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 08:22:23,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 08:22:23,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 08:22:23,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 08:22:23,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 08:22:23,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 08:22:23,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 08:22:23,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 08:22:23,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 08:22:23,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 08:22:23,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 08:22:23,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 08:22:23,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 08:22:23,442 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 08:22:23,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 08:22:23,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 08:22:23,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 08:22:23,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 08:22:23,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 08:22:23,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 08:22:23,446 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 08:22:23,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 08:22:23,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:22:23,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 08:22:23,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 08:22:23,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 08:22:23,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 08:22:23,450 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 08:22:23,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 08:22:23,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 08:22:23,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 08:22:23,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 08:22:23,650 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 08:22:23,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-01-10 08:22:23,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd39f68f/a161a4d28d3d4dc4b7295835e64cf885/FLAG1051ca09b [2022-01-10 08:22:24,073 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 08:22:24,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-01-10 08:22:24,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd39f68f/a161a4d28d3d4dc4b7295835e64cf885/FLAG1051ca09b [2022-01-10 08:22:24,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd39f68f/a161a4d28d3d4dc4b7295835e64cf885 [2022-01-10 08:22:24,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 08:22:24,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 08:22:24,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 08:22:24,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 08:22:24,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 08:22:24,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12462b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24, skipping insertion in model container [2022-01-10 08:22:24,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 08:22:24,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 08:22:24,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[914,927] [2022-01-10 08:22:24,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[7125,7138] [2022-01-10 08:22:24,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:22:24,725 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 08:22:24,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[914,927] [2022-01-10 08:22:24,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[7125,7138] [2022-01-10 08:22:24,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:22:24,808 INFO L208 MainTranslator]: Completed translation [2022-01-10 08:22:24,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24 WrapperNode [2022-01-10 08:22:24,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 08:22:24,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 08:22:24,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 08:22:24,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 08:22:24,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,872 INFO L137 Inliner]: procedures = 62, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 554 [2022-01-10 08:22:24,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 08:22:24,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 08:22:24,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 08:22:24,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 08:22:24,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 08:22:24,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 08:22:24,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 08:22:24,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 08:22:24,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (1/1) ... [2022-01-10 08:22:24,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:22:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 08:22:24,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 08:22:24,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 08:22:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 08:22:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 08:22:24,970 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 08:22:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 08:22:24,970 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 08:22:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 08:22:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 08:22:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 08:22:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 08:22:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 08:22:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 08:22:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 08:22:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 08:22:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 08:22:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 08:22:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 08:22:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 08:22:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 08:22:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 08:22:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 08:22:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 08:22:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 08:22:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 08:22:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 08:22:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 08:22:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 08:22:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 08:22:25,052 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 08:22:25,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 08:22:25,479 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 08:22:25,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 08:22:25,485 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 08:22:25,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:22:25 BoogieIcfgContainer [2022-01-10 08:22:25,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 08:22:25,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 08:22:25,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 08:22:25,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 08:22:25,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:22:24" (1/3) ... [2022-01-10 08:22:25,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cd523d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:22:25, skipping insertion in model container [2022-01-10 08:22:25,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:24" (2/3) ... [2022-01-10 08:22:25,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cd523d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:22:25, skipping insertion in model container [2022-01-10 08:22:25,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:22:25" (3/3) ... [2022-01-10 08:22:25,493 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-01-10 08:22:25,496 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 08:22:25,496 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 08:22:25,528 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 08:22:25,532 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 08:22:25,532 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 08:22:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-01-10 08:22:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:25,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:25,570 INFO L514 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] [2022-01-10 08:22:25,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1988134503, now seen corresponding path program 1 times [2022-01-10 08:22:25,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295035755] [2022-01-10 08:22:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:25,591 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:25,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:25,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 08:22:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:25,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:22:25,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:25,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:25,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295035755] [2022-01-10 08:22:25,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295035755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:25,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:25,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:22:25,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71144791] [2022-01-10 08:22:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:25,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:22:25,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:22:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:22:25,933 INFO L87 Difference]: Start difference. First operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:26,466 INFO L93 Difference]: Finished difference Result 651 states and 1002 transitions. [2022-01-10 08:22:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:26,483 INFO L225 Difference]: With dead ends: 651 [2022-01-10 08:22:26,484 INFO L226 Difference]: Without dead ends: 377 [2022-01-10 08:22:26,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:26,494 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 313 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:26,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 1056 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 08:22:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-10 08:22:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 370. [2022-01-10 08:22:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-01-10 08:22:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 532 transitions. [2022-01-10 08:22:26,549 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 532 transitions. Word has length 59 [2022-01-10 08:22:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:26,549 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 532 transitions. [2022-01-10 08:22:26,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 532 transitions. [2022-01-10 08:22:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:26,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:26,552 INFO L514 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] [2022-01-10 08:22:26,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:26,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:26,759 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 887476135, now seen corresponding path program 1 times [2022-01-10 08:22:26,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020020296] [2022-01-10 08:22:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:26,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:26,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:26,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 08:22:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:26,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:22:26,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:26,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:26,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:26,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020020296] [2022-01-10 08:22:26,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020020296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:26,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:26,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:22:26,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846002323] [2022-01-10 08:22:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:26,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:22:26,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:22:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:22:26,989 INFO L87 Difference]: Start difference. First operand 370 states and 532 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:27,028 INFO L93 Difference]: Finished difference Result 718 states and 1001 transitions. [2022-01-10 08:22:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:22:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:27,032 INFO L225 Difference]: With dead ends: 718 [2022-01-10 08:22:27,032 INFO L226 Difference]: Without dead ends: 540 [2022-01-10 08:22:27,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:22:27,034 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 372 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:27,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 525 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-01-10 08:22:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 529. [2022-01-10 08:22:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2022-01-10 08:22:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 740 transitions. [2022-01-10 08:22:27,073 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 740 transitions. Word has length 59 [2022-01-10 08:22:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:27,073 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 740 transitions. [2022-01-10 08:22:27,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 740 transitions. [2022-01-10 08:22:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:27,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:27,076 INFO L514 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] [2022-01-10 08:22:27,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:27,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:27,284 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1410796806, now seen corresponding path program 1 times [2022-01-10 08:22:27,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:27,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568803325] [2022-01-10 08:22:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:27,285 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:27,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:27,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 08:22:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:27,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:22:27,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:27,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:27,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568803325] [2022-01-10 08:22:27,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568803325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:27,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:27,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:22:27,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356741159] [2022-01-10 08:22:27,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:27,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:22:27,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:22:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:27,420 INFO L87 Difference]: Start difference. First operand 529 states and 740 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:27,452 INFO L93 Difference]: Finished difference Result 886 states and 1219 transitions. [2022-01-10 08:22:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:27,455 INFO L225 Difference]: With dead ends: 886 [2022-01-10 08:22:27,456 INFO L226 Difference]: Without dead ends: 549 [2022-01-10 08:22:27,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:22:27,457 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 7 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:27,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1989 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-10 08:22:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 539. [2022-01-10 08:22:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) [2022-01-10 08:22:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 748 transitions. [2022-01-10 08:22:27,476 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 748 transitions. Word has length 59 [2022-01-10 08:22:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:27,477 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 748 transitions. [2022-01-10 08:22:27,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 748 transitions. [2022-01-10 08:22:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:27,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:27,499 INFO L514 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] [2022-01-10 08:22:27,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 08:22:27,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:27,708 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1685556420, now seen corresponding path program 1 times [2022-01-10 08:22:27,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:27,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026440248] [2022-01-10 08:22:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:27,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:27,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:27,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:27,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 08:22:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:27,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:22:27,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:27,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:27,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026440248] [2022-01-10 08:22:27,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026440248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:27,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:27,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:22:27,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832114006] [2022-01-10 08:22:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:27,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:22:27,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:22:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:27,857 INFO L87 Difference]: Start difference. First operand 539 states and 748 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:27,898 INFO L93 Difference]: Finished difference Result 900 states and 1226 transitions. [2022-01-10 08:22:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:27,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:27,903 INFO L225 Difference]: With dead ends: 900 [2022-01-10 08:22:27,904 INFO L226 Difference]: Without dead ends: 553 [2022-01-10 08:22:27,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:22:27,911 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 4 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:27,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1980 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-01-10 08:22:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2022-01-10 08:22:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) [2022-01-10 08:22:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 756 transitions. [2022-01-10 08:22:27,929 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 756 transitions. Word has length 59 [2022-01-10 08:22:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:27,929 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 756 transitions. [2022-01-10 08:22:27,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 756 transitions. [2022-01-10 08:22:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:27,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:27,930 INFO L514 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] [2022-01-10 08:22:27,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:28,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,137 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -119881914, now seen corresponding path program 1 times [2022-01-10 08:22:28,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699621266] [2022-01-10 08:22:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:28,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:28,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:28,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 08:22:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:22:28,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 08:22:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:22:28,306 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 08:22:28,306 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 08:22:28,307 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 08:22:28,308 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 08:22:28,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:28,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,517 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-10 08:22:28,520 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 08:22:28,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:22:28 BoogieIcfgContainer [2022-01-10 08:22:28,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 08:22:28,608 INFO L158 Benchmark]: Toolchain (without parser) took 4121.88ms. Allocated memory was 229.6MB in the beginning and 299.9MB in the end (delta: 70.3MB). Free memory was 173.0MB in the beginning and 213.5MB in the end (delta: -40.5MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,608 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 229.6MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 08:22:28,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.32ms. Allocated memory was 229.6MB in the beginning and 299.9MB in the end (delta: 70.3MB). Free memory was 172.8MB in the beginning and 264.1MB in the end (delta: -91.3MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.85ms. Allocated memory is still 299.9MB. Free memory was 264.1MB in the beginning and 261.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,608 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory is still 299.9MB. Free memory was 261.0MB in the beginning and 258.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,608 INFO L158 Benchmark]: RCFGBuilder took 572.91ms. Allocated memory is still 299.9MB. Free memory was 257.8MB in the beginning and 227.4MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,609 INFO L158 Benchmark]: TraceAbstraction took 3119.25ms. Allocated memory is still 299.9MB. Free memory was 226.9MB in the beginning and 213.5MB in the end (delta: 13.4MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-01-10 08:22:28,609 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.10ms. Allocated memory is still 229.6MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.32ms. Allocated memory was 229.6MB in the beginning and 299.9MB in the end (delta: 70.3MB). Free memory was 172.8MB in the beginning and 264.1MB in the end (delta: -91.3MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.85ms. Allocated memory is still 299.9MB. Free memory was 264.1MB in the beginning and 261.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.98ms. Allocated memory is still 299.9MB. Free memory was 261.0MB in the beginning and 258.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.91ms. Allocated memory is still 299.9MB. Free memory was 257.8MB in the beginning and 227.4MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3119.25ms. Allocated memory is still 299.9MB. Free memory was 226.9MB in the beginning and 213.5MB in the end (delta: 13.4MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int m_st ; [L506] int t1_st ; [L507] int t2_st ; [L508] int t3_st ; [L509] int t4_st ; [L510] int m_i ; [L511] int t1_i ; [L512] int t2_i ; [L513] int t3_i ; [L514] int t4_i ; [L515] int M_E = 2; [L516] int T1_E = 2; [L517] int T2_E = 2; [L518] int T3_E = 2; [L519] int T4_E = 2; [L520] int E_M = 2; [L521] int E_1 = 2; [L522] int E_2 = 2; [L523] int E_3 = 2; [L524] int E_4 = 2; [L531] int token ; [L533] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L1337] COND TRUE __VERIFIER_nondet_int() [L1338] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 284 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 5550 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3927 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1623 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 318 SizeOfPredicates, 2 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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! [2022-01-10 08:22:28,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...