/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:37:42,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:37:42,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:37:42,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:37:42,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:37:42,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:37:42,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:37:42,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:37:42,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:37:42,128 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:37:42,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:37:42,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:37:42,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:37:42,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:37:42,130 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:37:42,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:37:42,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:37:42,131 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:37:42,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:37:42,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:37:42,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:37:42,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:37:42,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:37:42,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:37:42,132 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:37:42,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:37:42,133 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:37:42,133 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:37:42,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:37:42,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:37:42,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:37:42,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:37:42,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:37:42,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:37:42,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:37:42,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:37:42,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-22 02:37:42,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:37:42,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:37:42,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:37:42,369 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:37:42,370 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:37:42,371 INFO L431 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.02.cil-1.c [2023-12-22 02:37:43,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:37:43,760 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:37:43,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-12-22 02:37:43,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56346b117/ac557aaa3d7c433a8a5fe871c6e73b0c/FLAG6b3dbffab [2023-12-22 02:37:43,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56346b117/ac557aaa3d7c433a8a5fe871c6e73b0c [2023-12-22 02:37:43,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:37:43,782 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:37:43,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:37:43,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:37:43,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:37:43,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:37:43" (1/1) ... [2023-12-22 02:37:43,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572e63da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:43, skipping insertion in model container [2023-12-22 02:37:43,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:37:43" (1/1) ... [2023-12-22 02:37:43,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:37:43,964 WARN L239 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.02.cil-1.c[914,927] [2023-12-22 02:37:44,004 WARN L239 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.02.cil-1.c[7125,7138] [2023-12-22 02:37:44,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:37:44,053 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:37:44,060 WARN L239 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.02.cil-1.c[914,927] [2023-12-22 02:37:44,086 WARN L239 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.02.cil-1.c[7125,7138] [2023-12-22 02:37:44,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:37:44,116 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:37:44,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44 WrapperNode [2023-12-22 02:37:44,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:37:44,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:37:44,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:37:44,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:37:44,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,169 INFO L138 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 450 [2023-12-22 02:37:44,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:37:44,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:37:44,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:37:44,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:37:44,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,193 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-22 02:37:44,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:37:44,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:37:44,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:37:44,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:37:44,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (1/1) ... [2023-12-22 02:37:44,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:37:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:37:44,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-22 02:37:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-22 02:37:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:37:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:37:44,333 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:37:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:37:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:37:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-22 02:37:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-22 02:37:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:37:44,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:37:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:37:44,336 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:37:44,437 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:37:44,438 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:37:44,914 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:37:44,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:37:44,961 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-22 02:37:44,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:37:44 BoogieIcfgContainer [2023-12-22 02:37:44,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:37:44,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:37:44,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:37:44,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:37:44,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:37:43" (1/3) ... [2023-12-22 02:37:44,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8f5a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:37:44, skipping insertion in model container [2023-12-22 02:37:44,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:37:44" (2/3) ... [2023-12-22 02:37:44,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8f5a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:37:44, skipping insertion in model container [2023-12-22 02:37:44,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:37:44" (3/3) ... [2023-12-22 02:37:44,967 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-12-22 02:37:44,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:37:44,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:37:45,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:37:45,025 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d84e99b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:37:45,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:37:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 169 states have internal predecessors, (265), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-22 02:37:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:45,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:45,039 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:45,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:45,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1791735372, now seen corresponding path program 1 times [2023-12-22 02:37:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999087656] [2023-12-22 02:37:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:45,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:45,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-22 02:37:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:37:45,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:37:45,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:37:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:37:45,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:37:45,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:37:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999087656] [2023-12-22 02:37:45,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999087656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:37:45,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:37:45,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:37:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240579162] [2023-12-22 02:37:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:37:45,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:37:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:37:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:37:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:37:45,261 INFO L87 Difference]: Start difference. First operand has 210 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 169 states have internal predecessors, (265), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-22 02:37:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:37:45,371 INFO L93 Difference]: Finished difference Result 407 states and 631 transitions. [2023-12-22 02:37:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:37:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2023-12-22 02:37:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:37:45,383 INFO L225 Difference]: With dead ends: 407 [2023-12-22 02:37:45,384 INFO L226 Difference]: Without dead ends: 205 [2023-12-22 02:37:45,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:37:45,390 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 120 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:37:45,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 439 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:37:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-22 02:37:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-12-22 02:37:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 164 states have internal predecessors, (239), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-22 02:37:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 298 transitions. [2023-12-22 02:37:45,428 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 298 transitions. Word has length 53 [2023-12-22 02:37:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:37:45,429 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 298 transitions. [2023-12-22 02:37:45,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-22 02:37:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 298 transitions. [2023-12-22 02:37:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:45,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:45,431 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:45,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-22 02:37:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:45,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:45,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash 574959222, now seen corresponding path program 1 times [2023-12-22 02:37:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213583613] [2023-12-22 02:37:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:45,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 02:37:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:37:45,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:37:45,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:37:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:37:45,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:37:45,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:37:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213583613] [2023-12-22 02:37:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213583613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:37:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:37:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:37:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092276911] [2023-12-22 02:37:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:37:45,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:37:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:37:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:37:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:37:45,842 INFO L87 Difference]: Start difference. First operand 205 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:37:46,288 INFO L93 Difference]: Finished difference Result 383 states and 553 transitions. [2023-12-22 02:37:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:37:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 53 [2023-12-22 02:37:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:37:46,295 INFO L225 Difference]: With dead ends: 383 [2023-12-22 02:37:46,295 INFO L226 Difference]: Without dead ends: 301 [2023-12-22 02:37:46,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:37:46,297 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 256 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:37:46,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 603 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:37:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-12-22 02:37:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2023-12-22 02:37:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.475770925110132) internal successors, (335), 234 states have internal predecessors, (335), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-12-22 02:37:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 421 transitions. [2023-12-22 02:37:46,328 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 421 transitions. Word has length 53 [2023-12-22 02:37:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:37:46,328 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 421 transitions. [2023-12-22 02:37:46,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 421 transitions. [2023-12-22 02:37:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:46,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:46,330 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:46,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-22 02:37:46,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:46,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:46,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1901074837, now seen corresponding path program 1 times [2023-12-22 02:37:46,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405188876] [2023-12-22 02:37:46,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:46,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:46,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:46,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:46,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-22 02:37:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:37:46,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:37:46,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:37:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:37:46,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:37:46,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:37:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405188876] [2023-12-22 02:37:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405188876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:37:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:37:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:37:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592920086] [2023-12-22 02:37:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:37:46,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:37:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:37:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:37:46,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:37:46,662 INFO L87 Difference]: Start difference. First operand 293 states and 421 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:37:46,761 INFO L93 Difference]: Finished difference Result 465 states and 662 transitions. [2023-12-22 02:37:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:37:46,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 53 [2023-12-22 02:37:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:37:46,763 INFO L225 Difference]: With dead ends: 465 [2023-12-22 02:37:46,763 INFO L226 Difference]: Without dead ends: 302 [2023-12-22 02:37:46,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:37:46,765 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 6 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:37:46,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1370 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:37:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-22 02:37:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2023-12-22 02:37:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 237 states have internal predecessors, (337), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-12-22 02:37:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2023-12-22 02:37:46,807 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 53 [2023-12-22 02:37:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:37:46,807 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2023-12-22 02:37:46,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2023-12-22 02:37:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:46,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:46,809 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:46,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-22 02:37:47,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:47,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1007689065, now seen corresponding path program 1 times [2023-12-22 02:37:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050337871] [2023-12-22 02:37:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:47,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:47,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-22 02:37:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:37:47,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:37:47,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:37:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:37:47,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:37:47,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:37:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050337871] [2023-12-22 02:37:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050337871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:37:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:37:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:37:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820020217] [2023-12-22 02:37:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:37:47,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:37:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:37:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:37:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:37:47,139 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-22 02:37:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:37:47,192 INFO L93 Difference]: Finished difference Result 623 states and 869 transitions. [2023-12-22 02:37:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:37:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2023-12-22 02:37:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:37:47,194 INFO L225 Difference]: With dead ends: 623 [2023-12-22 02:37:47,194 INFO L226 Difference]: Without dead ends: 456 [2023-12-22 02:37:47,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:37:47,196 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 263 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:37:47,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 382 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:37:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-12-22 02:37:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 441. [2023-12-22 02:37:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 341 states have (on average 1.434017595307918) internal successors, (489), 350 states have internal predecessors, (489), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2023-12-22 02:37:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 612 transitions. [2023-12-22 02:37:47,218 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 612 transitions. Word has length 53 [2023-12-22 02:37:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:37:47,218 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 612 transitions. [2023-12-22 02:37:47,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-22 02:37:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 612 transitions. [2023-12-22 02:37:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:47,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:47,219 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:47,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 02:37:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:47,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash -368904586, now seen corresponding path program 1 times [2023-12-22 02:37:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821046117] [2023-12-22 02:37:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:47,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:47,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:47,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 02:37:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:37:47,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:37:47,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:37:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:37:47,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:37:47,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:37:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821046117] [2023-12-22 02:37:47,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821046117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:37:47,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:37:47,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:37:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28733111] [2023-12-22 02:37:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:37:47,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:37:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:37:47,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:37:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:37:47,502 INFO L87 Difference]: Start difference. First operand 441 states and 612 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:37:47,585 INFO L93 Difference]: Finished difference Result 764 states and 1047 transitions. [2023-12-22 02:37:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:37:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 53 [2023-12-22 02:37:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:37:47,587 INFO L225 Difference]: With dead ends: 764 [2023-12-22 02:37:47,587 INFO L226 Difference]: Without dead ends: 453 [2023-12-22 02:37:47,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:37:47,588 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 3 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:37:47,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1370 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:37:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-12-22 02:37:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2023-12-22 02:37:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 347 states have (on average 1.420749279538905) internal successors, (493), 356 states have internal predecessors, (493), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2023-12-22 02:37:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 618 transitions. [2023-12-22 02:37:47,609 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 618 transitions. Word has length 53 [2023-12-22 02:37:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:37:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 618 transitions. [2023-12-22 02:37:47,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-12-22 02:37:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 618 transitions. [2023-12-22 02:37:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-22 02:37:47,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:37:47,611 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:37:47,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 02:37:47,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:37:47,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:37:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 53797240, now seen corresponding path program 1 times [2023-12-22 02:37:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:37:47,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530844804] [2023-12-22 02:37:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:37:47,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:47,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:37:47,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:37:47,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-22 02:37:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:37:47,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-22 02:37:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:37:47,976 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-22 02:37:47,976 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-22 02:37:47,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:37:47,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:37:47,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 02:37:48,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:37:48,187 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-22 02:37:48,190 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:37:48,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:37:48 BoogieIcfgContainer [2023-12-22 02:37:48,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:37:48,269 INFO L158 Benchmark]: Toolchain (without parser) took 4487.32ms. Allocated memory is still 316.7MB. Free memory was 272.4MB in the beginning and 167.1MB in the end (delta: 105.2MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,269 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 217.1MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:37:48,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.70ms. Allocated memory is still 316.7MB. Free memory was 272.4MB in the beginning and 253.0MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.88ms. Allocated memory is still 316.7MB. Free memory was 253.0MB in the beginning and 250.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,269 INFO L158 Benchmark]: Boogie Preprocessor took 56.72ms. Allocated memory is still 316.7MB. Free memory was 250.3MB in the beginning and 246.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,270 INFO L158 Benchmark]: RCFGBuilder took 734.04ms. Allocated memory is still 316.7MB. Free memory was 246.7MB in the beginning and 268.3MB in the end (delta: -21.7MB). Peak memory consumption was 35.0MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,270 INFO L158 Benchmark]: TraceAbstraction took 3305.45ms. Allocated memory is still 316.7MB. Free memory was 267.8MB in the beginning and 167.1MB in the end (delta: 100.7MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2023-12-22 02:37:48,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 217.1MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.70ms. Allocated memory is still 316.7MB. Free memory was 272.4MB in the beginning and 253.0MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.88ms. Allocated memory is still 316.7MB. Free memory was 253.0MB in the beginning and 250.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.72ms. Allocated memory is still 316.7MB. Free memory was 250.3MB in the beginning and 246.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 734.04ms. Allocated memory is still 316.7MB. Free memory was 246.7MB in the beginning and 268.3MB in the end (delta: -21.7MB). Peak memory consumption was 35.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3305.45ms. Allocated memory is still 316.7MB. Free memory was 267.8MB in the beginning and 167.1MB in the end (delta: 100.7MB). Peak memory consumption was 101.2MB. 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 m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] 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 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_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 [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 4164 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2867 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 819 IncrementalHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1297 mSDtfsCounter, 819 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 3 NumberOfNonLiveVariables, 718 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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! [2023-12-22 02:37:48,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...