./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product35.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_product35.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 45ba8c3ee5105630bc9146965d68439e6204903aca4c5a31cd4f017e456c8589 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:02:56,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:02:56,534 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:56,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:02:56,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:02:56,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:02:56,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:02:56,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:02:56,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:02:56,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:02:56,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:02:56,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:02:56,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:02:56,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:02:56,555 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:02:56,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:02:56,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:02:56,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:02:56,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:02:56,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:56,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:56,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:02:56,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:02:56,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:02:56,558 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 -> 45ba8c3ee5105630bc9146965d68439e6204903aca4c5a31cd4f017e456c8589 [2025-01-09 04:02:56,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:02:56,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:02:56,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:02:56,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:02:56,782 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:02:56,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product35.cil.c [2025-01-09 04:02:58,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4038988d4/c0a6e2085d1243b595fb8c8b20050c56/FLAG1584652e2 [2025-01-09 04:02:58,327 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:02:58,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product35.cil.c [2025-01-09 04:02:58,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4038988d4/c0a6e2085d1243b595fb8c8b20050c56/FLAG1584652e2 [2025-01-09 04:02:58,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4038988d4/c0a6e2085d1243b595fb8c8b20050c56 [2025-01-09 04:02:58,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:02:58,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:02:58,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:58,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:02:58,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:02:58,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a736df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58, skipping insertion in model container [2025-01-09 04:02:58,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:02:58,745 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_product35.cil.c[1605,1618] [2025-01-09 04:02:58,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:58,872 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:02:58,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-01-09 04:02:58,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] [2025-01-09 04:02:58,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [164] [2025-01-09 04:02:58,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [530] [2025-01-09 04:02:58,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [565] [2025-01-09 04:02:58,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [633] [2025-01-09 04:02:58,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [732] [2025-01-09 04:02:58,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [907] [2025-01-09 04:02:58,884 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_product35.cil.c[1605,1618] [2025-01-09 04:02:58,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:58,943 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:02:58,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58 WrapperNode [2025-01-09 04:02:58,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:58,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:58,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:02:58,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:02:58,949 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:02:58" (1/1) ... [2025-01-09 04:02:58,957 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:02:58" (1/1) ... [2025-01-09 04:02:58,970 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 24, calls inlined = 20, statements flattened = 179 [2025-01-09 04:02:58,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:58,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:02:58,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:02:58,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:02:58,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,989 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:02:58,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:58,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:02:58,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:02:58,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:02:59,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:02:59,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (1/1) ... [2025-01-09 04:02:59,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:59,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:59,044 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:02:59,047 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:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:02:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:02:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:02:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:02:59,118 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:02:59,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:02:59,300 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 04:02:59,300 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:02:59,307 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:02:59,307 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:02:59,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:59 BoogieIcfgContainer [2025-01-09 04:02:59,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:02:59,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:02:59,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:02:59,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:02:59,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:02:58" (1/3) ... [2025-01-09 04:02:59,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188346f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:59, skipping insertion in model container [2025-01-09 04:02:59,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:58" (2/3) ... [2025-01-09 04:02:59,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188346f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:59, skipping insertion in model container [2025-01-09 04:02:59,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:59" (3/3) ... [2025-01-09 04:02:59,315 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product35.cil.c [2025-01-09 04:02:59,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:02:59,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product35.cil.c that has 7 procedures, 82 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:02:59,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:02:59,373 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;@1c879145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:02:59,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:02:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 64 states have (on average 1.359375) internal successors, (87), 70 states have internal predecessors, (87), 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:02:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:02:59,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:59,383 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:02:59,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:59,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1054107710, now seen corresponding path program 1 times [2025-01-09 04:02:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:59,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234600467] [2025-01-09 04:02:59,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:59,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:02:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:02:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:59,502 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:02:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234600467] [2025-01-09 04:02:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234600467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:02:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413526862] [2025-01-09 04:02:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:59,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:02:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:59,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:02:59,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:02:59,522 INFO L87 Difference]: Start difference. First operand has 82 states, 64 states have (on average 1.359375) internal successors, (87), 70 states have internal predecessors, (87), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:02:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:59,538 INFO L93 Difference]: Finished difference Result 155 states and 208 transitions. [2025-01-09 04:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:02:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:02:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:59,545 INFO L225 Difference]: With dead ends: 155 [2025-01-09 04:02:59,545 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 04:02:59,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:02:59,549 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:59,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 04:02:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 04:02:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:02:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-01-09 04:02:59,575 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 32 [2025-01-09 04:02:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:59,576 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-01-09 04:02:59,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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:02:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-01-09 04:02:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 04:02:59,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:59,578 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] [2025-01-09 04:02:59,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:02:59,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:59,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 10219048, now seen corresponding path program 1 times [2025-01-09 04:02:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893588822] [2025-01-09 04:02:59,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:59,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 04:02:59,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 04:02:59,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:59,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:59,717 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:02:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893588822] [2025-01-09 04:02:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893588822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618066056] [2025-01-09 04:02:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:59,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:59,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:59,723 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:59,758 INFO L93 Difference]: Finished difference Result 202 states and 268 transitions. [2025-01-09 04:02:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 36 [2025-01-09 04:02:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:59,760 INFO L225 Difference]: With dead ends: 202 [2025-01-09 04:02:59,760 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 04:02:59,760 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:02:59,761 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:59,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 04:02:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2025-01-09 04:02:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 110 states have internal predecessors, (135), 20 states have call successors, (20), 12 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 04:02:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2025-01-09 04:02:59,785 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 36 [2025-01-09 04:02:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:59,785 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2025-01-09 04:02:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:02:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2025-01-09 04:02:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:02:59,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:59,790 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] [2025-01-09 04:02:59,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:02:59,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:59,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash 881139289, now seen corresponding path program 1 times [2025-01-09 04:02:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427058643] [2025-01-09 04:02:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:02:59,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:02:59,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:59,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:59,856 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:02:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427058643] [2025-01-09 04:02:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427058643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646821665] [2025-01-09 04:02:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:59,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:59,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:59,858 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 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:02:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:59,895 INFO L93 Difference]: Finished difference Result 355 states and 490 transitions. [2025-01-09 04:02:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 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 41 [2025-01-09 04:02:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:59,898 INFO L225 Difference]: With dead ends: 355 [2025-01-09 04:02:59,898 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 04:02:59,899 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:02:59,900 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:59,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 173 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 04:02:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-01-09 04:02:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 36 states have call successors, (36), 24 states have call predecessors, (36), 20 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2025-01-09 04:02:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 307 transitions. [2025-01-09 04:02:59,950 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 307 transitions. Word has length 41 [2025-01-09 04:02:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 307 transitions. [2025-01-09 04:02:59,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 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:02:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 307 transitions. [2025-01-09 04:02:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:02:59,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:59,952 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] [2025-01-09 04:02:59,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:02:59,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:59,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1360382749, now seen corresponding path program 1 times [2025-01-09 04:02:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25575614] [2025-01-09 04:02:59,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:02:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:02:59,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:59,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,073 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:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25575614] [2025-01-09 04:03:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25575614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061106799] [2025-01-09 04:03:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:00,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:00,075 INFO L87 Difference]: Start difference. First operand 229 states and 307 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:00,215 INFO L93 Difference]: Finished difference Result 448 states and 614 transitions. [2025-01-09 04:03:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:03:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-01-09 04:03:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:00,218 INFO L225 Difference]: With dead ends: 448 [2025-01-09 04:03:00,219 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 04:03:00,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:03:00,221 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:00,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 433 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 04:03:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-01-09 04:03:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 170 states have (on average 1.3) internal successors, (221), 181 states have internal predecessors, (221), 36 states have call successors, (36), 24 states have call predecessors, (36), 20 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2025-01-09 04:03:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 301 transitions. [2025-01-09 04:03:00,244 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 301 transitions. Word has length 40 [2025-01-09 04:03:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:00,244 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 301 transitions. [2025-01-09 04:03:00,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 301 transitions. [2025-01-09 04:03:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:03:00,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:00,246 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] [2025-01-09 04:03:00,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:03:00,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1110228203, now seen corresponding path program 1 times [2025-01-09 04:03:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320502958] [2025-01-09 04:03:00,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:00,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:03:00,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:03:00,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,315 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:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320502958] [2025-01-09 04:03:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320502958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669311974] [2025-01-09 04:03:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:00,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:00,316 INFO L87 Difference]: Start difference. First operand 227 states and 301 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:00,345 INFO L93 Difference]: Finished difference Result 452 states and 614 transitions. [2025-01-09 04:03:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 45 [2025-01-09 04:03:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:00,347 INFO L225 Difference]: With dead ends: 452 [2025-01-09 04:03:00,348 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 04:03:00,349 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:00,349 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 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:00,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 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:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 04:03:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-01-09 04:03:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.2897727272727273) internal successors, (227), 187 states have internal predecessors, (227), 36 states have call successors, (36), 24 states have call predecessors, (36), 20 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2025-01-09 04:03:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2025-01-09 04:03:00,379 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 45 [2025-01-09 04:03:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:00,379 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2025-01-09 04:03:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2025-01-09 04:03:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:03:00,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:00,380 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] [2025-01-09 04:03:00,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:03:00,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash 471264914, now seen corresponding path program 1 times [2025-01-09 04:03:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:00,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480738171] [2025-01-09 04:03:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:00,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:03:00,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:03:00,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:00,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,446 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:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480738171] [2025-01-09 04:03:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480738171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558110359] [2025-01-09 04:03:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:00,451 INFO L87 Difference]: Start difference. First operand 233 states and 307 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:00,469 INFO L93 Difference]: Finished difference Result 353 states and 448 transitions. [2025-01-09 04:03:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:00,469 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), 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 41 [2025-01-09 04:03:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:00,470 INFO L225 Difference]: With dead ends: 353 [2025-01-09 04:03:00,470 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 04:03:00,471 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:00,472 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 144 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:00,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 144 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:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 04:03:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 04:03:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 167 states have internal predecessors, (203), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-09 04:03:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2025-01-09 04:03:00,481 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 41 [2025-01-09 04:03:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:00,481 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2025-01-09 04:03:00,482 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), 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:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2025-01-09 04:03:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:03:00,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:00,483 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] [2025-01-09 04:03:00,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:03:00,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1596391191, now seen corresponding path program 1 times [2025-01-09 04:03:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173854693] [2025-01-09 04:03:00,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:00,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:03:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:03:00,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:00,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,530 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:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173854693] [2025-01-09 04:03:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173854693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:03:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60243737] [2025-01-09 04:03:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:03:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:03:00,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:03:00,536 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:00,567 INFO L93 Difference]: Finished difference Result 398 states and 516 transitions. [2025-01-09 04:03:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:03:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 45 [2025-01-09 04:03:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:00,594 INFO L225 Difference]: With dead ends: 398 [2025-01-09 04:03:00,595 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 04:03:00,595 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:00,596 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:00,596 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:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 04:03:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-01-09 04:03:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.29375) internal successors, (207), 171 states have internal predecessors, (207), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-09 04:03:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2025-01-09 04:03:00,617 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 45 [2025-01-09 04:03:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:00,622 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2025-01-09 04:03:00,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2025-01-09 04:03:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:03:00,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:00,623 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] [2025-01-09 04:03:00,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:03:00,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -92552551, now seen corresponding path program 1 times [2025-01-09 04:03:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792547699] [2025-01-09 04:03:00,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:00,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:03:00,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:03:00,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,722 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:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792547699] [2025-01-09 04:03:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792547699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273485693] [2025-01-09 04:03:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:00,728 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:00,769 INFO L93 Difference]: Finished difference Result 493 states and 628 transitions. [2025-01-09 04:03:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 45 [2025-01-09 04:03:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:00,772 INFO L225 Difference]: With dead ends: 493 [2025-01-09 04:03:00,775 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 04:03:00,776 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:00,777 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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:00,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 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:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 04:03:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 04:03:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 30 states have call predecessors, (36), 28 states have return successors, (40), 34 states have call predecessors, (40), 36 states have call successors, (40) [2025-01-09 04:03:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 367 transitions. [2025-01-09 04:03:00,805 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 367 transitions. Word has length 45 [2025-01-09 04:03:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 367 transitions. [2025-01-09 04:03:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 367 transitions. [2025-01-09 04:03:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 04:03:00,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:00,807 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] [2025-01-09 04:03:00,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:03:00,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1027096435, now seen corresponding path program 1 times [2025-01-09 04:03:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122135366] [2025-01-09 04:03:00,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 04:03:00,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 04:03:00,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:00,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:00,930 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:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122135366] [2025-01-09 04:03:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122135366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:03:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406956910] [2025-01-09 04:03:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:03:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:00,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:03:00,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:03:00,931 INFO L87 Difference]: Start difference. First operand 296 states and 367 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:01,197 INFO L93 Difference]: Finished difference Result 997 states and 1284 transitions. [2025-01-09 04:03:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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 49 [2025-01-09 04:03:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:01,201 INFO L225 Difference]: With dead ends: 997 [2025-01-09 04:03:01,202 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 04:03:01,204 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:01,204 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 301 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:01,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 535 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 04:03:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 750. [2025-01-09 04:03:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 589 states have (on average 1.2410865874363328) internal successors, (731), 626 states have internal predecessors, (731), 88 states have call successors, (88), 66 states have call predecessors, (88), 72 states have return successors, (108), 84 states have call predecessors, (108), 88 states have call successors, (108) [2025-01-09 04:03:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 927 transitions. [2025-01-09 04:03:01,260 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 927 transitions. Word has length 49 [2025-01-09 04:03:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:01,260 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 927 transitions. [2025-01-09 04:03:01,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 927 transitions. [2025-01-09 04:03:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:03:01,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:01,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:03:01,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:03:01,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1749639733, now seen corresponding path program 1 times [2025-01-09 04:03:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123128050] [2025-01-09 04:03:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:03:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:03:01,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:01,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123128050] [2025-01-09 04:03:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123128050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124503064] [2025-01-09 04:03:01,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:01,393 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:01,395 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:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:03:01,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:03:01,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:01,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:01,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:03:01,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:03:01,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:03:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124503064] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:01,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-01-09 04:03:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236098695] [2025-01-09 04:03:01,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:01,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:03:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:01,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:03:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:03:01,712 INFO L87 Difference]: Start difference. First operand 750 states and 927 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 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:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:02,303 INFO L93 Difference]: Finished difference Result 1590 states and 2041 transitions. [2025-01-09 04:03:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 04:03:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 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 79 [2025-01-09 04:03:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:02,309 INFO L225 Difference]: With dead ends: 1590 [2025-01-09 04:03:02,310 INFO L226 Difference]: Without dead ends: 890 [2025-01-09 04:03:02,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:03:02,313 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 478 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:02,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1312 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:03:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-01-09 04:03:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 785. [2025-01-09 04:03:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 600 states have (on average 1.2183333333333333) internal successors, (731), 641 states have internal predecessors, (731), 100 states have call successors, (100), 84 states have call predecessors, (100), 84 states have return successors, (119), 89 states have call predecessors, (119), 100 states have call successors, (119) [2025-01-09 04:03:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 950 transitions. [2025-01-09 04:03:02,358 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 950 transitions. Word has length 79 [2025-01-09 04:03:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 950 transitions. [2025-01-09 04:03:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 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:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 950 transitions. [2025-01-09 04:03:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:03:02,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:02,361 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:03:02,372 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:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 04:03:02,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 701452708, now seen corresponding path program 1 times [2025-01-09 04:03:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351085907] [2025-01-09 04:03:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:02,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:03:02,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:03:02,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:02,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 04:03:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351085907] [2025-01-09 04:03:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351085907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784829537] [2025-01-09 04:03:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:02,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:02,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:02,661 INFO L87 Difference]: Start difference. First operand 785 states and 950 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:03:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:02,691 INFO L93 Difference]: Finished difference Result 956 states and 1165 transitions. [2025-01-09 04:03:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 146 [2025-01-09 04:03:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:02,693 INFO L225 Difference]: With dead ends: 956 [2025-01-09 04:03:02,693 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:03:02,694 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,694 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:02,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:03:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:03:02,695 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:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:03:02,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2025-01-09 04:03:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:02,696 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:03:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:03:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:03:02,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:03:02,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:03:02,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:03:02,699 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:02,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:03:04,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:03:04,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:04 BoogieIcfgContainer [2025-01-09 04:03:04,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:03:04,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:03:04,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:03:04,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:03:04,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:59" (3/4) ... [2025-01-09 04:03:04,897 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:03:04,903 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:03:04,906 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:03:04,906 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:03:04,906 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:03:04,907 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:03:04,907 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-01-09 04:03:04,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 04:03:04,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:03:04,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:03:04,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:04,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:05,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:03:05,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:03:05,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:03:05,046 INFO L158 Benchmark]: Toolchain (without parser) took 6444.40ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 129.4MB in the beginning and 169.8MB in the end (delta: -40.4MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.96ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 110.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.49ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: RCFGBuilder took 308.58ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 91.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,047 INFO L158 Benchmark]: TraceAbstraction took 5581.99ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 90.6MB in the beginning and 60.5MB in the end (delta: 30.1MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,048 INFO L158 Benchmark]: Witness Printer took 154.17ms. Allocated memory is still 209.7MB. Free memory was 60.5MB in the beginning and 169.8MB in the end (delta: -109.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:05,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.96ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 110.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.49ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 308.58ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 91.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5581.99ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 90.6MB in the beginning and 60.5MB in the end (delta: 30.1MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 154.17ms. Allocated memory is still 209.7MB. Free memory was 60.5MB in the beginning and 169.8MB in the end (delta: -109.2MB). 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] - GenericResultAtLocation [Line: 164]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [164] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [530] - GenericResultAtLocation [Line: 565]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [565] - GenericResultAtLocation [Line: 633]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [633] - GenericResultAtLocation [Line: 732]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [732] - GenericResultAtLocation [Line: 907]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [907] * 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: 54]: 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, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1120 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1100 mSDsluCounter, 3813 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2660 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 1153 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=10, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 162 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 SizeOfPredicates, 2 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 248/276 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: 625]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 577]: 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))) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (0 == systemActive))) || ((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:03:05,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE