./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 685bdac90b32b89d64927338575dc6f79737e9f84bb9272d4bfb0c942aa4ae35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:51:52,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:51:52,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:51:52,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:51:52,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:51:52,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:51:52,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:51:52,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:51:52,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:51:52,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:51:52,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:51:52,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:51:52,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:51:52,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:51:52,805 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:51:52,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:51:52,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:51:52,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:51:52,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:51:52,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:51:52,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:51:52,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:51:52,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:51:52,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:51:52,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:52,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:51:52,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:51:52,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:51:52,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:51:52,810 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-jdk21/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 -> 685bdac90b32b89d64927338575dc6f79737e9f84bb9272d4bfb0c942aa4ae35 [2025-02-05 15:51:53,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:51:53,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:51:53,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:51:53,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:51:53,115 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:51:53,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c [2025-02-05 15:51:54,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c8bdb401/367689d8024a4e4c8578aaabc72d69c3/FLAG4e0a7befc [2025-02-05 15:51:54,743 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:51:54,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c [2025-02-05 15:51:54,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c8bdb401/367689d8024a4e4c8578aaabc72d69c3/FLAG4e0a7befc [2025-02-05 15:51:54,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c8bdb401/367689d8024a4e4c8578aaabc72d69c3 [2025-02-05 15:51:54,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:51:54,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:51:54,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:54,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:51:54,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:51:54,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714551d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54, skipping insertion in model container [2025-02-05 15:51:54,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:51:55,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c[19412,19425] [2025-02-05 15:51:55,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:55,134 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:51:55,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-02-05 15:51:55,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] [2025-02-05 15:51:55,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [198] [2025-02-05 15:51:55,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [268] [2025-02-05 15:51:55,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [511] [2025-02-05 15:51:55,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [877] [2025-02-05 15:51:55,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [917] [2025-02-05 15:51:55,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1014] [2025-02-05 15:51:55,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product55.cil.c[19412,19425] [2025-02-05 15:51:55,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:55,217 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:51:55,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55 WrapperNode [2025-02-05 15:51:55,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:55,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:55,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:51:55,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:51:55,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,259 INFO L138 Inliner]: procedures = 58, calls = 105, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 226 [2025-02-05 15:51:55,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:55,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:51:55,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:51:55,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:51:55,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,285 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-02-05 15:51:55,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:51:55,298 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:51:55,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:51:55,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:51:55,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (1/1) ... [2025-02-05 15:51:55,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:55,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:55,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:51:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:51:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:51:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:51:55,351 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:51:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:51:55,351 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:51:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:51:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:51:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:51:55,420 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:51:55,422 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:51:55,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:51:55,562 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L410-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2025-02-05 15:51:55,562 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-02-05 15:51:55,568 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~2; [2025-02-05 15:51:55,647 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:51:55,647 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1011-1: main_#res#1 := main_~retValue_acc~13#1; [2025-02-05 15:51:55,677 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L474-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2025-02-05 15:51:55,677 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L186-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~4#1; [2025-02-05 15:51:55,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L493-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~9#1; [2025-02-05 15:51:55,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~5#1; [2025-02-05 15:51:55,744 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-02-05 15:51:55,744 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:51:55,759 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:51:55,760 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:51:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:55 BoogieIcfgContainer [2025-02-05 15:51:55,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:51:55,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:51:55,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:51:55,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:51:55,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:51:54" (1/3) ... [2025-02-05 15:51:55,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b5f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:55, skipping insertion in model container [2025-02-05 15:51:55,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:55" (2/3) ... [2025-02-05 15:51:55,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b5f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:55, skipping insertion in model container [2025-02-05 15:51:55,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:55" (3/3) ... [2025-02-05 15:51:55,770 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product55.cil.c [2025-02-05 15:51:55,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:51:55,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product55.cil.c that has 10 procedures, 105 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:51:55,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:51:55,846 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;@392f25ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:51:55,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:51:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 76 states have (on average 1.368421052631579) internal successors, (104), 87 states have internal predecessors, (104), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-05 15:51:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:51:55,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,860 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] [2025-02-05 15:51:55,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2032356135, now seen corresponding path program 1 times [2025-02-05 15:51:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740627865] [2025-02-05 15:51:55,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:51:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:51:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:56,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740627865] [2025-02-05 15:51:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740627865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:51:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474516186] [2025-02-05 15:51:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:51:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:51:56,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:56,069 INFO L87 Difference]: Start difference. First operand has 104 states, 76 states have (on average 1.368421052631579) internal successors, (104), 87 states have internal predecessors, (104), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-02-05 15:51:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,105 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2025-02-05 15:51:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:51:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 25 [2025-02-05 15:51:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,116 INFO L225 Difference]: With dead ends: 191 [2025-02-05 15:51:56,116 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 15:51:56,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:56,124 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 15:51:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-05 15:51:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 80 states have internal predecessors, (93), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-05 15:51:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2025-02-05 15:51:56,165 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 25 [2025-02-05 15:51:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,165 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2025-02-05 15:51:56,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-02-05 15:51:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2025-02-05 15:51:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:51:56,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,169 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-02-05 15:51:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:51:56,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1537351286, now seen corresponding path program 1 times [2025-02-05 15:51:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567059715] [2025-02-05 15:51:56,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:51:56,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:51:56,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:56,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567059715] [2025-02-05 15:51:56,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567059715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498228771] [2025-02-05 15:51:56,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:56,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:56,285 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-05 15:51:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,301 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2025-02-05 15:51:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2025-02-05 15:51:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,303 INFO L225 Difference]: With dead ends: 154 [2025-02-05 15:51:56,303 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 15:51:56,304 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-02-05 15:51:56,304 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 206 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-02-05 15:51:56,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 206 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 15:51:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 15:51:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 74 states have internal predecessors, (86), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:51:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2025-02-05 15:51:56,314 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 26 [2025-02-05 15:51:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2025-02-05 15:51:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-05 15:51:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2025-02-05 15:51:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:51:56,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,317 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] [2025-02-05 15:51:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:51:56,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 400234387, now seen corresponding path program 1 times [2025-02-05 15:51:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342565444] [2025-02-05 15:51:56,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:51:56,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:51:56,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342565444] [2025-02-05 15:51:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342565444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:51:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872969988] [2025-02-05 15:51:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:56,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:56,490 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02-05 15:51:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,751 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2025-02-05 15:51:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:51:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-02-05 15:51:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,754 INFO L225 Difference]: With dead ends: 286 [2025-02-05 15:51:56,754 INFO L226 Difference]: Without dead ends: 207 [2025-02-05 15:51:56,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:51:56,755 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 270 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 441 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:51:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-05 15:51:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2025-02-05 15:51:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 168 states have internal predecessors, (201), 33 states have call successors, (33), 21 states have call predecessors, (33), 21 states have return successors, (34), 21 states have call predecessors, (34), 33 states have call successors, (34) [2025-02-05 15:51:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 268 transitions. [2025-02-05 15:51:56,783 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 268 transitions. Word has length 29 [2025-02-05 15:51:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,783 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 268 transitions. [2025-02-05 15:51:56,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02-05 15:51:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2025-02-05 15:51:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:51:56,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,785 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] [2025-02-05 15:51:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:51:56,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1624299889, now seen corresponding path program 1 times [2025-02-05 15:51:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059763654] [2025-02-05 15:51:56,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:51:56,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:51:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059763654] [2025-02-05 15:51:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059763654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852000134] [2025-02-05 15:51:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:56,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:56,897 INFO L87 Difference]: Start difference. First operand 201 states and 268 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-05 15:51:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,978 INFO L93 Difference]: Finished difference Result 475 states and 652 transitions. [2025-02-05 15:51:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 33 [2025-02-05 15:51:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,984 INFO L225 Difference]: With dead ends: 475 [2025-02-05 15:51:56,984 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 15:51:56,987 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-02-05 15:51:56,988 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 407 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 15:51:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2025-02-05 15:51:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 224 states have internal predecessors, (269), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-02-05 15:51:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2025-02-05 15:51:57,038 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 33 [2025-02-05 15:51:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,039 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2025-02-05 15:51:57,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-05 15:51:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2025-02-05 15:51:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 15:51:57,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,042 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-02-05 15:51:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:51:57,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1442920967, now seen corresponding path program 1 times [2025-02-05 15:51:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054079950] [2025-02-05 15:51:57,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 15:51:57,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 15:51:57,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054079950] [2025-02-05 15:51:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054079950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270508298] [2025-02-05 15:51:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:57,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:57,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:57,158 INFO L87 Difference]: Start difference. First operand 280 states and 363 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:57,189 INFO L93 Difference]: Finished difference Result 556 states and 750 transitions. [2025-02-05 15:51:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:57,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-02-05 15:51:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:57,192 INFO L225 Difference]: With dead ends: 556 [2025-02-05 15:51:57,192 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 15:51:57,193 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-02-05 15:51:57,193 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 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-02-05 15:51:57,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 15:51:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-05 15:51:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.30622009569378) internal successors, (273), 228 states have internal predecessors, (273), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-02-05 15:51:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 367 transitions. [2025-02-05 15:51:57,224 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 367 transitions. Word has length 48 [2025-02-05 15:51:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,224 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 367 transitions. [2025-02-05 15:51:57,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 367 transitions. [2025-02-05 15:51:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 15:51:57,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,226 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-02-05 15:51:57,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:51:57,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1231570054, now seen corresponding path program 1 times [2025-02-05 15:51:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9812485] [2025-02-05 15:51:57,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 15:51:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 15:51:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:57,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9812485] [2025-02-05 15:51:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9812485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819045999] [2025-02-05 15:51:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:57,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:57,332 INFO L87 Difference]: Start difference. First operand 284 states and 367 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:57,371 INFO L93 Difference]: Finished difference Result 566 states and 747 transitions. [2025-02-05 15:51:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-02-05 15:51:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:57,375 INFO L225 Difference]: With dead ends: 566 [2025-02-05 15:51:57,375 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 15:51:57,376 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-02-05 15:51:57,378 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 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-02-05 15:51:57,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 15:51:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-05 15:51:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 234 states have internal predecessors, (279), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-02-05 15:51:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 373 transitions. [2025-02-05 15:51:57,408 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 373 transitions. Word has length 48 [2025-02-05 15:51:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,408 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 373 transitions. [2025-02-05 15:51:57,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 373 transitions. [2025-02-05 15:51:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 15:51:57,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,412 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-02-05 15:51:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:51:57,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -362517367, now seen corresponding path program 1 times [2025-02-05 15:51:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351098288] [2025-02-05 15:51:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 15:51:57,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 15:51:57,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:57,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351098288] [2025-02-05 15:51:57,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351098288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352692543] [2025-02-05 15:51:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:57,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:57,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:57,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:57,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:57,520 INFO L87 Difference]: Start difference. First operand 290 states and 373 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:51:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:57,661 INFO L93 Difference]: Finished difference Result 974 states and 1297 transitions. [2025-02-05 15:51:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2025-02-05 15:51:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:57,668 INFO L225 Difference]: With dead ends: 974 [2025-02-05 15:51:57,669 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 15:51:57,670 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-02-05 15:51:57,672 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:57,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 383 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 15:51:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 678. [2025-02-05 15:51:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 501 states have (on average 1.2714570858283434) internal successors, (637), 539 states have internal predecessors, (637), 93 states have call successors, (93), 81 states have call predecessors, (93), 83 states have return successors, (150), 85 states have call predecessors, (150), 93 states have call successors, (150) [2025-02-05 15:51:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 880 transitions. [2025-02-05 15:51:57,751 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 880 transitions. Word has length 48 [2025-02-05 15:51:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,751 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 880 transitions. [2025-02-05 15:51:57,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:51:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 880 transitions. [2025-02-05 15:51:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 15:51:57,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,753 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, 1, 1, 1, 1] [2025-02-05 15:51:57,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:51:57,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 838500331, now seen corresponding path program 1 times [2025-02-05 15:51:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877008128] [2025-02-05 15:51:57,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 15:51:57,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 15:51:57,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877008128] [2025-02-05 15:51:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877008128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:57,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306152860] [2025-02-05 15:51:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:57,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:57,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:57,815 INFO L87 Difference]: Start difference. First operand 678 states and 880 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:51:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:57,915 INFO L93 Difference]: Finished difference Result 1098 states and 1466 transitions. [2025-02-05 15:51:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-02-05 15:51:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:57,926 INFO L225 Difference]: With dead ends: 1098 [2025-02-05 15:51:57,926 INFO L226 Difference]: Without dead ends: 1096 [2025-02-05 15:51:57,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 15:51:57,927 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:57,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-02-05 15:51:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1038. [2025-02-05 15:51:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 761 states have (on average 1.2759526938239159) internal successors, (971), 825 states have internal predecessors, (971), 149 states have call successors, (149), 125 states have call predecessors, (149), 127 states have return successors, (277), 127 states have call predecessors, (277), 149 states have call successors, (277) [2025-02-05 15:51:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1397 transitions. [2025-02-05 15:51:58,040 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1397 transitions. Word has length 52 [2025-02-05 15:51:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:58,040 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1397 transitions. [2025-02-05 15:51:58,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:51:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1397 transitions. [2025-02-05 15:51:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:51:58,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:58,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:51:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:51:58,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1844312393, now seen corresponding path program 1 times [2025-02-05 15:51:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374339120] [2025-02-05 15:51:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:58,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:51:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:51:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:58,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:51:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374339120] [2025-02-05 15:51:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374339120] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889583528] [2025-02-05 15:51:58,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:58,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:58,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:58,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:58,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:51:58,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:51:58,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:51:58,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:58,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:51:58,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:51:58,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889583528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:58,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-05 15:51:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235060934] [2025-02-05 15:51:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:58,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:58,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:58,387 INFO L87 Difference]: Start difference. First operand 1038 states and 1397 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:51:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:58,502 INFO L93 Difference]: Finished difference Result 2277 states and 3177 transitions. [2025-02-05 15:51:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-02-05 15:51:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:58,516 INFO L225 Difference]: With dead ends: 2277 [2025-02-05 15:51:58,516 INFO L226 Difference]: Without dead ends: 1379 [2025-02-05 15:51:58,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 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-02-05 15:51:58,522 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 80 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:58,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 316 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-02-05 15:51:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1174. [2025-02-05 15:51:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 864 states have (on average 1.275462962962963) internal successors, (1102), 927 states have internal predecessors, (1102), 163 states have call successors, (163), 139 states have call predecessors, (163), 146 states have return successors, (248), 144 states have call predecessors, (248), 163 states have call successors, (248) [2025-02-05 15:51:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1513 transitions. [2025-02-05 15:51:58,629 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1513 transitions. Word has length 103 [2025-02-05 15:51:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:58,630 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1513 transitions. [2025-02-05 15:51:58,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:51:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1513 transitions. [2025-02-05 15:51:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:51:58,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:58,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:51:58,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:51:58,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:58,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:58,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 989074904, now seen corresponding path program 1 times [2025-02-05 15:51:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:58,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092827832] [2025-02-05 15:51:58,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:58,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:51:58,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:51:58,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:51:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092827832] [2025-02-05 15:51:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092827832] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078855856] [2025-02-05 15:51:59,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:59,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:59,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:51:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:51:59,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:51:59,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:59,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:59,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:51:59,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:51:59,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:51:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:51:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078855856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:51:59,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:51:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 16 [2025-02-05 15:51:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144766997] [2025-02-05 15:51:59,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:51:59,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:51:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:59,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:51:59,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:51:59,741 INFO L87 Difference]: Start difference. First operand 1174 states and 1513 transitions. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 15 states have internal predecessors, (154), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2025-02-05 15:52:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:01,006 INFO L93 Difference]: Finished difference Result 2549 states and 3462 transitions. [2025-02-05 15:52:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 15:52:01,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 15 states have internal predecessors, (154), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 103 [2025-02-05 15:52:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:01,019 INFO L225 Difference]: With dead ends: 2549 [2025-02-05 15:52:01,019 INFO L226 Difference]: Without dead ends: 1509 [2025-02-05 15:52:01,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 210 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 15:52:01,025 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 906 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:01,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 781 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:52:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-05 15:52:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1320. [2025-02-05 15:52:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 967 states have (on average 1.2275077559462255) internal successors, (1187), 1031 states have internal predecessors, (1187), 185 states have call successors, (185), 161 states have call predecessors, (185), 167 states have return successors, (275), 168 states have call predecessors, (275), 185 states have call successors, (275) [2025-02-05 15:52:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1647 transitions. [2025-02-05 15:52:01,163 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1647 transitions. Word has length 103 [2025-02-05 15:52:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:01,164 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1647 transitions. [2025-02-05 15:52:01,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 15 states have internal predecessors, (154), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2025-02-05 15:52:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1647 transitions. [2025-02-05 15:52:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:52:01,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:01,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-02-05 15:52:01,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:52:01,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:01,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:01,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -414520974, now seen corresponding path program 1 times [2025-02-05 15:52:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:01,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439868225] [2025-02-05 15:52:01,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:01,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:52:01,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:52:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:52:01,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439868225] [2025-02-05 15:52:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439868225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511019968] [2025-02-05 15:52:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:01,424 INFO L87 Difference]: Start difference. First operand 1320 states and 1647 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:52:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:01,471 INFO L93 Difference]: Finished difference Result 1495 states and 1875 transitions. [2025-02-05 15:52:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-02-05 15:52:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:01,475 INFO L225 Difference]: With dead ends: 1495 [2025-02-05 15:52:01,476 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 15:52:01,478 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-02-05 15:52:01,479 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 37 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:01,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 247 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 15:52:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 523. [2025-02-05 15:52:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 383 states have (on average 1.1906005221932114) internal successors, (456), 407 states have internal predecessors, (456), 71 states have call successors, (71), 63 states have call predecessors, (71), 68 states have return successors, (104), 68 states have call predecessors, (104), 71 states have call successors, (104) [2025-02-05 15:52:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 631 transitions. [2025-02-05 15:52:01,514 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 631 transitions. Word has length 102 [2025-02-05 15:52:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 631 transitions. [2025-02-05 15:52:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:52:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 631 transitions. [2025-02-05 15:52:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:52:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:01,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:52:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:52:01,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1376609802, now seen corresponding path program 1 times [2025-02-05 15:52:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843744564] [2025-02-05 15:52:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:52:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:52:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:52:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843744564] [2025-02-05 15:52:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843744564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:52:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684297191] [2025-02-05 15:52:01,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:01,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:01,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:01,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:52:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:52:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:52:01,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:52:01,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:01,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:01,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:52:01,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:52:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:52:01,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:52:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 15:52:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684297191] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 15:52:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:52:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 11 [2025-02-05 15:52:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616167114] [2025-02-05 15:52:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:52:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:02,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:52:02,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:52:02,071 INFO L87 Difference]: Start difference. First operand 523 states and 631 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:52:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:02,227 INFO L93 Difference]: Finished difference Result 1488 states and 1837 transitions. [2025-02-05 15:52:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:52:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-02-05 15:52:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:02,233 INFO L225 Difference]: With dead ends: 1488 [2025-02-05 15:52:02,234 INFO L226 Difference]: Without dead ends: 973 [2025-02-05 15:52:02,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:52:02,236 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:02,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 471 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-05 15:52:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 875. [2025-02-05 15:52:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 635 states have (on average 1.1622047244094489) internal successors, (738), 676 states have internal predecessors, (738), 120 states have call successors, (120), 108 states have call predecessors, (120), 119 states have return successors, (179), 116 states have call predecessors, (179), 120 states have call successors, (179) [2025-02-05 15:52:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1037 transitions. [2025-02-05 15:52:02,300 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1037 transitions. Word has length 104 [2025-02-05 15:52:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1037 transitions. [2025-02-05 15:52:02,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:52:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1037 transitions. [2025-02-05 15:52:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:52:02,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:02,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:52:02,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:52:02,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:02,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:02,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:02,507 INFO L85 PathProgramCache]: Analyzing trace with hash 539578871, now seen corresponding path program 1 times [2025-02-05 15:52:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428441033] [2025-02-05 15:52:02,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:52:02,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:52:02,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:52:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428441033] [2025-02-05 15:52:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428441033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:52:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930787925] [2025-02-05 15:52:02,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:02,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:52:02,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:52:02,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:52:02,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:52:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:02,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:52:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:52:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:52:02,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:52:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930787925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:02,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:52:02,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-05 15:52:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444547518] [2025-02-05 15:52:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:02,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:52:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:02,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:52:02,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:52:02,843 INFO L87 Difference]: Start difference. First operand 875 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:52:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:02,962 INFO L93 Difference]: Finished difference Result 1536 states and 1818 transitions. [2025-02-05 15:52:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:52:02,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-02-05 15:52:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:02,965 INFO L225 Difference]: With dead ends: 1536 [2025-02-05 15:52:02,965 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:52:02,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:52:02,968 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 26 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:02,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 808 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:52:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:52:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:52:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:52:02,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2025-02-05 15:52:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:52:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:52:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:52:02,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:52:02,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:52:02,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:52:03,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:52:03,176 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:03,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:52:12,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:52:12,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:52:12 BoogieIcfgContainer [2025-02-05 15:52:12,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:52:12,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:52:12,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:52:12,105 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:52:12,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:55" (3/4) ... [2025-02-05 15:52:12,109 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:52:12,114 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-02-05 15:52:12,114 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:52:12,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2025-02-05 15:52:12,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-05 15:52:12,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:52:12,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:52:12,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:12,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:12,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:52:12,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:52:12,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:52:12,217 INFO L158 Benchmark]: Toolchain (without parser) took 17443.39ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 123.2MB in the beginning and 290.9MB in the end (delta: -167.8MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-02-05 15:52:12,217 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:12,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.14ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 103.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:12,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.00ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 101.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:12,218 INFO L158 Benchmark]: Boogie Preprocessor took 37.61ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 854.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:12,218 INFO L158 Benchmark]: IcfgBuilder took 461.92ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 80.3MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:12,219 INFO L158 Benchmark]: TraceAbstraction took 16341.27ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 79.4MB in the beginning and 299.2MB in the end (delta: -219.8MB). Peak memory consumption was 214.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:12,219 INFO L158 Benchmark]: Witness Printer took 111.81ms. Allocated memory is still 453.0MB. Free memory was 299.2MB in the beginning and 290.9MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:12,220 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.14ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 103.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.00ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 101.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.61ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 854.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 461.92ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 80.3MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16341.27ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 79.4MB in the beginning and 299.2MB in the end (delta: -219.8MB). Peak memory consumption was 214.4MB. Max. memory is 16.1GB. * Witness Printer took 111.81ms. Allocated memory is still 453.0MB. Free memory was 299.2MB in the beginning and 290.9MB in the end (delta: 8.2MB). There was no memory consumed. 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] - GenericResultAtLocation [Line: 198]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [198] - GenericResultAtLocation [Line: 268]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [268] - GenericResultAtLocation [Line: 511]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [511] - GenericResultAtLocation [Line: 877]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [877] - GenericResultAtLocation [Line: 917]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [917] - GenericResultAtLocation [Line: 1014]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1014] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1019]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1698 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1690 mSDsluCounter, 5175 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3413 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 1762 mSDtfsCounter, 1250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 643 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1320occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 590 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1247 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1435 ConstructedInterpolants, 0 QuantifiedInterpolants, 2735 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1390 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 407/439 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 212]: Location Invariant Derived location invariant: (((((((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive))) || ((1 <= methaneLevelCritical) && ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0))))) || (((((1 <= methaneLevelCritical) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((methaneLevelCritical == 0) && ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0))))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((((methAndRunningLastTime == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 929]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:52:12,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE