./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:03:50,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:03:50,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 03:03:50,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:03:50,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:03:50,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:03:50,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:03:50,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:03:50,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:03:50,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:03:50,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:03:50,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:03:50,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:03:50,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:03:50,392 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:03:50,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:03:50,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:03:50,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 03:03:50,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:03:50,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 03:03:50,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:03:50,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:03:50,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:03:50,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:03:50,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:03:50,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 03:03:50,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:03:50,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:03:50,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:03:50,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:03:50,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:03:50,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:03:50,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:03:50,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:03:50,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:03:50,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:03:50,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:03:50,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:03:50,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:03:50,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:03:50,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:03:50,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:03:50,403 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2024-10-24 03:03:50,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:03:50,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:03:50,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:03:50,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:03:50,660 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:03:50,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-10-24 03:03:52,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:03:52,183 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:03:52,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-10-24 03:03:52,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fba009fe/9e58711cf96a432fbc5075f10e78610a/FLAG2e6279805 [2024-10-24 03:03:52,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fba009fe/9e58711cf96a432fbc5075f10e78610a [2024-10-24 03:03:52,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:03:52,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:03:52,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:03:52,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:03:52,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:03:52,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b92f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52, skipping insertion in model container [2024-10-24 03:03:52,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:03:52,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-10-24 03:03:52,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-10-24 03:03:52,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:03:52,520 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:03:52,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-10-24 03:03:52,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-10-24 03:03:52,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:03:52,595 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:03:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52 WrapperNode [2024-10-24 03:03:52,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:03:52,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:03:52,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:03:52,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:03:52,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,635 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 409 [2024-10-24 03:03:52,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:03:52,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:03:52,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:03:52,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:03:52,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,661 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]. [2024-10-24 03:03:52,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:03:52,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:03:52,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:03:52,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:03:52,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (1/1) ... [2024-10-24 03:03:52,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:03:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:03:52,707 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) [2024-10-24 03:03:52,710 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 [2024-10-24 03:03:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:03:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 03:03:52,751 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 03:03:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-24 03:03:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-24 03:03:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 03:03:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 03:03:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 03:03:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 03:03:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-24 03:03:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-24 03:03:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 03:03:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 03:03:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 03:03:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 03:03:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-24 03:03:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-24 03:03:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:03:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:03:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 03:03:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 03:03:52,850 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:03:52,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:03:53,271 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 03:03:53,271 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:03:53,329 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:03:53,329 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-24 03:03:53,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:53 BoogieIcfgContainer [2024-10-24 03:03:53,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:03:53,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:03:53,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:03:53,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:03:53,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:03:52" (1/3) ... [2024-10-24 03:03:53,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bbccf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:53, skipping insertion in model container [2024-10-24 03:03:53,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:52" (2/3) ... [2024-10-24 03:03:53,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bbccf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:53, skipping insertion in model container [2024-10-24 03:03:53,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:53" (3/3) ... [2024-10-24 03:03:53,340 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-10-24 03:03:53,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:03:53,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 03:03:53,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:03:53,438 INFO L333 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, 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;@6361abe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:03:53,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 03:03:53,445 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) [2024-10-24 03:03:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:53,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:53,456 INFO L215 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] [2024-10-24 03:03:53,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:53,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash 96521062, now seen corresponding path program 1 times [2024-10-24 03:03:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600697301] [2024-10-24 03:03:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600697301] [2024-10-24 03:03:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600697301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:54,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:03:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674213175] [2024-10-24 03:03:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:54,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:03:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:54,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:03:54,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:03:54,065 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) [2024-10-24 03:03:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:03:54,937 INFO L93 Difference]: Finished difference Result 486 states and 747 transitions. [2024-10-24 03:03:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:03:54,941 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 [2024-10-24 03:03:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:03:54,955 INFO L225 Difference]: With dead ends: 486 [2024-10-24 03:03:54,955 INFO L226 Difference]: Without dead ends: 308 [2024-10-24 03:03:54,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:03:54,963 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 522 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:03:54,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 679 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:03:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-24 03:03:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 270. [2024-10-24 03:03:55,028 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) [2024-10-24 03:03:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 384 transitions. [2024-10-24 03:03:55,033 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 384 transitions. Word has length 53 [2024-10-24 03:03:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:55,034 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 384 transitions. [2024-10-24 03:03:55,034 INFO L472 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) [2024-10-24 03:03:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 384 transitions. [2024-10-24 03:03:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:55,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:55,036 INFO L215 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] [2024-10-24 03:03:55,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:03:55,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1422636677, now seen corresponding path program 1 times [2024-10-24 03:03:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375825983] [2024-10-24 03:03:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375825983] [2024-10-24 03:03:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375825983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:55,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:03:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430042462] [2024-10-24 03:03:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:03:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:03:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:03:55,257 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) [2024-10-24 03:03:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:03:56,017 INFO L93 Difference]: Finished difference Result 592 states and 836 transitions. [2024-10-24 03:03:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:03:56,017 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 [2024-10-24 03:03:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:03:56,020 INFO L225 Difference]: With dead ends: 592 [2024-10-24 03:03:56,021 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 03:03:56,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-24 03:03:56,023 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 534 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:03:56,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 920 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:03:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 03:03:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2024-10-24 03:03:56,076 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) [2024-10-24 03:03:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 510 transitions. [2024-10-24 03:03:56,078 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 510 transitions. Word has length 53 [2024-10-24 03:03:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 510 transitions. [2024-10-24 03:03:56,078 INFO L472 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) [2024-10-24 03:03:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 510 transitions. [2024-10-24 03:03:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:56,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:56,081 INFO L215 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] [2024-10-24 03:03:56,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:03:56,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1846283399, now seen corresponding path program 1 times [2024-10-24 03:03:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786055392] [2024-10-24 03:03:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786055392] [2024-10-24 03:03:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786055392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:03:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746903453] [2024-10-24 03:03:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:56,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:03:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:03:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:03:56,186 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) [2024-10-24 03:03:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:03:56,711 INFO L93 Difference]: Finished difference Result 633 states and 897 transitions. [2024-10-24 03:03:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:03:56,712 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 [2024-10-24 03:03:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:03:56,714 INFO L225 Difference]: With dead ends: 633 [2024-10-24 03:03:56,715 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 03:03:56,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:03:56,717 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 192 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:03:56,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 942 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:03:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 03:03:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 362. [2024-10-24 03:03:56,739 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) [2024-10-24 03:03:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 512 transitions. [2024-10-24 03:03:56,741 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 512 transitions. Word has length 53 [2024-10-24 03:03:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:56,741 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 512 transitions. [2024-10-24 03:03:56,742 INFO L472 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) [2024-10-24 03:03:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 512 transitions. [2024-10-24 03:03:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:56,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:56,744 INFO L215 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] [2024-10-24 03:03:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:03:56,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:56,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1062480503, now seen corresponding path program 1 times [2024-10-24 03:03:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859318556] [2024-10-24 03:03:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:56,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859318556] [2024-10-24 03:03:56,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859318556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:56,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:56,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 03:03:56,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064820786] [2024-10-24 03:03:56,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:56,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 03:03:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:56,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 03:03:56,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:03:56,927 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) [2024-10-24 03:03:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:03:58,296 INFO L93 Difference]: Finished difference Result 1600 states and 2220 transitions. [2024-10-24 03:03:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 03:03:58,296 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 [2024-10-24 03:03:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:03:58,305 INFO L225 Difference]: With dead ends: 1600 [2024-10-24 03:03:58,306 INFO L226 Difference]: Without dead ends: 1333 [2024-10-24 03:03:58,310 INFO L431 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 [2024-10-24 03:03:58,311 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1607 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-10-24 03:03:58,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1153 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 03:03:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-24 03:03:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1197. [2024-10-24 03:03:58,387 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) [2024-10-24 03:03:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1587 transitions. [2024-10-24 03:03:58,394 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1587 transitions. Word has length 53 [2024-10-24 03:03:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1587 transitions. [2024-10-24 03:03:58,397 INFO L472 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) [2024-10-24 03:03:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1587 transitions. [2024-10-24 03:03:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:58,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:58,399 INFO L215 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] [2024-10-24 03:03:58,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:03:58,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:58,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:58,399 INFO L85 PathProgramCache]: Analyzing trace with hash -423696024, now seen corresponding path program 1 times [2024-10-24 03:03:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495289688] [2024-10-24 03:03:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495289688] [2024-10-24 03:03:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495289688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 03:03:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230716871] [2024-10-24 03:03:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:03:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:03:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:03:58,504 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) [2024-10-24 03:03:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:03:59,072 INFO L93 Difference]: Finished difference Result 2387 states and 3159 transitions. [2024-10-24 03:03:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:03:59,072 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 [2024-10-24 03:03:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:03:59,078 INFO L225 Difference]: With dead ends: 2387 [2024-10-24 03:03:59,079 INFO L226 Difference]: Without dead ends: 1291 [2024-10-24 03:03:59,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:03:59,083 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 290 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:03:59,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 842 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:03:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-10-24 03:03:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1221. [2024-10-24 03:03:59,174 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) [2024-10-24 03:03:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1603 transitions. [2024-10-24 03:03:59,178 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1603 transitions. Word has length 53 [2024-10-24 03:03:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:03:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1603 transitions. [2024-10-24 03:03:59,179 INFO L472 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) [2024-10-24 03:03:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1603 transitions. [2024-10-24 03:03:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:03:59,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:03:59,180 INFO L215 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] [2024-10-24 03:03:59,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:03:59,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:03:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:03:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -994198, now seen corresponding path program 1 times [2024-10-24 03:03:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:03:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253016789] [2024-10-24 03:03:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:03:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:03:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:03:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 03:03:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:03:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 03:03:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 03:03:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 03:03:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:03:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:03:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:03:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:03:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253016789] [2024-10-24 03:03:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253016789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:03:59,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:03:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:03:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126065544] [2024-10-24 03:03:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:03:59,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:03:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:03:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:03:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:03:59,292 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) [2024-10-24 03:04:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:04:00,049 INFO L93 Difference]: Finished difference Result 2373 states and 3047 transitions. [2024-10-24 03:04:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:04:00,050 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 [2024-10-24 03:04:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:04:00,057 INFO L225 Difference]: With dead ends: 2373 [2024-10-24 03:04:00,058 INFO L226 Difference]: Without dead ends: 1460 [2024-10-24 03:04:00,060 INFO L431 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 [2024-10-24 03:04:00,060 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 514 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:04:00,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 685 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:04:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-10-24 03:04:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1166. [2024-10-24 03:04:00,121 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) [2024-10-24 03:04:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1524 transitions. [2024-10-24 03:04:00,126 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1524 transitions. Word has length 53 [2024-10-24 03:04:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:04:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1524 transitions. [2024-10-24 03:04:00,128 INFO L472 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) [2024-10-24 03:04:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1524 transitions. [2024-10-24 03:04:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 03:04:00,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:04:00,130 INFO L215 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] [2024-10-24 03:04:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 03:04:00,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:04:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:04:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1022062552, now seen corresponding path program 1 times [2024-10-24 03:04:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:04:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185923331] [2024-10-24 03:04:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:04:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:04:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:04:00,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 03:04:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:04:00,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 03:04:00,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 03:04:00,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-24 03:04:00,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-24 03:04:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 03:04:00,183 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:04:00,254 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 03:04:00,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:04:00 BoogieIcfgContainer [2024-10-24 03:04:00,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 03:04:00,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 03:04:00,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 03:04:00,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 03:04:00,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:53" (3/4) ... [2024-10-24 03:04:00,259 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 03:04:00,328 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 03:04:00,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 03:04:00,332 INFO L158 Benchmark]: Toolchain (without parser) took 8113.22ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 76.3MB in the beginning and 136.3MB in the end (delta: -59.9MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,333 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:04:00,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.43ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 176.1MB in the end (delta: -99.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.12ms. Allocated memory is still 209.7MB. Free memory was 176.1MB in the beginning and 173.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,333 INFO L158 Benchmark]: Boogie Preprocessor took 41.14ms. Allocated memory is still 209.7MB. Free memory was 173.0MB in the beginning and 169.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,333 INFO L158 Benchmark]: RCFGBuilder took 652.06ms. Allocated memory is still 209.7MB. Free memory was 169.8MB in the beginning and 134.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,334 INFO L158 Benchmark]: TraceAbstraction took 6925.28ms. Allocated memory was 209.7MB in the beginning and 314.6MB in the end (delta: 104.9MB). Free memory was 133.1MB in the beginning and 144.7MB in the end (delta: -11.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,334 INFO L158 Benchmark]: Witness Printer took 74.47ms. Allocated memory is still 314.6MB. Free memory was 144.7MB in the beginning and 136.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 03:04:00,335 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.16ms. Allocated memory is still 148.9MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.43ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 176.1MB in the end (delta: -99.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.12ms. Allocated memory is still 209.7MB. Free memory was 176.1MB in the beginning and 173.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.14ms. Allocated memory is still 209.7MB. Free memory was 173.0MB in the beginning and 169.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 652.06ms. Allocated memory is still 209.7MB. Free memory was 169.8MB in the beginning and 134.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6925.28ms. Allocated memory was 209.7MB in the beginning and 314.6MB in the end (delta: 104.9MB). Free memory was 133.1MB in the beginning and 144.7MB in the end (delta: -11.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * Witness Printer took 74.47ms. Allocated memory is still 314.6MB. Free memory was 144.7MB in the beginning and 136.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3659 mSDsluCounter, 5221 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4233 mSDsCounter, 1015 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5513 IncrementalHoareTripleChecker+Invalid, 6528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1015 mSolverCounterUnsat, 988 mSDtfsCounter, 5513 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1221occurred in iteration=5, InterpolantAutomatonStates: 99, 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, 635 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 03:04:00,361 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE