./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 15:28:32,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:28:32,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:28:32,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:28:32,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:28:32,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:28:32,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:28:32,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:28:32,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:28:32,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:28:32,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:28:32,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:28:32,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:28:32,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:28:32,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:28:32,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:28:32,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:28:32,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:28:32,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:28:32,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:28:32,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:28:32,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:28:32,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:28:32,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:28:32,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:28:32,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:28:32,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:28:32,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:28:32,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:28:32,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:28:32,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:28:32,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:28:32,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:28:32,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:28:32,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:28:32,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:28:32,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:28:32,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:28:32,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:28:32,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:28:32,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:28:32,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:28:32,920 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-08 15:28:33,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:28:33,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:28:33,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:28:33,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:28:33,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:28:33,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-11-08 15:28:34,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:28:34,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:28:34,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-11-08 15:28:34,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864f58e50/ecf2056ff1fb4b6a90409307f389be2f/FLAG72fe1b767 [2024-11-08 15:28:34,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864f58e50/ecf2056ff1fb4b6a90409307f389be2f [2024-11-08 15:28:34,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:28:34,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:28:34,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:28:34,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:28:34,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:28:34,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:28:34" (1/1) ... [2024-11-08 15:28:34,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e9549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:34, skipping insertion in model container [2024-11-08 15:28:34,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:28:34" (1/1) ... [2024-11-08 15:28:34,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:28:35,011 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-08 15:28:35,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:28:35,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:28:35,117 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-08 15:28:35,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:28:35,181 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:28:35,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35 WrapperNode [2024-11-08 15:28:35,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:28:35,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:28:35,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:28:35,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:28:35,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,228 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2024-11-08 15:28:35,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:28:35,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:28:35,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:28:35,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:28:35,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,259 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-08 15:28:35,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:28:35,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:28:35,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:28:35,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:28:35,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (1/1) ... [2024-11-08 15:28:35,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:28:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:28:35,320 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-08 15:28:35,325 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-08 15:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-08 15:28:35,372 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-08 15:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-08 15:28:35,372 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-08 15:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 15:28:35,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 15:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 15:28:35,374 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 15:28:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 15:28:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 15:28:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 15:28:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 15:28:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:28:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 15:28:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 15:28:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:28:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:28:35,376 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-08 15:28:35,376 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-08 15:28:35,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:28:35,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:28:35,819 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2024-11-08 15:28:35,820 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-08 15:28:35,872 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 15:28:35,872 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:28:35,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:28:35,892 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 15:28:35,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:28:35 BoogieIcfgContainer [2024-11-08 15:28:35,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:28:35,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:28:35,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:28:35,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:28:35,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:28:34" (1/3) ... [2024-11-08 15:28:35,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d539b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:28:35, skipping insertion in model container [2024-11-08 15:28:35,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:28:35" (2/3) ... [2024-11-08 15:28:35,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d539b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:28:35, skipping insertion in model container [2024-11-08 15:28:35,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:28:35" (3/3) ... [2024-11-08 15:28:35,898 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2024-11-08 15:28:35,910 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:28:35,910 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:28:35,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:28:35,966 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;@71f094f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:28:35,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:28:35,971 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-08 15:28:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:28:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:35,983 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-08 15:28:35,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:35,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2024-11-08 15:28:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938256508] [2024-11-08 15:28:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:28:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:28:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:28:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:36,575 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-08 15:28:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938256508] [2024-11-08 15:28:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938256508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:28:36,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263879634] [2024-11-08 15:28:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:28:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:28:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:28:36,619 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-08 15:28:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:37,499 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2024-11-08 15:28:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:28:37,502 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-08 15:28:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:37,514 INFO L225 Difference]: With dead ends: 382 [2024-11-08 15:28:37,515 INFO L226 Difference]: Without dead ends: 264 [2024-11-08 15:28:37,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:28:37,521 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 385 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:37,522 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.6s Time] [2024-11-08 15:28:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-08 15:28:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2024-11-08 15:28:37,592 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-08 15:28:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2024-11-08 15:28:37,602 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2024-11-08 15:28:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:37,602 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2024-11-08 15:28:37,603 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-08 15:28:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2024-11-08 15:28:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:28:37,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:37,612 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-08 15:28:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:28:37,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:37,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2024-11-08 15:28:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35582389] [2024-11-08 15:28:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:28:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:28:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:28:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:37,870 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-08 15:28:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35582389] [2024-11-08 15:28:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35582389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:37,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:37,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:28:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961645633] [2024-11-08 15:28:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:28:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:28:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:28:37,875 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-08 15:28:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:38,755 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2024-11-08 15:28:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:28:38,756 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-08 15:28:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:38,764 INFO L225 Difference]: With dead ends: 622 [2024-11-08 15:28:38,765 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 15:28:38,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:28:38,768 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 463 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:38,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 742 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 15:28:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 15:28:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2024-11-08 15:28:38,853 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-08 15:28:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2024-11-08 15:28:38,858 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2024-11-08 15:28:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2024-11-08 15:28:38,861 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-08 15:28:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2024-11-08 15:28:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:28:38,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:38,868 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-08 15:28:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:28:38,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:38,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2024-11-08 15:28:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474532198] [2024-11-08 15:28:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:28:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:28:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:28:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,023 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-08 15:28:39,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474532198] [2024-11-08 15:28:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474532198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:39,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:28:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267041422] [2024-11-08 15:28:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:39,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:28:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:28:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:28:39,029 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-08 15:28:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:39,631 INFO L93 Difference]: Finished difference Result 1009 states and 1418 transitions. [2024-11-08 15:28:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:28:39,631 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-08 15:28:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:39,638 INFO L225 Difference]: With dead ends: 1009 [2024-11-08 15:28:39,639 INFO L226 Difference]: Without dead ends: 694 [2024-11-08 15:28:39,641 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-08 15:28:39,642 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:39,645 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.4s Time] [2024-11-08 15:28:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-08 15:28:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 618. [2024-11-08 15:28:39,708 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-08 15:28:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 851 transitions. [2024-11-08 15:28:39,714 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 851 transitions. Word has length 64 [2024-11-08 15:28:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:39,714 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 851 transitions. [2024-11-08 15:28:39,715 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-08 15:28:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 851 transitions. [2024-11-08 15:28:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:28:39,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:39,720 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-08 15:28:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:28:39,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2024-11-08 15:28:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291147815] [2024-11-08 15:28:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:28:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:28:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:39,868 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-08 15:28:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291147815] [2024-11-08 15:28:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291147815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:39,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:39,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:28:39,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052911442] [2024-11-08 15:28:39,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:39,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:28:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:39,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:28:39,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:28:39,871 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-08 15:28:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:40,368 INFO L93 Difference]: Finished difference Result 1286 states and 1778 transitions. [2024-11-08 15:28:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:28:40,369 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-08 15:28:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:40,375 INFO L225 Difference]: With dead ends: 1286 [2024-11-08 15:28:40,375 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 15:28:40,379 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-08 15:28:40,380 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 128 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 15:28:40,382 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-08 15:28:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 15:28:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 633. [2024-11-08 15:28:40,435 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-08 15:28:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 863 transitions. [2024-11-08 15:28:40,440 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 863 transitions. Word has length 65 [2024-11-08 15:28:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 863 transitions. [2024-11-08 15:28:40,440 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-08 15:28:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 863 transitions. [2024-11-08 15:28:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:28:40,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:40,444 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-08 15:28:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:28:40,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:40,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2024-11-08 15:28:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722118771] [2024-11-08 15:28:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:28:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:28:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:40,606 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-08 15:28:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:40,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722118771] [2024-11-08 15:28:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722118771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:40,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:28:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111625709] [2024-11-08 15:28:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:28:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:28:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:28:40,609 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-08 15:28:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:42,185 INFO L93 Difference]: Finished difference Result 2838 states and 3984 transitions. [2024-11-08 15:28:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 15:28:42,186 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-08 15:28:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:42,192 INFO L225 Difference]: With dead ends: 2838 [2024-11-08 15:28:42,192 INFO L226 Difference]: Without dead ends: 996 [2024-11-08 15:28:42,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:28:42,198 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 1130 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:42,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 945 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:28:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-08 15:28:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 841. [2024-11-08 15:28:42,256 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-08 15:28:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1126 transitions. [2024-11-08 15:28:42,261 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1126 transitions. Word has length 65 [2024-11-08 15:28:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1126 transitions. [2024-11-08 15:28:42,261 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-08 15:28:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1126 transitions. [2024-11-08 15:28:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:28:42,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:42,263 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-08 15:28:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:28:42,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:42,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1228594481, now seen corresponding path program 1 times [2024-11-08 15:28:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782105649] [2024-11-08 15:28:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:28:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:28:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:42,398 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-08 15:28:42,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782105649] [2024-11-08 15:28:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782105649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:28:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557413810] [2024-11-08 15:28:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:42,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:28:42,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:28:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:28:42,402 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-08 15:28:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:42,908 INFO L93 Difference]: Finished difference Result 1797 states and 2432 transitions. [2024-11-08 15:28:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:28:42,909 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-08 15:28:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:42,914 INFO L225 Difference]: With dead ends: 1797 [2024-11-08 15:28:42,915 INFO L226 Difference]: Without dead ends: 978 [2024-11-08 15:28:42,917 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-08 15:28:42,918 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:42,918 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.3s Time] [2024-11-08 15:28:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-08 15:28:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 886. [2024-11-08 15:28:42,975 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-08 15:28:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1171 transitions. [2024-11-08 15:28:42,980 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1171 transitions. Word has length 66 [2024-11-08 15:28:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:42,980 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1171 transitions. [2024-11-08 15:28:42,980 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-08 15:28:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1171 transitions. [2024-11-08 15:28:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:28:42,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:42,982 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-08 15:28:42,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:28:42,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:42,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1680169421, now seen corresponding path program 1 times [2024-11-08 15:28:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698241080] [2024-11-08 15:28:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:28:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:28:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:43,143 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-08 15:28:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698241080] [2024-11-08 15:28:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698241080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:43,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:28:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948676510] [2024-11-08 15:28:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:28:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:28:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:28:43,145 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-08 15:28:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:43,869 INFO L93 Difference]: Finished difference Result 1866 states and 2474 transitions. [2024-11-08 15:28:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:28:43,870 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-08 15:28:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:43,878 INFO L225 Difference]: With dead ends: 1866 [2024-11-08 15:28:43,878 INFO L226 Difference]: Without dead ends: 1089 [2024-11-08 15:28:43,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:28:43,883 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 382 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:43,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 460 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:28:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-08 15:28:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 895. [2024-11-08 15:28:43,974 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-08 15:28:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1175 transitions. [2024-11-08 15:28:43,979 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1175 transitions. Word has length 66 [2024-11-08 15:28:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:43,979 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1175 transitions. [2024-11-08 15:28:43,980 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-08 15:28:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1175 transitions. [2024-11-08 15:28:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:28:43,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:43,983 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-08 15:28:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:28:43,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1814182927, now seen corresponding path program 1 times [2024-11-08 15:28:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845011105] [2024-11-08 15:28:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:28:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:28:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,090 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-08 15:28:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845011105] [2024-11-08 15:28:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845011105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:44,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:44,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:28:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385960742] [2024-11-08 15:28:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:44,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:28:44,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:28:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:28:44,092 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-08 15:28:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:44,651 INFO L93 Difference]: Finished difference Result 2780 states and 3697 transitions. [2024-11-08 15:28:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:28:44,652 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-08 15:28:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:44,665 INFO L225 Difference]: With dead ends: 2780 [2024-11-08 15:28:44,665 INFO L226 Difference]: Without dead ends: 1910 [2024-11-08 15:28:44,669 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-08 15:28:44,670 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 334 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:44,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 370 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:28:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-11-08 15:28:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1744. [2024-11-08 15:28:44,782 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-08 15:28:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2298 transitions. [2024-11-08 15:28:44,791 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2298 transitions. Word has length 66 [2024-11-08 15:28:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:44,791 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2298 transitions. [2024-11-08 15:28:44,792 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-08 15:28:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2298 transitions. [2024-11-08 15:28:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 15:28:44,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:28:44,794 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-08 15:28:44,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:28:44,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:28:44,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:28:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash -825282310, now seen corresponding path program 1 times [2024-11-08 15:28:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:28:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732261273] [2024-11-08 15:28:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:28:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:28:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:28:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:28:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:28:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:28:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:28:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:28:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:28:44,867 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-08 15:28:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:28:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732261273] [2024-11-08 15:28:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732261273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:28:44,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:28:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:28:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141506507] [2024-11-08 15:28:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:28:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:28:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:28:44,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:28:44,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:28:44,871 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-08 15:28:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:28:45,196 INFO L93 Difference]: Finished difference Result 3467 states and 4654 transitions. [2024-11-08 15:28:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:28:45,197 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-08 15:28:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:28:45,200 INFO L225 Difference]: With dead ends: 3467 [2024-11-08 15:28:45,201 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:28:45,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:28:45,209 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:28:45,209 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.2s Time] [2024-11-08 15:28:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:28:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:28:45,210 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-08 15:28:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:28:45,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-08 15:28:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:28:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:28:45,213 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-08 15:28:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:28:45,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:28:45,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:28:45,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:28:45,219 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:28:45,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:29:26,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:29:26,446 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-08 15:29:26,492 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-08 15:29:26,511 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-08 15:29:26,525 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-08 15:29:26,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:29:26 BoogieIcfgContainer [2024-11-08 15:29:26,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:29:26,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:29:26,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:29:26,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:29:26,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:28:35" (3/4) ... [2024-11-08 15:29:26,554 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:29:26,558 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-11-08 15:29:26,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-08 15:29:26,560 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-08 15:29:26,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-08 15:29:26,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 15:29:26,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:29:26,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:29:26,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:29:26,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:29:26,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:29:26,697 INFO L158 Benchmark]: Toolchain (without parser) took 51905.72ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 139.3MB in the beginning and 929.7MB in the end (delta: -790.4MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,697 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:29:26,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.64ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 123.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,698 INFO L158 Benchmark]: Boogie Preprocessor took 48.07ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 118.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,698 INFO L158 Benchmark]: RCFGBuilder took 613.67ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 124.5MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,699 INFO L158 Benchmark]: TraceAbstraction took 50656.46ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 124.5MB in the beginning and 938.1MB in the end (delta: -813.6MB). Peak memory consumption was 780.2MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,700 INFO L158 Benchmark]: Witness Printer took 144.54ms. Allocated memory is still 1.3GB. Free memory was 938.1MB in the beginning and 929.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:29:26,701 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.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.64ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 123.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.07ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 118.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.67ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 124.5MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50656.46ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 124.5MB in the beginning and 938.1MB in the end (delta: -813.6MB). Peak memory consumption was 780.2MB. Max. memory is 16.1GB. * Witness Printer took 144.54ms. Allocated memory is still 1.3GB. Free memory was 938.1MB in the beginning and 929.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 9.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3872 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3786 mSDsluCounter, 4822 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3679 mSDsCounter, 869 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4972 IncrementalHoareTripleChecker+Invalid, 5841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 869 mSolverCounterUnsat, 1143 mSDtfsCounter, 4972 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.5s 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.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 855 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s 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-08 15:29:26,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE