./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/product-lines/minepump_spec1_product39.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 1a60868809a0ad0cb359a526a1f66a469756e048a31d4d83c9a3de774ac0575c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:42,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:42,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:42,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:42,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:42,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:42,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:42,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:42,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:42,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:42,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:42,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:42,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:42,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:42,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:42,508 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1a60868809a0ad0cb359a526a1f66a469756e048a31d4d83c9a3de774ac0575c [2025-03-08 05:38:42,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:42,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:42,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:42,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:42,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:42,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2025-03-08 05:38:43,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadaa61b1/60052f5dde9940a993e92e74c84c0841/FLAG800dddedc [2025-03-08 05:38:44,122 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:38:44,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2025-03-08 05:38:44,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadaa61b1/60052f5dde9940a993e92e74c84c0841/FLAG800dddedc [2025-03-08 05:38:44,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadaa61b1/60052f5dde9940a993e92e74c84c0841 [2025-03-08 05:38:44,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:38:44,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:38:44,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:44,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:38:44,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:38:44,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ef5295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44, skipping insertion in model container [2025-03-08 05:38:44,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:38:44,647 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/product-lines/minepump_spec1_product39.cil.c[11731,11744] [2025-03-08 05:38:44,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:44,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:38:44,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2025-03-08 05:38:44,702 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [415] [2025-03-08 05:38:44,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] [2025-03-08 05:38:44,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] [2025-03-08 05:38:44,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [553] [2025-03-08 05:38:44,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [623] [2025-03-08 05:38:44,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [819] [2025-03-08 05:38:44,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [857] [2025-03-08 05:38:44,743 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/product-lines/minepump_spec1_product39.cil.c[11731,11744] [2025-03-08 05:38:44,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:44,763 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:38:44,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44 WrapperNode [2025-03-08 05:38:44,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:44,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:44,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:38:44,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:38:44,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,789 INFO L138 Inliner]: procedures = 54, calls = 99, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 186 [2025-03-08 05:38:44,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:44,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:38:44,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:38:44,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:38:44,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,806 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]. [2025-03-08 05:38:44,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:38:44,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:38:44,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:38:44,812 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:38:44,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 05:38:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:44,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:44,835 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) [2025-03-08 05:38:44,837 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 [2025-03-08 05:38:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:38:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:38:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:38:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:38:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:38:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:38:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:38:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:38:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:38:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:38:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:38:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:38:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:38:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:38:44,912 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:38:44,914 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:38:45,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2025-03-08 05:38:45,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-03-08 05:38:45,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: #res := ~retValue_acc~3; [2025-03-08 05:38:45,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: main_#res#1 := main_~retValue_acc~11#1; [2025-03-08 05:38:45,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L854-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-03-08 05:38:45,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L801-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2025-03-08 05:38:45,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; [2025-03-08 05:38:45,101 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 05:38:45,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:38:45,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:38:45,107 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:38:45,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:45 BoogieIcfgContainer [2025-03-08 05:38:45,107 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:38:45,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:38:45,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:38:45,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:38:45,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:44" (1/3) ... [2025-03-08 05:38:45,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f517aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:45, skipping insertion in model container [2025-03-08 05:38:45,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (2/3) ... [2025-03-08 05:38:45,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f517aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:45, skipping insertion in model container [2025-03-08 05:38:45,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:45" (3/3) ... [2025-03-08 05:38:45,113 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product39.cil.c [2025-03-08 05:38:45,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:38:45,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product39.cil.c that has 9 procedures, 89 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:38:45,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:38:45,173 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;@2f8c2f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:38:45,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:38:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 74 states have internal predecessors, (89), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:38:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:38:45,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,182 INFO L218 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] [2025-03-08 05:38:45,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1044068687, now seen corresponding path program 1 times [2025-03-08 05:38:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133996376] [2025-03-08 05:38:45,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:38:45,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:38:45,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133996376] [2025-03-08 05:38:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133996376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835352967] [2025-03-08 05:38:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:45,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:45,361 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 74 states have internal predecessors, (89), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,381 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2025-03-08 05:38:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 05:38:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,387 INFO L225 Difference]: With dead ends: 158 [2025-03-08 05:38:45,387 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 05:38:45,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:45,391 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 173 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 05:38:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 05:38:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 61 states have internal predecessors, (71), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:38:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-08 05:38:45,417 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 23 [2025-03-08 05:38:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-08 05:38:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-08 05:38:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 05:38:45,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,419 INFO L218 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] [2025-03-08 05:38:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:38:45,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -551222896, now seen corresponding path program 1 times [2025-03-08 05:38:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042360081] [2025-03-08 05:38:45,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 05:38:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:38:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042360081] [2025-03-08 05:38:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042360081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765006603] [2025-03-08 05:38:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:45,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:45,538 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,578 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2025-03-08 05:38:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-08 05:38:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,580 INFO L225 Difference]: With dead ends: 201 [2025-03-08 05:38:45,581 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 05:38:45,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:45,582 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 189 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 05:38:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-03-08 05:38:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 111 states have internal predecessors, (131), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 05:38:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2025-03-08 05:38:45,602 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 26 [2025-03-08 05:38:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,602 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2025-03-08 05:38:45,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2025-03-08 05:38:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 05:38:45,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,605 INFO L218 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] [2025-03-08 05:38:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:38:45,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1198129620, now seen corresponding path program 1 times [2025-03-08 05:38:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827494936] [2025-03-08 05:38:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 05:38:45,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 05:38:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827494936] [2025-03-08 05:38:45,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827494936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210453] [2025-03-08 05:38:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:45,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:45,719 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,806 INFO L93 Difference]: Finished difference Result 337 states and 456 transitions. [2025-03-08 05:38:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:45,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-08 05:38:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,809 INFO L225 Difference]: With dead ends: 337 [2025-03-08 05:38:45,809 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 05:38:45,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:38:45,810 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 326 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 05:38:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2025-03-08 05:38:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 153 states have (on average 1.326797385620915) internal successors, (203), 168 states have internal predecessors, (203), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-08 05:38:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2025-03-08 05:38:45,836 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 271 transitions. Word has length 30 [2025-03-08 05:38:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,836 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 271 transitions. [2025-03-08 05:38:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 271 transitions. [2025-03-08 05:38:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,839 INFO L218 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] [2025-03-08 05:38:45,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:38:45,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 469125354, now seen corresponding path program 1 times [2025-03-08 05:38:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904001858] [2025-03-08 05:38:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:45,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:45,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904001858] [2025-03-08 05:38:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904001858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:38:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147376015] [2025-03-08 05:38:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:38:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:38:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:45,930 INFO L87 Difference]: Start difference. First operand 210 states and 271 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:46,061 INFO L93 Difference]: Finished difference Result 783 states and 1064 transitions. [2025-03-08 05:38:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:38:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:46,067 INFO L225 Difference]: With dead ends: 783 [2025-03-08 05:38:46,067 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 05:38:46,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:46,072 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 135 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:46,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 310 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 05:38:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2025-03-08 05:38:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 412 states have (on average 1.3106796116504855) internal successors, (540), 446 states have internal predecessors, (540), 77 states have call successors, (77), 69 states have call predecessors, (77), 71 states have return successors, (127), 73 states have call predecessors, (127), 77 states have call successors, (127) [2025-03-08 05:38:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 744 transitions. [2025-03-08 05:38:46,139 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 744 transitions. Word has length 40 [2025-03-08 05:38:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 744 transitions. [2025-03-08 05:38:46,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 744 transitions. [2025-03-08 05:38:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:46,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:46,142 INFO L218 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] [2025-03-08 05:38:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:38:46,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1286773804, now seen corresponding path program 1 times [2025-03-08 05:38:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831466339] [2025-03-08 05:38:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:46,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:46,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:46,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831466339] [2025-03-08 05:38:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831466339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:46,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:46,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567020226] [2025-03-08 05:38:46,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:46,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:46,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:46,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:46,225 INFO L87 Difference]: Start difference. First operand 561 states and 744 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:46,271 INFO L93 Difference]: Finished difference Result 1133 states and 1539 transitions. [2025-03-08 05:38:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:46,280 INFO L225 Difference]: With dead ends: 1133 [2025-03-08 05:38:46,280 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 05:38:46,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:46,283 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:46,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 05:38:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2025-03-08 05:38:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 430 states have (on average 1.2976744186046512) internal successors, (558), 464 states have internal predecessors, (558), 77 states have call successors, (77), 69 states have call predecessors, (77), 71 states have return successors, (127), 73 states have call predecessors, (127), 77 states have call successors, (127) [2025-03-08 05:38:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 762 transitions. [2025-03-08 05:38:46,326 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 762 transitions. Word has length 40 [2025-03-08 05:38:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:46,327 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 762 transitions. [2025-03-08 05:38:46,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 762 transitions. [2025-03-08 05:38:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:46,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:46,328 INFO L218 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] [2025-03-08 05:38:46,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:38:46,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash 289701451, now seen corresponding path program 1 times [2025-03-08 05:38:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:46,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933756502] [2025-03-08 05:38:46,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:46,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:46,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:46,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933756502] [2025-03-08 05:38:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933756502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:38:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939639121] [2025-03-08 05:38:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:46,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:38:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:46,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:38:46,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:46,395 INFO L87 Difference]: Start difference. First operand 579 states and 762 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:46,428 INFO L93 Difference]: Finished difference Result 1072 states and 1453 transitions. [2025-03-08 05:38:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:38:46,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:46,433 INFO L225 Difference]: With dead ends: 1072 [2025-03-08 05:38:46,433 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 05:38:46,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:46,435 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:46,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 05:38:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-08 05:38:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 369 states have (on average 1.2791327913279134) internal successors, (472), 398 states have internal predecessors, (472), 68 states have call successors, (68), 60 states have call predecessors, (68), 62 states have return successors, (104), 64 states have call predecessors, (104), 68 states have call successors, (104) [2025-03-08 05:38:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 644 transitions. [2025-03-08 05:38:46,481 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 644 transitions. Word has length 40 [2025-03-08 05:38:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:46,482 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 644 transitions. [2025-03-08 05:38:46,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 644 transitions. [2025-03-08 05:38:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:38:46,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:46,483 INFO L218 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] [2025-03-08 05:38:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:38:46,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1877768469, now seen corresponding path program 1 times [2025-03-08 05:38:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553675415] [2025-03-08 05:38:46,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:46,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:38:46,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:38:46,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553675415] [2025-03-08 05:38:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553675415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:46,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:46,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072248800] [2025-03-08 05:38:46,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:46,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:46,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:46,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:46,589 INFO L87 Difference]: Start difference. First operand 500 states and 644 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:46,699 INFO L93 Difference]: Finished difference Result 1464 states and 1941 transitions. [2025-03-08 05:38:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-08 05:38:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:46,705 INFO L225 Difference]: With dead ends: 1464 [2025-03-08 05:38:46,705 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 05:38:46,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:46,708 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:46,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 414 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 05:38:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2025-03-08 05:38:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 710 states have (on average 1.2563380281690142) internal successors, (892), 767 states have internal predecessors, (892), 136 states have call successors, (136), 120 states have call predecessors, (136), 124 states have return successors, (218), 128 states have call predecessors, (218), 136 states have call successors, (218) [2025-03-08 05:38:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1246 transitions. [2025-03-08 05:38:46,791 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1246 transitions. Word has length 44 [2025-03-08 05:38:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:46,791 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1246 transitions. [2025-03-08 05:38:46,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1246 transitions. [2025-03-08 05:38:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:38:46,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:46,792 INFO L218 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] [2025-03-08 05:38:46,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:38:46,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:46,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2123061740, now seen corresponding path program 1 times [2025-03-08 05:38:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986658269] [2025-03-08 05:38:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:46,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:38:46,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:38:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:46,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:38:46,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:38:46,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:38:46,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:46,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:38:46,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:38:46,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:38:46,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:38:46,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:46,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:38:46,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:38:46 BoogieIcfgContainer [2025-03-08 05:38:46,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:38:46,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:38:46,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:38:46,858 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:38:46,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:45" (3/4) ... [2025-03-08 05:38:46,859 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:38:46,907 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-03-08 05:38:46,965 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:38:46,965 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:38:46,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:38:46,966 INFO L158 Benchmark]: Toolchain (without parser) took 2549.60ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 82.9MB in the end (delta: 22.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,967 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.00ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.00ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,968 INFO L158 Benchmark]: Boogie Preprocessor took 22.24ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,968 INFO L158 Benchmark]: IcfgBuilder took 294.91ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 65.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,968 INFO L158 Benchmark]: TraceAbstraction took 1748.95ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 91.3MB in the end (delta: -25.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,969 INFO L158 Benchmark]: Witness Printer took 107.41ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 82.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,970 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.23ms. Allocated memory is still 201.3MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.00ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.00ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.24ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.91ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 65.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1748.95ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 91.3MB in the end (delta: -25.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 107.41ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 82.9MB 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.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [415] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] - GenericResultAtLocation [Line: 553]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [553] - GenericResultAtLocation [Line: 623]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [623] - GenericResultAtLocation [Line: 819]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [819] - GenericResultAtLocation [Line: 857]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [857] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 449]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L460] int waterLevel = 1; [L461] int methaneLevelCritical = 0; [L627] int pumpRunning = 0; [L628] int systemActive = 1; [L858] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L931] int retValue_acc ; [L932] int tmp ; [L936] FCALL select_helpers() [L937] FCALL select_features() [L938] CALL, EXPR valid_product() [L849] int retValue_acc ; [L852] retValue_acc = 1 [L853] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L938] RET, EXPR valid_product() [L938] tmp = valid_product() [L940] COND TRUE \read(tmp) [L942] FCALL setup() [L943] CALL runTest() [L925] CALL test() [L558] int splverifierCounter ; [L559] int tmp ; [L560] int tmp___0 ; [L561] int tmp___1 ; [L562] int tmp___2 ; [L565] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L569] COND TRUE splverifierCounter < 4 [L575] tmp = __VERIFIER_nondet_int() [L577] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L579] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L478] COND TRUE waterLevel < 2 [L479] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L579] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L585] tmp___0 = __VERIFIER_nondet_int() [L587] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L589] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L490] COND FALSE !(\read(methaneLevelCritical)) [L493] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L589] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L595] tmp___2 = __VERIFIER_nondet_int() [L597] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L612] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L634] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L641] COND TRUE \read(systemActive) [L643] CALL processEnvironment() [L689] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L692] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L707] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L663] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L666] COND TRUE ! pumpRunning [L668] CALL, EXPR isHighWaterLevel() [L786] int retValue_acc ; [L787] int tmp ; [L788] int tmp___0 ; [L792] CALL, EXPR isHighWaterSensorDry() [L540] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L543] COND FALSE !(waterLevel < 2) [L547] retValue_acc = 0 [L548] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L792] RET, EXPR isHighWaterSensorDry() [L792] tmp = isHighWaterSensorDry() [L794] COND FALSE !(\read(tmp)) [L797] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L799] retValue_acc = tmp___0 [L800] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L668] RET, EXPR isHighWaterLevel() [L668] tmp = isHighWaterLevel() [L670] COND TRUE \read(tmp) [L672] CALL activatePump() [L717] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L672] RET activatePump() [L707] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L643] RET processEnvironment() [L649] CALL __utac_acc__Specification1_spec__1() [L420] int tmp ; [L421] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L425] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L499] int retValue_acc ; [L502] retValue_acc = methaneLevelCritical [L503] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L425] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L425] tmp = isMethaneLevelCritical() [L427] COND TRUE \read(tmp) [L429] CALL, EXPR isPumpRunning() [L741] int retValue_acc ; [L744] retValue_acc = pumpRunning [L745] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L429] RET, EXPR isPumpRunning() [L429] tmp___0 = isPumpRunning() [L431] COND TRUE \read(tmp___0) [L433] CALL __automaton_fail() [L449] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 89 locations, 131 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 2033 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1304 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 729 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=971occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:38:46,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE