/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:38:44,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:38:44,215 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-19 01:38:44,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:38:44,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:38:44,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:38:44,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:38:44,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:38:44,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:38:44,255 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:38:44,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:38:44,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:38:44,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:38:44,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:38:44,257 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:38:44,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:38:44,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:38:44,257 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:38:44,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:38:44,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:38:44,259 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:38:44,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:38:44,260 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:38:44,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:38:44,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:38:44,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:38:44,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:38:44,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:38:44,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:38:44,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:38:44,262 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:38:44,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:38:44,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:38:44,263 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 -> true [2023-12-19 01:38:44,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:38:44,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:38:44,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:38:44,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:38:44,482 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:38:44,483 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.01.cil-1.c [2023-12-19 01:38:45,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:38:45,813 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:38:45,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2023-12-19 01:38:45,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e172b97d/6f8aacb3c9be4bddadbf8dfea8cd888c/FLAG212e186ec [2023-12-19 01:38:45,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e172b97d/6f8aacb3c9be4bddadbf8dfea8cd888c [2023-12-19 01:38:45,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:38:45,836 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:38:45,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:38:45,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:38:45,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:38:45,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:38:45" (1/1) ... [2023-12-19 01:38:45,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d995431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:45, skipping insertion in model container [2023-12-19 01:38:45,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:38:45" (1/1) ... [2023-12-19 01:38:45,891 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:38:46,020 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.01.cil-1.c[914,927] [2023-12-19 01:38:46,056 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.01.cil-1.c[7125,7138] [2023-12-19 01:38:46,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:38:46,090 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:38:46,098 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.01.cil-1.c[914,927] [2023-12-19 01:38:46,113 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.01.cil-1.c[7125,7138] [2023-12-19 01:38:46,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:38:46,141 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:38:46,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46 WrapperNode [2023-12-19 01:38:46,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:38:46,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:38:46,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:38:46,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:38:46,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,189 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 409 [2023-12-19 01:38:46,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:38:46,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:38:46,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:38:46,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:38:46,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,211 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-19 01:38:46,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:38:46,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:38:46,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:38:46,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:38:46,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:38:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:38:46,275 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-19 01:38:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:38:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:38:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:38:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:38:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:38:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:38:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:38:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:38:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:38:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:38:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:38:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:38:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:38:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:38:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:38:46,310 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:38:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:38:46,310 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:38:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:38:46,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:38:46,310 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:38:46,310 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:38:46,293 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-19 01:38:46,403 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:38:46,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:38:46,819 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:38:46,855 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:38:46,855 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-19 01:38:46,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:38:46 BoogieIcfgContainer [2023-12-19 01:38:46,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:38:46,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:38:46,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:38:46,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:38:46,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:38:45" (1/3) ... [2023-12-19 01:38:46,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70a4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:38:46, skipping insertion in model container [2023-12-19 01:38:46,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (2/3) ... [2023-12-19 01:38:46,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70a4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:38:46, skipping insertion in model container [2023-12-19 01:38:46,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:38:46" (3/3) ... [2023-12-19 01:38:46,861 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2023-12-19 01:38:46,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:38:46,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:38:46,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:38:46,919 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;@63c07218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:38:46,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:38:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 147 states have internal predecessors, (226), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-19 01:38:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:46,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:46,932 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-19 01:38:46,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:46,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 96521062, now seen corresponding path program 1 times [2023-12-19 01:38:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:46,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934853429] [2023-12-19 01:38:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,336 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-19 01:38:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934853429] [2023-12-19 01:38:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934853429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:38:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565031620] [2023-12-19 01:38:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:38:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:38:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:38:47,369 INFO L87 Difference]: Start difference. First operand has 187 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 147 states have internal predecessors, (226), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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-19 01:38:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:48,199 INFO L93 Difference]: Finished difference Result 486 states and 747 transitions. [2023-12-19 01:38:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:38:48,201 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-19 01:38:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:48,217 INFO L225 Difference]: With dead ends: 486 [2023-12-19 01:38:48,217 INFO L226 Difference]: Without dead ends: 308 [2023-12-19 01:38:48,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:38:48,223 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 389 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:48,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 779 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:38:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-12-19 01:38:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 270. [2023-12-19 01:38:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 205 states have (on average 1.4634146341463414) internal successors, (300), 212 states have internal predecessors, (300), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-19 01:38:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 384 transitions. [2023-12-19 01:38:48,282 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 384 transitions. Word has length 53 [2023-12-19 01:38:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:48,282 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 384 transitions. [2023-12-19 01:38:48,283 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-19 01:38:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 384 transitions. [2023-12-19 01:38:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:48,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:48,285 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-19 01:38:48,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:38:48,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:48,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1422636677, now seen corresponding path program 1 times [2023-12-19 01:38:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175901815] [2023-12-19 01:38:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:48,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,491 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-19 01:38:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175901815] [2023-12-19 01:38:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175901815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:38:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361395763] [2023-12-19 01:38:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:48,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:38:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:38:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:38:48,502 INFO L87 Difference]: Start difference. First operand 270 states and 384 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-19 01:38:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:49,239 INFO L93 Difference]: Finished difference Result 592 states and 836 transitions. [2023-12-19 01:38:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:38:49,246 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-19 01:38:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:49,263 INFO L225 Difference]: With dead ends: 592 [2023-12-19 01:38:49,263 INFO L226 Difference]: Without dead ends: 429 [2023-12-19 01:38:49,264 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-19 01:38:49,265 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 697 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:49,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 785 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:38:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-19 01:38:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2023-12-19 01:38:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 273 states have (on average 1.4505494505494505) internal successors, (396), 282 states have internal predecessors, (396), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2023-12-19 01:38:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 510 transitions. [2023-12-19 01:38:49,309 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 510 transitions. Word has length 53 [2023-12-19 01:38:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:49,309 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 510 transitions. [2023-12-19 01:38:49,310 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-19 01:38:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 510 transitions. [2023-12-19 01:38:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:49,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:49,315 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-19 01:38:49,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:38:49,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:49,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1846283399, now seen corresponding path program 1 times [2023-12-19 01:38:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791061415] [2023-12-19 01:38:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,479 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-19 01:38:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791061415] [2023-12-19 01:38:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791061415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:38:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496983402] [2023-12-19 01:38:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:49,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:38:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:38:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:38:49,484 INFO L87 Difference]: Start difference. First operand 358 states and 510 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-19 01:38:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:50,022 INFO L93 Difference]: Finished difference Result 635 states and 900 transitions. [2023-12-19 01:38:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:38:50,023 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-19 01:38:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:50,025 INFO L225 Difference]: With dead ends: 635 [2023-12-19 01:38:50,025 INFO L226 Difference]: Without dead ends: 390 [2023-12-19 01:38:50,026 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-19 01:38:50,027 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 291 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:50,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 845 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:38:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-19 01:38:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 362. [2023-12-19 01:38:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 276 states have (on average 1.4384057971014492) internal successors, (397), 285 states have internal predecessors, (397), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2023-12-19 01:38:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 512 transitions. [2023-12-19 01:38:50,082 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 512 transitions. Word has length 53 [2023-12-19 01:38:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:50,082 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 512 transitions. [2023-12-19 01:38:50,082 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-19 01:38:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 512 transitions. [2023-12-19 01:38:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:50,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:50,085 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-19 01:38:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:38:50,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:50,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1062480503, now seen corresponding path program 1 times [2023-12-19 01:38:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012015732] [2023-12-19 01:38:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,195 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-19 01:38:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012015732] [2023-12-19 01:38:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012015732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 01:38:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331578831] [2023-12-19 01:38:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:38:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:38:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:38:50,197 INFO L87 Difference]: Start difference. First operand 362 states and 512 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-19 01:38:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:51,373 INFO L93 Difference]: Finished difference Result 1600 states and 2220 transitions. [2023-12-19 01:38:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:38:51,373 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-19 01:38:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:51,379 INFO L225 Difference]: With dead ends: 1600 [2023-12-19 01:38:51,379 INFO L226 Difference]: Without dead ends: 1333 [2023-12-19 01:38:51,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 01:38:51,381 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 1607 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:51,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1153 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 01:38:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-12-19 01:38:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1197. [2023-12-19 01:38:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 925 states have (on average 1.372972972972973) internal successors, (1270), 949 states have internal predecessors, (1270), 140 states have call successors, (140), 111 states have call predecessors, (140), 130 states have return successors, (177), 139 states have call predecessors, (177), 137 states have call successors, (177) [2023-12-19 01:38:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1587 transitions. [2023-12-19 01:38:51,461 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1587 transitions. Word has length 53 [2023-12-19 01:38:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:51,461 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1587 transitions. [2023-12-19 01:38:51,462 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-19 01:38:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1587 transitions. [2023-12-19 01:38:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:51,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:51,463 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-19 01:38:51,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:38:51,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:51,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -423696024, now seen corresponding path program 1 times [2023-12-19 01:38:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768042305] [2023-12-19 01:38:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:51,548 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-19 01:38:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768042305] [2023-12-19 01:38:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768042305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:38:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450536388] [2023-12-19 01:38:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:51,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:38:51,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:38:51,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:38:51,550 INFO L87 Difference]: Start difference. First operand 1197 states and 1587 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-19 01:38:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:52,073 INFO L93 Difference]: Finished difference Result 2391 states and 3163 transitions. [2023-12-19 01:38:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:38:52,073 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-19 01:38:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:52,078 INFO L225 Difference]: With dead ends: 2391 [2023-12-19 01:38:52,079 INFO L226 Difference]: Without dead ends: 1295 [2023-12-19 01:38:52,081 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-19 01:38:52,081 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 295 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:52,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 842 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:38:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-12-19 01:38:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1221. [2023-12-19 01:38:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 943 states have (on average 1.357370095440085) internal successors, (1280), 967 states have internal predecessors, (1280), 140 states have call successors, (140), 111 states have call predecessors, (140), 136 states have return successors, (183), 145 states have call predecessors, (183), 137 states have call successors, (183) [2023-12-19 01:38:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1603 transitions. [2023-12-19 01:38:52,155 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1603 transitions. Word has length 53 [2023-12-19 01:38:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:52,155 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 1603 transitions. [2023-12-19 01:38:52,156 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-19 01:38:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1603 transitions. [2023-12-19 01:38:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:52,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:52,156 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-19 01:38:52,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:38:52,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:52,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash -994198, now seen corresponding path program 1 times [2023-12-19 01:38:52,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:52,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461110036] [2023-12-19 01:38:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,266 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-19 01:38:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461110036] [2023-12-19 01:38:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461110036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:38:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415053194] [2023-12-19 01:38:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:52,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:38:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:38:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:38:52,268 INFO L87 Difference]: Start difference. First operand 1221 states and 1603 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-19 01:38:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:52,858 INFO L93 Difference]: Finished difference Result 2373 states and 3047 transitions. [2023-12-19 01:38:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:38:52,859 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-19 01:38:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:52,869 INFO L225 Difference]: With dead ends: 2373 [2023-12-19 01:38:52,869 INFO L226 Difference]: Without dead ends: 1460 [2023-12-19 01:38:52,871 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-19 01:38:52,874 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 516 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:52,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 685 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:38:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2023-12-19 01:38:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1166. [2023-12-19 01:38:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 904 states have (on average 1.3517699115044248) internal successors, (1222), 923 states have internal predecessors, (1222), 134 states have call successors, (134), 106 states have call predecessors, (134), 126 states have return successors, (168), 138 states have call predecessors, (168), 131 states have call successors, (168) [2023-12-19 01:38:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1524 transitions. [2023-12-19 01:38:52,942 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1524 transitions. Word has length 53 [2023-12-19 01:38:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:52,943 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1524 transitions. [2023-12-19 01:38:52,943 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-19 01:38:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1524 transitions. [2023-12-19 01:38:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:52,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:52,944 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-19 01:38:52,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:38:52,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:52,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1022062552, now seen corresponding path program 1 times [2023-12-19 01:38:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726860097] [2023-12-19 01:38:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:38:52,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 01:38:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:38:52,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 01:38:52,998 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 01:38:52,998 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:38:53,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:38:53,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:38:53,003 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:38:53,006 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:38:53,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:38:53 BoogieIcfgContainer [2023-12-19 01:38:53,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:38:53,073 INFO L158 Benchmark]: Toolchain (without parser) took 7236.99ms. Allocated memory was 274.7MB in the beginning and 341.8MB in the end (delta: 67.1MB). Free memory was 222.1MB in the beginning and 248.6MB in the end (delta: -26.5MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2023-12-19 01:38:53,073 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 226.5MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:38:53,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.98ms. Allocated memory is still 274.7MB. Free memory was 221.6MB in the beginning and 204.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 01:38:53,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.70ms. Allocated memory is still 274.7MB. Free memory was 204.8MB in the beginning and 201.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:38:53,074 INFO L158 Benchmark]: Boogie Preprocessor took 45.29ms. Allocated memory is still 274.7MB. Free memory was 201.7MB in the beginning and 198.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:38:53,074 INFO L158 Benchmark]: RCFGBuilder took 620.05ms. Allocated memory is still 274.7MB. Free memory was 198.5MB in the beginning and 167.6MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-19 01:38:53,074 INFO L158 Benchmark]: TraceAbstraction took 6215.39ms. Allocated memory was 274.7MB in the beginning and 341.8MB in the end (delta: 67.1MB). Free memory was 167.0MB in the beginning and 248.6MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:38:53,075 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.40ms. Allocated memory is still 226.5MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.98ms. Allocated memory is still 274.7MB. Free memory was 221.6MB in the beginning and 204.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.70ms. Allocated memory is still 274.7MB. Free memory was 204.8MB in the beginning and 201.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.29ms. Allocated memory is still 274.7MB. Free memory was 201.7MB in the beginning and 198.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 620.05ms. Allocated memory is still 274.7MB. Free memory was 198.5MB in the beginning and 167.6MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6215.39ms. Allocated memory was 274.7MB in the beginning and 341.8MB in the end (delta: 67.1MB). Free memory was 167.0MB in the beginning and 248.6MB in the end (delta: -81.6MB). There was no memory consumed. 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 m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; [L962] COND TRUE __VERIFIER_nondet_int() [L963] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, 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, 187 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3856 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3795 mSDsluCounter, 5089 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4101 mSDsCounter, 1059 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5435 IncrementalHoareTripleChecker+Invalid, 6494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1059 mSolverCounterUnsat, 988 mSDtfsCounter, 5435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1221occurred 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 641 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s 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-19 01:38:53,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...