./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_spec5_product42.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 76f5874bdc2210da6be360b9991ed804689b1623a0180577df5607e0ad5d02da --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:02:59,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:02:59,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:02:59,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:02:59,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:02:59,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:02:59,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:02:59,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:02:59,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:02:59,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:02:59,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:02:59,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:02:59,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:02:59,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:02:59,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:59,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:59,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:59,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:02:59,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:02:59,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:02:59,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:02:59,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:02:59,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:02:59,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:02:59,755 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 -> 76f5874bdc2210da6be360b9991ed804689b1623a0180577df5607e0ad5d02da [2025-01-09 04:02:59,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:02:59,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:02:59,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:02:59,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:02:59,998 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:02:59,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product42.cil.c [2025-01-09 04:03:01,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c0c18fb/730724b9447f4bb2a9092f9eea402933/FLAG2f4bc5cda [2025-01-09 04:03:01,513 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:03:01,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product42.cil.c [2025-01-09 04:03:01,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c0c18fb/730724b9447f4bb2a9092f9eea402933/FLAG2f4bc5cda [2025-01-09 04:03:01,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c0c18fb/730724b9447f4bb2a9092f9eea402933 [2025-01-09 04:03:01,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:03:01,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:03:01,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:01,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:03:01,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:03:01,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:01" (1/1) ... [2025-01-09 04:03:01,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:01, skipping insertion in model container [2025-01-09 04:03:01,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:01" (1/1) ... [2025-01-09 04:03:01,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:03:01,936 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_spec5_product42.cil.c[3693,3706] [2025-01-09 04:03:02,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:02,021 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:03:02,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] [2025-01-09 04:03:02,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] [2025-01-09 04:03:02,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [206] [2025-01-09 04:03:02,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [215] [2025-01-09 04:03:02,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [250] [2025-01-09 04:03:02,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [616] [2025-01-09 04:03:02,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [714] [2025-01-09 04:03:02,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [782] [2025-01-09 04:03:02,040 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_spec5_product42.cil.c[3693,3706] [2025-01-09 04:03:02,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:02,109 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:03:02,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02 WrapperNode [2025-01-09 04:03:02,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:02,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:02,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:03:02,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:03:02,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,153 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 198 [2025-01-09 04:03:02,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:02,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:03:02,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:03:02,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:03:02,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,181 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-01-09 04:03:02,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:03:02,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:03:02,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:03:02,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:03:02,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (1/1) ... [2025-01-09 04:03:02,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:02,222 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-01-09 04:03:02,231 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-01-09 04:03:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:03:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:03:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:03:02,313 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:03:02,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:03:02,519 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-01-09 04:03:02,519 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:03:02,529 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:03:02,531 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:03:02,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:02 BoogieIcfgContainer [2025-01-09 04:03:02,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:03:02,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:03:02,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:03:02,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:03:02,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:01" (1/3) ... [2025-01-09 04:03:02,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b4ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:02, skipping insertion in model container [2025-01-09 04:03:02,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:02" (2/3) ... [2025-01-09 04:03:02,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b4ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:02, skipping insertion in model container [2025-01-09 04:03:02,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:02" (3/3) ... [2025-01-09 04:03:02,540 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product42.cil.c [2025-01-09 04:03:02,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:03:02,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product42.cil.c that has 7 procedures, 83 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:03:02,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:03:02,603 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;@3026a3bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:03:02,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:03:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 65 states have (on average 1.353846153846154) internal successors, (88), 71 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 04:03:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:03:02,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:02,612 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:02,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 225364603, now seen corresponding path program 1 times [2025-01-09 04:03:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901266751] [2025-01-09 04:03:02,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:02,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:03:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:03:02,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:02,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901266751] [2025-01-09 04:03:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901266751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191980674] [2025-01-09 04:03:02,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:02,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:02,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:02,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:02,898 INFO L87 Difference]: Start difference. First operand has 83 states, 65 states have (on average 1.353846153846154) internal successors, (88), 71 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:02,927 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2025-01-09 04:03:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:02,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:03:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:02,935 INFO L225 Difference]: With dead ends: 145 [2025-01-09 04:03:02,935 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 04:03:02,938 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-01-09 04:03:02,940 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 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-01-09 04:03:02,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 04:03:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 04:03:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.320754716981132) internal successors, (70), 58 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:03:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-01-09 04:03:02,984 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 32 [2025-01-09 04:03:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-01-09 04:03:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-01-09 04:03:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:03:02,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:02,988 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:03:02,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2071097913, now seen corresponding path program 1 times [2025-01-09 04:03:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181371540] [2025-01-09 04:03:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:03:03,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:03:03,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:03,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181371540] [2025-01-09 04:03:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181371540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393345377] [2025-01-09 04:03:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:03,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:03,089 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,101 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2025-01-09 04:03:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-01-09 04:03:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,102 INFO L225 Difference]: With dead ends: 124 [2025-01-09 04:03:03,102 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 04:03:03,103 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-01-09 04:03:03,103 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:03,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 82 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 04:03:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 04:03:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 58 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:03:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-01-09 04:03:03,118 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 37 [2025-01-09 04:03:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,118 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-01-09 04:03:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-01-09 04:03:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:03:03,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,119 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:03:03,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash -542209964, now seen corresponding path program 1 times [2025-01-09 04:03:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494384177] [2025-01-09 04:03:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:03:03,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:03:03,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494384177] [2025-01-09 04:03:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494384177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86460493] [2025-01-09 04:03:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:03,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:03,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:03,260 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,285 INFO L93 Difference]: Finished difference Result 168 states and 216 transitions. [2025-01-09 04:03:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-01-09 04:03:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,286 INFO L225 Difference]: With dead ends: 168 [2025-01-09 04:03:03,290 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 04:03:03,290 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-01-09 04:03:03,291 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 52 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:03,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 04:03:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-01-09 04:03:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 92 states have internal predecessors, (110), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-09 04:03:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2025-01-09 04:03:03,311 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 42 [2025-01-09 04:03:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,312 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2025-01-09 04:03:03,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2025-01-09 04:03:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:03:03,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,313 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:03:03,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash 795824060, now seen corresponding path program 1 times [2025-01-09 04:03:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453194503] [2025-01-09 04:03:03,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:03:03,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:03:03,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:03:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453194503] [2025-01-09 04:03:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453194503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-01-09 04:03:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:03,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:03,455 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:03:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,558 INFO L93 Difference]: Finished difference Result 207 states and 264 transitions. [2025-01-09 04:03:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:03:03,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-09 04:03:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,561 INFO L225 Difference]: With dead ends: 207 [2025-01-09 04:03:03,561 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 04:03:03,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:03:03,563 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 349 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 04:03:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 04:03:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 91 states have internal predecessors, (107), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-09 04:03:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2025-01-09 04:03:03,573 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 48 [2025-01-09 04:03:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2025-01-09 04:03:03,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:03:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2025-01-09 04:03:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:03:03,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,574 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:03:03,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash -718465986, now seen corresponding path program 1 times [2025-01-09 04:03:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-01-09 04:03:03,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:03:03,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:03:03,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:03,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-01-09 04:03:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959469814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:03,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267856634] [2025-01-09 04:03:03,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:03,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:03,688 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,721 INFO L93 Difference]: Finished difference Result 209 states and 266 transitions. [2025-01-09 04:03:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-01-09 04:03:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,725 INFO L225 Difference]: With dead ends: 209 [2025-01-09 04:03:03,725 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 04:03:03,725 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-01-09 04:03:03,726 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:03,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 04:03:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 04:03:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.264367816091954) internal successors, (110), 94 states have internal predecessors, (110), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-09 04:03:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2025-01-09 04:03:03,743 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 50 [2025-01-09 04:03:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-01-09 04:03:03,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2025-01-09 04:03:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:03:03,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,744 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:03:03,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash -295764160, now seen corresponding path program 1 times [2025-01-09 04:03:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282439129] [2025-01-09 04:03:03,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:03:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:03:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282439129] [2025-01-09 04:03:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282439129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:03:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152628492] [2025-01-09 04:03:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:03:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:03:03,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:03:03,817 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,842 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2025-01-09 04:03:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:03:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-01-09 04:03:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,848 INFO L225 Difference]: With dead ends: 214 [2025-01-09 04:03:03,848 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 04:03:03,848 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-01-09 04:03:03,849 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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-01-09 04:03:03,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 04:03:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 04:03:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 96 states have internal predecessors, (112), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-09 04:03:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-01-09 04:03:03,856 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 50 [2025-01-09 04:03:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,857 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-01-09 04:03:03,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-01-09 04:03:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:03:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,858 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:03:03,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2101202494, now seen corresponding path program 1 times [2025-01-09 04:03:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-01-09 04:03:03,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:03:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:03:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-01-09 04:03:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446556976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-01-09 04:03:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:03,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:03,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:03,913 INFO L87 Difference]: Start difference. First operand 112 states and 138 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:03,932 INFO L93 Difference]: Finished difference Result 261 states and 326 transitions. [2025-01-09 04:03:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:03,932 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-01-09 04:03:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:03,933 INFO L225 Difference]: With dead ends: 261 [2025-01-09 04:03:03,933 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 04:03:03,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-09 04:03:03,934 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 35 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:03,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 151 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 04:03:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 04:03:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 132 states have internal predecessors, (153), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) [2025-01-09 04:03:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2025-01-09 04:03:03,944 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 50 [2025-01-09 04:03:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:03,944 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2025-01-09 04:03:03,944 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2025-01-09 04:03:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:03:03,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:03,945 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:03:03,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:03:03,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:03,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2006962792, now seen corresponding path program 1 times [2025-01-09 04:03:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734924782] [2025-01-09 04:03:03,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:03:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:03:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734924782] [2025-01-09 04:03:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734924782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:03:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520980835] [2025-01-09 04:03:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:04,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:03:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:04,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:03:04,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:03:04,139 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:03:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:04,425 INFO L93 Difference]: Finished difference Result 524 states and 663 transitions. [2025-01-09 04:03:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 3 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 54 [2025-01-09 04:03:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:04,429 INFO L225 Difference]: With dead ends: 524 [2025-01-09 04:03:04,429 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 04:03:04,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:03:04,434 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 254 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:04,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 546 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 04:03:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 393. [2025-01-09 04:03:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 334 states have internal predecessors, (381), 44 states have call successors, (44), 33 states have call predecessors, (44), 36 states have return successors, (54), 42 states have call predecessors, (54), 44 states have call successors, (54) [2025-01-09 04:03:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 479 transitions. [2025-01-09 04:03:04,478 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 479 transitions. Word has length 54 [2025-01-09 04:03:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 479 transitions. [2025-01-09 04:03:04,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:03:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 479 transitions. [2025-01-09 04:03:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:03:04,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:04,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:03:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:03:04,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 771201978, now seen corresponding path program 1 times [2025-01-09 04:03:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-01-09 04:03:04,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:03:04,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:03:04,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:04,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-01-09 04:03:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867087677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117633284] [2025-01-09 04:03:04,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:04,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:04,760 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-01-09 04:03:04,762 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-01-09 04:03:04,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:03:04,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:03:04,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:04,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:03:04,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:03:05,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:05,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117633284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:05,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:05,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-01-09 04:03:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141278135] [2025-01-09 04:03:05,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:05,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:03:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:05,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:03:05,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:03:05,602 INFO L87 Difference]: Start difference. First operand 393 states and 479 transitions. Second operand has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 12 states have internal predecessors, (135), 6 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 04:03:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:05,953 INFO L93 Difference]: Finished difference Result 624 states and 786 transitions. [2025-01-09 04:03:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 12 states have internal predecessors, (135), 6 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 85 [2025-01-09 04:03:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:05,954 INFO L225 Difference]: With dead ends: 624 [2025-01-09 04:03:05,954 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:03:05,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:03:05,956 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 238 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:05,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 954 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:03:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:03:05,957 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-01-09 04:03:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:03:05,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-01-09 04:03:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:03:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 12 states have internal predecessors, (135), 6 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 04:03:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:03:05,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:03:05,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:03:05,971 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-01-09 04:03:06,161 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-01-09 04:03:06,163 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:06,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:03:07,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:03:07,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:07 BoogieIcfgContainer [2025-01-09 04:03:07,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:03:07,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:03:07,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:03:07,829 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:03:07,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:02" (3/4) ... [2025-01-09 04:03:07,835 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:03:07,844 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-01-09 04:03:07,852 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 04:03:07,852 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:03:07,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:03:07,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:07,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:08,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:03:08,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:03:08,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:03:08,012 INFO L158 Benchmark]: Toolchain (without parser) took 6229.74ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 109.1MB in the beginning and 137.0MB in the end (delta: -27.9MB). Peak memory consumption was 210.7MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.67ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.01ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: Boogie Preprocessor took 37.87ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: RCFGBuilder took 337.13ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 69.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,012 INFO L158 Benchmark]: TraceAbstraction took 5294.98ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 68.7MB in the beginning and 145.4MB in the end (delta: -76.6MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,013 INFO L158 Benchmark]: Witness Printer took 182.13ms. Allocated memory is still 377.5MB. Free memory was 145.4MB in the beginning and 137.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:08,013 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.14ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.67ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.01ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.87ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.13ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 69.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5294.98ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 68.7MB in the beginning and 145.4MB in the end (delta: -76.6MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Witness Printer took 182.13ms. Allocated memory is still 377.5MB. Free memory was 145.4MB in the beginning and 137.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] - GenericResultAtLocation [Line: 101]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] - GenericResultAtLocation [Line: 206]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [206] - GenericResultAtLocation [Line: 215]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [215] - GenericResultAtLocation [Line: 250]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [250] - GenericResultAtLocation [Line: 616]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [616] - GenericResultAtLocation [Line: 714]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [714] - GenericResultAtLocation [Line: 782]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [782] * 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: 211]: 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 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 2932 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2078 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 499 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 854 mSDtfsCounter, 499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325 SizeOfPredicates, 2 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 82/111 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: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((1 == systemActive) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:03:08,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE