./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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/systemc/pc_sfifo_3.cil.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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:19:53,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:19:53,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:19:53,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:19:53,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:19:53,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:19:53,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:19:53,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:19:53,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:19:53,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:19:53,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:19:53,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:19:53,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:19:53,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:19:53,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:19:53,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:19:53,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:19:53,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:19:53,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:19:53,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:19:53,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:19:53,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:19:53,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:19:53,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:19:53,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:19:53,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:19:53,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:19:53,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:19:53,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:19:53,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:19:53,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:19:53,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:19:53,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:19:53,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:19:53,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:19:53,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:19:53,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:19:53,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:19:53,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:19:53,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:19:53,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:19:53,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:19:53,335 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2024-11-19 22:19:53,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:19:53,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:19:53,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:19:53,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:19:53,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:19:53,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-11-19 22:19:54,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:19:54,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:19:54,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-11-19 22:19:54,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd1631ba/63b5fe3fd9fc49cc8d3b5a16e6a66793/FLAG5f2cb98a9 [2024-11-19 22:19:55,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd1631ba/63b5fe3fd9fc49cc8d3b5a16e6a66793 [2024-11-19 22:19:55,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:19:55,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:19:55,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:19:55,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:19:55,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:19:55,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37813733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55, skipping insertion in model container [2024-11-19 22:19:55,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:19:55,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2024-11-19 22:19:55,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:19:55,554 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:19:55,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2024-11-19 22:19:55,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:19:55,594 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:19:55,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55 WrapperNode [2024-11-19 22:19:55,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:19:55,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:19:55,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:19:55,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:19:55,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,622 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2024-11-19 22:19:55,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:19:55,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:19:55,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:19:55,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:19:55,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,640 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-11-19 22:19:55,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:19:55,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:19:55,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:19:55,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:19:55,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (1/1) ... [2024-11-19 22:19:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:19:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:19:55,725 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-11-19 22:19:55,726 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-11-19 22:19:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:19:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-19 22:19:55,757 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-19 22:19:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-19 22:19:55,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-19 22:19:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 22:19:55,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 22:19:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 22:19:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 22:19:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 22:19:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 22:19:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:19:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:19:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-19 22:19:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-19 22:19:55,810 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:19:55,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:19:56,029 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2024-11-19 22:19:56,030 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-19 22:19:56,070 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-19 22:19:56,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:19:56,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:19:56,083 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 22:19:56,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:56 BoogieIcfgContainer [2024-11-19 22:19:56,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:19:56,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:19:56,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:19:56,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:19:56,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:19:55" (1/3) ... [2024-11-19 22:19:56,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c5e3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:56, skipping insertion in model container [2024-11-19 22:19:56,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:55" (2/3) ... [2024-11-19 22:19:56,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c5e3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:56, skipping insertion in model container [2024-11-19 22:19:56,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:56" (3/3) ... [2024-11-19 22:19:56,093 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2024-11-19 22:19:56,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:19:56,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:19:56,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:19:56,153 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;@522358f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:19:56,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:19:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 22:19:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:19:56,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:56,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:56,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2024-11-19 22:19:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:56,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7925515] [2024-11-19 22:19:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:19:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:19:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:19:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:19:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 22:19:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 22:19:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:19:56,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7925515] [2024-11-19 22:19:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7925515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:19:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020961028] [2024-11-19 22:19:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:56,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:19:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:19:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:19:56,634 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-11-19 22:19:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:57,260 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2024-11-19 22:19:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:19:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2024-11-19 22:19:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:57,273 INFO L225 Difference]: With dead ends: 382 [2024-11-19 22:19:57,274 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 22:19:57,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:19:57,282 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 385 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:57,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 460 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:19:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 22:19:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2024-11-19 22:19:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2024-11-19 22:19:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2024-11-19 22:19:57,347 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2024-11-19 22:19:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2024-11-19 22:19:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-11-19 22:19:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2024-11-19 22:19:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:19:57,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:57,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:57,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:19:57,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2024-11-19 22:19:57,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:57,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457241659] [2024-11-19 22:19:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:19:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:19:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:19:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:19:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 22:19:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 22:19:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:19:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457241659] [2024-11-19 22:19:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457241659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:57,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:57,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:19:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293428293] [2024-11-19 22:19:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:57,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:19:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:19:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:19:57,519 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-19 22:19:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:58,124 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2024-11-19 22:19:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:19:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2024-11-19 22:19:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:58,128 INFO L225 Difference]: With dead ends: 622 [2024-11-19 22:19:58,128 INFO L226 Difference]: Without dead ends: 413 [2024-11-19 22:19:58,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:19:58,130 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 463 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:58,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 742 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:19:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-19 22:19:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2024-11-19 22:19:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2024-11-19 22:19:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2024-11-19 22:19:58,191 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2024-11-19 22:19:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:58,192 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2024-11-19 22:19:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-19 22:19:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2024-11-19 22:19:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:19:58,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:58,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:19:58,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:58,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2024-11-19 22:19:58,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912187625] [2024-11-19 22:19:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:19:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:19:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:19:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:19:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 22:19:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 22:19:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:19:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912187625] [2024-11-19 22:19:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912187625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:58,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:19:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44440678] [2024-11-19 22:19:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:58,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:19:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:19:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:19:58,314 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 22:19:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:58,766 INFO L93 Difference]: Finished difference Result 1009 states and 1418 transitions. [2024-11-19 22:19:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:19:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2024-11-19 22:19:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:58,773 INFO L225 Difference]: With dead ends: 1009 [2024-11-19 22:19:58,773 INFO L226 Difference]: Without dead ends: 694 [2024-11-19 22:19:58,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 22:19:58,776 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 578 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:58,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 477 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:19:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-19 22:19:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 618. [2024-11-19 22:19:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 495 states have (on average 1.38989898989899) internal successors, (688), 505 states have internal predecessors, (688), 72 states have call successors, (72), 43 states have call predecessors, (72), 50 states have return successors, (91), 72 states have call predecessors, (91), 70 states have call successors, (91) [2024-11-19 22:19:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 851 transitions. [2024-11-19 22:19:58,846 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 851 transitions. Word has length 64 [2024-11-19 22:19:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:58,847 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 851 transitions. [2024-11-19 22:19:58,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 22:19:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 851 transitions. [2024-11-19 22:19:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:19:58,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:58,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:19:58,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:58,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2024-11-19 22:19:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075368065] [2024-11-19 22:19:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:19:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:19:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:19:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 22:19:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 22:19:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:19:58,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075368065] [2024-11-19 22:19:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075368065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 22:19:58,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939775833] [2024-11-19 22:19:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:58,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:19:58,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:19:58,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:19:58,969 INFO L87 Difference]: Start difference. First operand 618 states and 851 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-19 22:19:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:19:59,344 INFO L93 Difference]: Finished difference Result 1286 states and 1778 transitions. [2024-11-19 22:19:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:19:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-19 22:19:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:19:59,347 INFO L225 Difference]: With dead ends: 1286 [2024-11-19 22:19:59,347 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 22:19:59,348 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-11-19 22:19:59,349 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 128 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:19:59,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 620 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:19:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 22:19:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 633. [2024-11-19 22:19:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 507 states have (on average 1.3747534516765285) internal successors, (697), 517 states have internal predecessors, (697), 72 states have call successors, (72), 43 states have call predecessors, (72), 53 states have return successors, (94), 75 states have call predecessors, (94), 70 states have call successors, (94) [2024-11-19 22:19:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 863 transitions. [2024-11-19 22:19:59,380 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 863 transitions. Word has length 65 [2024-11-19 22:19:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:19:59,381 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 863 transitions. [2024-11-19 22:19:59,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-19 22:19:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 863 transitions. [2024-11-19 22:19:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:19:59,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:19:59,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:19:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:19:59,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:19:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:19:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2024-11-19 22:19:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:19:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328317290] [2024-11-19 22:19:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:19:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:19:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:19:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:19:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:19:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:19:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 22:19:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 22:19:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:19:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:19:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:19:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328317290] [2024-11-19 22:19:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328317290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:19:59,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:19:59,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 22:19:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109826289] [2024-11-19 22:19:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:19:59,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:19:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:19:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:19:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:19:59,489 INFO L87 Difference]: Start difference. First operand 633 states and 863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 22:20:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:20:00,663 INFO L93 Difference]: Finished difference Result 2838 states and 3984 transitions. [2024-11-19 22:20:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 22:20:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-19 22:20:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:20:00,668 INFO L225 Difference]: With dead ends: 2838 [2024-11-19 22:20:00,668 INFO L226 Difference]: Without dead ends: 996 [2024-11-19 22:20:00,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 22:20:00,672 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 1130 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:20:00,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 945 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:20:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-19 22:20:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 841. [2024-11-19 22:20:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 659 states have (on average 1.3368740515933233) internal successors, (881), 673 states have internal predecessors, (881), 102 states have call successors, (102), 64 states have call predecessors, (102), 79 states have return successors, (143), 106 states have call predecessors, (143), 100 states have call successors, (143) [2024-11-19 22:20:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1126 transitions. [2024-11-19 22:20:00,721 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1126 transitions. Word has length 65 [2024-11-19 22:20:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:20:00,723 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1126 transitions. [2024-11-19 22:20:00,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 22:20:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1126 transitions. [2024-11-19 22:20:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:20:00,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:20:00,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:20:00,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:20:00,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:20:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:20:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1228594481, now seen corresponding path program 1 times [2024-11-19 22:20:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:20:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010203432] [2024-11-19 22:20:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:20:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:20:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:20:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:20:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:20:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:20:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:20:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:20:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:20:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010203432] [2024-11-19 22:20:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010203432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:20:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:20:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 22:20:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289074465] [2024-11-19 22:20:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:20:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:20:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:20:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:20:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:20:00,835 INFO L87 Difference]: Start difference. First operand 841 states and 1126 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-19 22:20:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:20:01,206 INFO L93 Difference]: Finished difference Result 1797 states and 2432 transitions. [2024-11-19 22:20:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:20:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-19 22:20:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:20:01,211 INFO L225 Difference]: With dead ends: 1797 [2024-11-19 22:20:01,211 INFO L226 Difference]: Without dead ends: 978 [2024-11-19 22:20:01,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:20:01,214 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:20:01,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 571 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:20:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-19 22:20:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 886. [2024-11-19 22:20:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 695 states have (on average 1.3194244604316547) internal successors, (917), 709 states have internal predecessors, (917), 102 states have call successors, (102), 64 states have call predecessors, (102), 88 states have return successors, (152), 115 states have call predecessors, (152), 100 states have call successors, (152) [2024-11-19 22:20:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1171 transitions. [2024-11-19 22:20:01,263 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1171 transitions. Word has length 66 [2024-11-19 22:20:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:20:01,263 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1171 transitions. [2024-11-19 22:20:01,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-19 22:20:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1171 transitions. [2024-11-19 22:20:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:20:01,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:20:01,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:20:01,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:20:01,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:20:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:20:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1680169421, now seen corresponding path program 1 times [2024-11-19 22:20:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:20:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412600982] [2024-11-19 22:20:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:20:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:20:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:20:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:20:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:20:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:20:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:20:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:20:01,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:20:01,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412600982] [2024-11-19 22:20:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412600982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:20:01,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:20:01,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:20:01,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320329815] [2024-11-19 22:20:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:20:01,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:20:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:20:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:20:01,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:20:01,398 INFO L87 Difference]: Start difference. First operand 886 states and 1171 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 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-11-19 22:20:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:20:01,952 INFO L93 Difference]: Finished difference Result 1866 states and 2474 transitions. [2024-11-19 22:20:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 22:20:01,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2024-11-19 22:20:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:20:01,957 INFO L225 Difference]: With dead ends: 1866 [2024-11-19 22:20:01,957 INFO L226 Difference]: Without dead ends: 1089 [2024-11-19 22:20:01,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:20:01,959 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 382 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:20:01,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 460 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:20:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-19 22:20:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 895. [2024-11-19 22:20:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 704 states have (on average 1.3125) internal successors, (924), 716 states have internal predecessors, (924), 103 states have call successors, (103), 65 states have call predecessors, (103), 87 states have return successors, (148), 116 states have call predecessors, (148), 101 states have call successors, (148) [2024-11-19 22:20:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1175 transitions. [2024-11-19 22:20:02,003 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1175 transitions. Word has length 66 [2024-11-19 22:20:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:20:02,004 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1175 transitions. [2024-11-19 22:20:02,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 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-11-19 22:20:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1175 transitions. [2024-11-19 22:20:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:20:02,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:20:02,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:20:02,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:20:02,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:20:02,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:20:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1814182927, now seen corresponding path program 1 times [2024-11-19 22:20:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:20:02,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072174179] [2024-11-19 22:20:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:20:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:20:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:20:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:20:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:20:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:20:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:20:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:20:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:20:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072174179] [2024-11-19 22:20:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072174179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:20:02,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:20:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:20:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912422142] [2024-11-19 22:20:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:20:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:20:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:20:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:20:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:20:02,087 INFO L87 Difference]: Start difference. First operand 895 states and 1175 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 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-11-19 22:20:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:20:02,505 INFO L93 Difference]: Finished difference Result 2780 states and 3697 transitions. [2024-11-19 22:20:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:20:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 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 66 [2024-11-19 22:20:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:20:02,513 INFO L225 Difference]: With dead ends: 2780 [2024-11-19 22:20:02,513 INFO L226 Difference]: Without dead ends: 1910 [2024-11-19 22:20:02,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-19 22:20:02,515 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 334 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:20:02,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 370 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:20:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-11-19 22:20:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1744. [2024-11-19 22:20:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1358 states have (on average 1.2908689248895435) internal successors, (1753), 1383 states have internal predecessors, (1753), 207 states have call successors, (207), 129 states have call predecessors, (207), 178 states have return successors, (338), 237 states have call predecessors, (338), 205 states have call successors, (338) [2024-11-19 22:20:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2298 transitions. [2024-11-19 22:20:02,613 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2298 transitions. Word has length 66 [2024-11-19 22:20:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:20:02,613 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2298 transitions. [2024-11-19 22:20:02,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 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-11-19 22:20:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2298 transitions. [2024-11-19 22:20:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:20:02,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:20:02,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:20:02,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:20:02,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:20:02,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:20:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash -825282310, now seen corresponding path program 1 times [2024-11-19 22:20:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:20:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972117299] [2024-11-19 22:20:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:20:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:20:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:20:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:20:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 22:20:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:20:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:20:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 22:20:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:20:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:20:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:20:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972117299] [2024-11-19 22:20:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972117299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:20:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:20:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:20:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317217313] [2024-11-19 22:20:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:20:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:20:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:20:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:20:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:20:02,661 INFO L87 Difference]: Start difference. First operand 1744 states and 2298 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:20:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:20:02,905 INFO L93 Difference]: Finished difference Result 3467 states and 4654 transitions. [2024-11-19 22:20:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:20:02,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-19 22:20:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:20:02,908 INFO L225 Difference]: With dead ends: 3467 [2024-11-19 22:20:02,908 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:20:02,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:20:02,913 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 261 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:20:02,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 177 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:20:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:20:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:20:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:20:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:20:02,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-19 22:20:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:20:02,915 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:20:02,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:20:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:20:02,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:20:02,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:20:02,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:20:02,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:20:02,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:20:41,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:20:41,587 WARN L156 FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~p_dw_pc~0 0) .cse1) (and (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2)))) Eliminated clause: (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) [2024-11-19 22:20:41,615 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events contained old-variable. Original clause: (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~p_dw_pc~0 0) .cse1) (and (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2)))) Eliminated clause: (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) [2024-11-19 22:20:41,624 WARN L156 FloydHoareUtils]: Requires clause for update_channels contained old-variable. Original clause: (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~p_dw_pc~0 0) .cse1) (and (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2)))) Eliminated clause: (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) [2024-11-19 22:20:41,631 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events contained old-variable. Original clause: (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~p_dw_pc~0 0) .cse1) (and (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2)))) Eliminated clause: (let ((.cse0 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) [2024-11-19 22:20:41,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:20:41 BoogieIcfgContainer [2024-11-19 22:20:41,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:20:41,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:20:41,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:20:41,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:20:41,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:56" (3/4) ... [2024-11-19 22:20:41,652 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 22:20:41,655 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-19 22:20:41,656 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-19 22:20:41,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-19 22:20:41,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 22:20:41,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 22:20:41,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:20:41,760 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:20:41,760 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 22:20:41,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:20:41,761 INFO L158 Benchmark]: Toolchain (without parser) took 46428.35ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 86.6MB in the beginning and 550.1MB in the end (delta: -463.5MB). Peak memory consumption was 575.5MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,761 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:20:41,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.13ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 70.5MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 155.2MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,762 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,762 INFO L158 Benchmark]: RCFGBuilder took 423.36ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 106.1MB in the end (delta: -40.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,763 INFO L158 Benchmark]: TraceAbstraction took 45562.99ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 105.3MB in the beginning and 559.5MB in the end (delta: -454.2MB). Peak memory consumption was 704.9MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,763 INFO L158 Benchmark]: Witness Printer took 110.94ms. Allocated memory is still 1.2GB. Free memory was 559.5MB in the beginning and 550.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:20:41,765 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.15ms. Allocated memory is still 117.4MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.13ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 70.5MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 155.2MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.36ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 106.1MB in the end (delta: -40.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45562.99ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 105.3MB in the beginning and 559.5MB in the end (delta: -454.2MB). Peak memory consumption was 704.9MB. Max. memory is 16.1GB. * Witness Printer took 110.94ms. Allocated memory is still 1.2GB. Free memory was 559.5MB in the beginning and 550.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3874 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3786 mSDsluCounter, 4822 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3679 mSDsCounter, 870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4955 IncrementalHoareTripleChecker+Invalid, 5825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 870 mSolverCounterUnsat, 1143 mSDtfsCounter, 4955 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1744occurred in iteration=8, InterpolantAutomatonStates: 131, 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, 9 MinimizatonAttempts, 855 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) - InvariantResult [Line: 210]: Location Invariant Derived location invariant: (((0 < p_dw_pc) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) - InvariantResult [Line: 164]: Location Invariant Derived location invariant: ((((p_dw_pc == 0) || (0 < p_dw_pc)) && (c_dr_pc == 0)) || ((c_dr_pc == 1) && ((p_dw_pc == 0) || (0 < p_dw_pc)))) - ProcedureContractResult [Line: 379]: Procedure Contract for activate_threads Derived contract for procedure activate_threads. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: (((((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2)) && (((c_dr_pc != 0) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_dw_st == 0))) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || (p_dw_pc == 1)) || (c_dr_pc != p_dw_pc))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 287]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: ((((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 91]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: ((((\result == 0) || (c_dr_pc != 0)) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 307]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: ((((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev))) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 0))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 254]: Procedure Contract for update_channels Derived contract for procedure update_channels. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: ((((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) && ((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 325]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: (((((((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) != 1)) || (c_dr_pc != 0)) || (\old(q_read_ev) != \old(q_write_ev))) || (q_read_ev == 2)) && ((\old(q_read_ev) == q_read_ev) || (q_read_ev == 2))) && ((((c_dr_pc != 0) || (q_write_ev == 2)) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 62]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) Ensures: ((((((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2)) && ((p_dw_pc != 0) || (\result == 0))) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: (0 && ((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t)))) RESULT: Ultimate proved your program to be correct! [2024-11-19 22:20:41,787 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 Result: TRUE