/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 01:10:19,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 01:10:19,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 01:10:19,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 01:10:19,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 01:10:19,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 01:10:19,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 01:10:19,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 01:10:19,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 01:10:19,779 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 01:10:19,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 01:10:19,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 01:10:19,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 01:10:19,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 01:10:19,781 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 01:10:19,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 01:10:19,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 01:10:19,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 01:10:19,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 01:10:19,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 01:10:19,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 01:10:19,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 01:10:19,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 01:10:19,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 01:10:19,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 01:10:19,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 01:10:19,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 01:10:19,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 01:10:19,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 01:10:19,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 01:10:19,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 01:10:19,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 01:10:19,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:10:19,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 01:10:19,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 01:10:19,787 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 01:10:19,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 01:10:19,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 01:10:19,788 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 01:10:20,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 01:10:20,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 01:10:20,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 01:10:20,040 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 01:10:20,043 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 01:10:20,044 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.12.cil-2.c [2023-12-16 01:10:21,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 01:10:21,351 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 01:10:21,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2023-12-16 01:10:21,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b850dd92/7a5830ea33984194a8903106e89387f9/FLAG463c4bc63 [2023-12-16 01:10:21,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b850dd92/7a5830ea33984194a8903106e89387f9 [2023-12-16 01:10:21,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 01:10:21,397 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 01:10:21,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 01:10:21,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 01:10:21,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 01:10:21,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:21,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3948ccfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21, skipping insertion in model container [2023-12-16 01:10:21,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:21,466 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 01:10:21,672 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.12.cil-2.c[914,927] [2023-12-16 01:10:21,751 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.12.cil-2.c[7125,7138] [2023-12-16 01:10:21,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:10:21,874 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 01:10:21,883 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.12.cil-2.c[914,927] [2023-12-16 01:10:21,898 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.12.cil-2.c[7125,7138] [2023-12-16 01:10:21,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:10:21,962 INFO L206 MainTranslator]: Completed translation [2023-12-16 01:10:21,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21 WrapperNode [2023-12-16 01:10:21,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 01:10:21,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 01:10:21,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 01:10:21,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 01:10:21,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:21,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,060 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1069 [2023-12-16 01:10:22,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 01:10:22,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 01:10:22,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 01:10:22,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 01:10:22,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,113 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-16 01:10:22,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 01:10:22,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 01:10:22,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 01:10:22,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 01:10:22,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (1/1) ... [2023-12-16 01:10:22,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:10:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:10:22,226 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-16 01:10:22,261 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-16 01:10:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 01:10:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-16 01:10:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-16 01:10:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-16 01:10:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-16 01:10:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-16 01:10:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 01:10:22,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 01:10:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-16 01:10:22,274 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-16 01:10:22,398 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 01:10:22,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 01:10:23,073 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 01:10:23,109 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 01:10:23,109 INFO L309 CfgBuilder]: Removed 19 assume(true) statements. [2023-12-16 01:10:23,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:10:23 BoogieIcfgContainer [2023-12-16 01:10:23,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 01:10:23,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 01:10:23,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 01:10:23,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 01:10:23,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:10:21" (1/3) ... [2023-12-16 01:10:23,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64df4f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:10:23, skipping insertion in model container [2023-12-16 01:10:23,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:10:21" (2/3) ... [2023-12-16 01:10:23,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64df4f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:10:23, skipping insertion in model container [2023-12-16 01:10:23,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:10:23" (3/3) ... [2023-12-16 01:10:23,117 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2023-12-16 01:10:23,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 01:10:23,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 01:10:23,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 01:10:23,190 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;@3f760542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 01:10:23,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 01:10:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 389 states have internal predecessors, (655), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 01:10:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:23,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:23,208 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-16 01:10:23,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:23,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 482932250, now seen corresponding path program 1 times [2023-12-16 01:10:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445379158] [2023-12-16 01:10:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:23,706 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-16 01:10:23,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:23,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445379158] [2023-12-16 01:10:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445379158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:23,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 01:10:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700799306] [2023-12-16 01:10:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:23,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 01:10:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 01:10:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 01:10:23,743 INFO L87 Difference]: Start difference. First operand has 440 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 389 states have internal predecessors, (655), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:25,041 INFO L93 Difference]: Finished difference Result 981 states and 1627 transitions. [2023-12-16 01:10:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 01:10:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-12-16 01:10:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:25,055 INFO L225 Difference]: With dead ends: 981 [2023-12-16 01:10:25,056 INFO L226 Difference]: Without dead ends: 561 [2023-12-16 01:10:25,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-16 01:10:25,062 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 1146 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:25,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1768 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 01:10:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2023-12-16 01:10:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 523. [2023-12-16 01:10:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 447 states have (on average 1.58165548098434) internal successors, (707), 454 states have internal predecessors, (707), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2023-12-16 01:10:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 813 transitions. [2023-12-16 01:10:25,150 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 813 transitions. Word has length 53 [2023-12-16 01:10:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:25,151 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 813 transitions. [2023-12-16 01:10:25,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 813 transitions. [2023-12-16 01:10:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:25,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:25,154 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-16 01:10:25,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 01:10:25,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:25,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1809047865, now seen corresponding path program 1 times [2023-12-16 01:10:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692917321] [2023-12-16 01:10:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:25,345 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-16 01:10:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692917321] [2023-12-16 01:10:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692917321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 01:10:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924803028] [2023-12-16 01:10:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 01:10:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 01:10:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 01:10:25,349 INFO L87 Difference]: Start difference. First operand 523 states and 813 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:26,546 INFO L93 Difference]: Finished difference Result 845 states and 1265 transitions. [2023-12-16 01:10:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 01:10:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-12-16 01:10:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:26,553 INFO L225 Difference]: With dead ends: 845 [2023-12-16 01:10:26,553 INFO L226 Difference]: Without dead ends: 682 [2023-12-16 01:10:26,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-16 01:10:26,554 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 1736 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:26,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1676 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 01:10:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2023-12-16 01:10:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 611. [2023-12-16 01:10:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 515 states have (on average 1.5592233009708738) internal successors, (803), 524 states have internal predecessors, (803), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2023-12-16 01:10:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 939 transitions. [2023-12-16 01:10:26,640 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 939 transitions. Word has length 53 [2023-12-16 01:10:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:26,641 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 939 transitions. [2023-12-16 01:10:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 939 transitions. [2023-12-16 01:10:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:26,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:26,648 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-16 01:10:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 01:10:26,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:26,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2062272709, now seen corresponding path program 1 times [2023-12-16 01:10:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394047774] [2023-12-16 01:10:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:26,868 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-16 01:10:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394047774] [2023-12-16 01:10:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394047774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 01:10:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040357985] [2023-12-16 01:10:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:26,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 01:10:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 01:10:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 01:10:26,870 INFO L87 Difference]: Start difference. First operand 611 states and 939 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:28,053 INFO L93 Difference]: Finished difference Result 888 states and 1329 transitions. [2023-12-16 01:10:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 01:10:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:28,056 INFO L225 Difference]: With dead ends: 888 [2023-12-16 01:10:28,057 INFO L226 Difference]: Without dead ends: 643 [2023-12-16 01:10:28,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-16 01:10:28,058 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 918 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:28,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2143 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 01:10:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2023-12-16 01:10:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 615. [2023-12-16 01:10:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 518 states have (on average 1.5521235521235521) internal successors, (804), 527 states have internal predecessors, (804), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2023-12-16 01:10:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 941 transitions. [2023-12-16 01:10:28,079 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 941 transitions. Word has length 53 [2023-12-16 01:10:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:28,080 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 941 transitions. [2023-12-16 01:10:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 941 transitions. [2023-12-16 01:10:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:28,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:28,081 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-16 01:10:28,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 01:10:28,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:28,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -676069315, now seen corresponding path program 1 times [2023-12-16 01:10:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507688611] [2023-12-16 01:10:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:28,194 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-16 01:10:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507688611] [2023-12-16 01:10:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507688611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 01:10:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986871603] [2023-12-16 01:10:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:28,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 01:10:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:28,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 01:10:28,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 01:10:28,196 INFO L87 Difference]: Start difference. First operand 615 states and 941 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 01:10:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:30,117 INFO L93 Difference]: Finished difference Result 1853 states and 2649 transitions. [2023-12-16 01:10:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-16 01:10:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2023-12-16 01:10:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:30,124 INFO L225 Difference]: With dead ends: 1853 [2023-12-16 01:10:30,124 INFO L226 Difference]: Without dead ends: 1586 [2023-12-16 01:10:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 01:10:30,130 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 3455 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3469 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:30,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3469 Valid, 2220 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 01:10:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2023-12-16 01:10:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1450. [2023-12-16 01:10:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1167 states have (on average 1.437017994858612) internal successors, (1677), 1191 states have internal predecessors, (1677), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2023-12-16 01:10:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2016 transitions. [2023-12-16 01:10:30,213 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2016 transitions. Word has length 53 [2023-12-16 01:10:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 1450 states and 2016 transitions. [2023-12-16 01:10:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 01:10:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2016 transitions. [2023-12-16 01:10:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:30,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:30,218 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-16 01:10:30,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 01:10:30,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:30,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -37284836, now seen corresponding path program 1 times [2023-12-16 01:10:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287379812] [2023-12-16 01:10:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:30,376 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-16 01:10:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287379812] [2023-12-16 01:10:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287379812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 01:10:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668293957] [2023-12-16 01:10:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:30,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 01:10:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 01:10:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 01:10:30,378 INFO L87 Difference]: Start difference. First operand 1450 states and 2016 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:31,578 INFO L93 Difference]: Finished difference Result 2644 states and 3592 transitions. [2023-12-16 01:10:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 01:10:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:31,585 INFO L225 Difference]: With dead ends: 2644 [2023-12-16 01:10:31,585 INFO L226 Difference]: Without dead ends: 1548 [2023-12-16 01:10:31,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-16 01:10:31,589 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 922 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:31,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2140 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 01:10:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-12-16 01:10:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1474. [2023-12-16 01:10:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1185 states have (on average 1.4236286919831223) internal successors, (1687), 1209 states have internal predecessors, (1687), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2023-12-16 01:10:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2032 transitions. [2023-12-16 01:10:31,661 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2032 transitions. Word has length 53 [2023-12-16 01:10:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:31,661 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2032 transitions. [2023-12-16 01:10:31,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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-16 01:10:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2032 transitions. [2023-12-16 01:10:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:31,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:31,662 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-16 01:10:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 01:10:31,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:31,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash 385416990, now seen corresponding path program 1 times [2023-12-16 01:10:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985902707] [2023-12-16 01:10:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 01:10:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 01:10:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 01:10:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 01:10:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 01:10:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 01:10:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 01:10:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:10:31,805 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-16 01:10:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:10:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985902707] [2023-12-16 01:10:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985902707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:10:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:10:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 01:10:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358949657] [2023-12-16 01:10:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:10:31,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 01:10:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:10:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 01:10:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 01:10:31,806 INFO L87 Difference]: Start difference. First operand 1474 states and 2032 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:10:32,674 INFO L93 Difference]: Finished difference Result 2626 states and 3476 transitions. [2023-12-16 01:10:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 01:10:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-12-16 01:10:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:10:32,681 INFO L225 Difference]: With dead ends: 2626 [2023-12-16 01:10:32,681 INFO L226 Difference]: Without dead ends: 1713 [2023-12-16 01:10:32,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-16 01:10:32,683 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1672 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 01:10:32,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1475 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 01:10:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2023-12-16 01:10:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1419. [2023-12-16 01:10:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1146 states have (on average 1.4214659685863875) internal successors, (1629), 1165 states have internal predecessors, (1629), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2023-12-16 01:10:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1953 transitions. [2023-12-16 01:10:32,803 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1953 transitions. Word has length 53 [2023-12-16 01:10:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:10:32,803 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 1953 transitions. [2023-12-16 01:10:32,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 01:10:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1953 transitions. [2023-12-16 01:10:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 01:10:32,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:10:32,804 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-16 01:10:32,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 01:10:32,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:10:32,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:10:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -635651364, now seen corresponding path program 1 times [2023-12-16 01:10:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:10:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249136832] [2023-12-16 01:10:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:10:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:10:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:10:32,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 01:10:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 01:10:32,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 01:10:32,918 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 01:10:32,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 01:10:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 01:10:32,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 01:10:32,923 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:10:32,925 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 01:10:33,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:10:33 BoogieIcfgContainer [2023-12-16 01:10:33,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 01:10:33,050 INFO L158 Benchmark]: Toolchain (without parser) took 11653.29ms. Allocated memory was 224.4MB in the beginning and 373.3MB in the end (delta: 148.9MB). Free memory was 168.3MB in the beginning and 131.6MB in the end (delta: 36.7MB). Peak memory consumption was 187.2MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,050 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:10:33,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.45ms. Allocated memory is still 224.4MB. Free memory was 167.7MB in the beginning and 140.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.35ms. Allocated memory is still 224.4MB. Free memory was 140.0MB in the beginning and 135.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,051 INFO L158 Benchmark]: Boogie Preprocessor took 117.93ms. Allocated memory is still 224.4MB. Free memory was 135.2MB in the beginning and 128.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,051 INFO L158 Benchmark]: RCFGBuilder took 930.55ms. Allocated memory is still 224.4MB. Free memory was 128.9MB in the beginning and 144.2MB in the end (delta: -15.2MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,051 INFO L158 Benchmark]: TraceAbstraction took 9938.62ms. Allocated memory was 224.4MB in the beginning and 373.3MB in the end (delta: 148.9MB). Free memory was 143.6MB in the beginning and 131.6MB in the end (delta: 12.1MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. [2023-12-16 01:10:33,052 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 186.6MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.45ms. Allocated memory is still 224.4MB. Free memory was 167.7MB in the beginning and 140.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.35ms. Allocated memory is still 224.4MB. Free memory was 140.0MB in the beginning and 135.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 117.93ms. Allocated memory is still 224.4MB. Free memory was 135.2MB in the beginning and 128.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 930.55ms. Allocated memory is still 224.4MB. Free memory was 128.9MB in the beginning and 144.2MB in the end (delta: -15.2MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9938.62ms. Allocated memory was 224.4MB in the beginning and 373.3MB in the end (delta: 148.9MB). Free memory was 143.6MB in the beginning and 131.6MB in the end (delta: 12.1MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int t9_pc = 0; [L510] int t10_pc = 0; [L511] int t11_pc = 0; [L512] int t12_pc = 0; [L513] int m_st ; [L514] int t1_st ; [L515] int t2_st ; [L516] int t3_st ; [L517] int t4_st ; [L518] int t5_st ; [L519] int t6_st ; [L520] int t7_st ; [L521] int t8_st ; [L522] int t9_st ; [L523] int t10_st ; [L524] int t11_st ; [L525] int t12_st ; [L526] int m_i ; [L527] int t1_i ; [L528] int t2_i ; [L529] int t3_i ; [L530] int t4_i ; [L531] int t5_i ; [L532] int t6_i ; [L533] int t7_i ; [L534] int t8_i ; [L535] int t9_i ; [L536] int t10_i ; [L537] int t11_i ; [L538] int t12_i ; [L539] int M_E = 2; [L540] int T1_E = 2; [L541] int T2_E = 2; [L542] int T3_E = 2; [L543] int T4_E = 2; [L544] int T5_E = 2; [L545] int T6_E = 2; [L546] int T7_E = 2; [L547] int T8_E = 2; [L548] int T9_E = 2; [L549] int T10_E = 2; [L550] int T11_E = 2; [L551] int T12_E = 2; [L552] int E_M = 2; [L553] int E_1 = 2; [L554] int E_2 = 2; [L555] int E_3 = 2; [L556] int E_4 = 2; [L557] int E_5 = 2; [L558] int E_6 = 2; [L559] int E_7 = 2; [L560] int E_8 = 2; [L561] int E_9 = 2; [L562] int E_10 = 2; [L563] int E_11 = 2; [L564] int E_12 = 2; [L579] int token ; [L581] int local ; [L2337] COND TRUE __VERIFIER_nondet_int() [L2338] 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_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] CALL update_channels1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] RET update_channels1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] CALL activate_threads1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L70] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L83] __retres1 = 0 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L89] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L102] __retres1 = 0 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_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_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L347] COND TRUE 1 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L260] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_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_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L28] reach_error() VAL [E_10=2, E_11=2, E_12=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_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, 440 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9931 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9849 mSDsluCounter, 11422 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9279 mSDsCounter, 1409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10911 IncrementalHoareTripleChecker+Invalid, 12320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1409 mSolverCounterUnsat, 2143 mSDtfsCounter, 10911 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1474occurred in iteration=5, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 641 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-16 01:10:33,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...