./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product56.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_product56.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 7bcd24ea8f621c8db79e853f5aaf064ffcae573e6c1e9f03eb1f84bb0c15fc3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:03:24,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:03:24,397 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:03:24,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:03:24,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:03:24,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:03:24,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:03:24,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:03:24,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:03:24,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:03:24,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:03:24,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:03:24,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:03:24,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:03:24,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:24,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:24,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:24,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:03:24,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:03:24,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:03:24,420 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 -> 7bcd24ea8f621c8db79e853f5aaf064ffcae573e6c1e9f03eb1f84bb0c15fc3c [2025-01-09 04:03:24,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:03:24,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:03:24,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:03:24,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:03:24,625 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:03:24,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product56.cil.c [2025-01-09 04:03:25,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdc9aaddb/8fe08c9aaea146eeb34011d5a1207fe6/FLAG2b7b1686b [2025-01-09 04:03:26,238 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:03:26,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product56.cil.c [2025-01-09 04:03:26,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdc9aaddb/8fe08c9aaea146eeb34011d5a1207fe6/FLAG2b7b1686b [2025-01-09 04:03:26,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdc9aaddb/8fe08c9aaea146eeb34011d5a1207fe6 [2025-01-09 04:03:26,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:03:26,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:03:26,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:26,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:03:26,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:03:26,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb4b1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26, skipping insertion in model container [2025-01-09 04:03:26,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:03:26,714 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_product56.cil.c[8146,8159] [2025-01-09 04:03:26,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:26,763 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:03:26,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [418] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [488] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [526] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [535] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [584] [2025-01-09 04:03:26,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [950] [2025-01-09 04:03:26,786 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_product56.cil.c[8146,8159] [2025-01-09 04:03:26,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:26,831 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:03:26,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26 WrapperNode [2025-01-09 04:03:26,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:26,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:26,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:03:26,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:03:26,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,875 INFO L138 Inliner]: procedures = 60, calls = 108, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 238 [2025-01-09 04:03:26,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:26,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:03:26,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:03:26,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:03:26,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:03:26,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:03:26,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:03:26,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:03:26,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:03:26,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (1/1) ... [2025-01-09 04:03:26,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:26,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:03:26,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:03:26,975 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:03:26,975 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:03:26,975 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:26,975 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:03:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:03:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:03:27,021 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:03:27,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:03:27,241 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 04:03:27,241 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:03:27,250 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:03:27,252 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:03:27,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:27 BoogieIcfgContainer [2025-01-09 04:03:27,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:03:27,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:03:27,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:03:27,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:03:27,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:26" (1/3) ... [2025-01-09 04:03:27,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350f7c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:27, skipping insertion in model container [2025-01-09 04:03:27,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:26" (2/3) ... [2025-01-09 04:03:27,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350f7c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:27, skipping insertion in model container [2025-01-09 04:03:27,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:27" (3/3) ... [2025-01-09 04:03:27,261 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product56.cil.c [2025-01-09 04:03:27,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:03:27,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product56.cil.c that has 10 procedures, 108 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:03:27,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:03:27,318 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;@19400f79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:03:27,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:03:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 80 states have (on average 1.35) internal successors, (108), 91 states have internal predecessors, (108), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 04:03:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:03:27,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:27,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:27,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1063604556, now seen corresponding path program 1 times [2025-01-09 04:03:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618486307] [2025-01-09 04:03:27,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:27,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:03:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:03:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:27,540 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:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618486307] [2025-01-09 04:03:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618486307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:27,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173995698] [2025-01-09 04:03:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:27,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:27,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:27,558 INFO L87 Difference]: Start difference. First operand has 108 states, 80 states have (on average 1.35) internal successors, (108), 91 states have internal predecessors, (108), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:27,580 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2025-01-09 04:03:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:03:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:27,586 INFO L225 Difference]: With dead ends: 195 [2025-01-09 04:03:27,586 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 04:03:27,589 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:27,590 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 221 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:27,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 221 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:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 04:03:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 04:03:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 78 states have internal predecessors, (90), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:03:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2025-01-09 04:03:27,618 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 32 [2025-01-09 04:03:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:27,618 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-01-09 04:03:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2025-01-09 04:03:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:03:27,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:27,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:27,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:03:27,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 898219549, now seen corresponding path program 1 times [2025-01-09 04:03:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916119017] [2025-01-09 04:03:27,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:03:27,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:03:27,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:27,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:27,813 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:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916119017] [2025-01-09 04:03:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916119017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487141003] [2025-01-09 04:03:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:27,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:27,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:27,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:27,816 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:27,868 INFO L93 Difference]: Finished difference Result 220 states and 289 transitions. [2025-01-09 04:03:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-01-09 04:03:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:27,870 INFO L225 Difference]: With dead ends: 220 [2025-01-09 04:03:27,870 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 04:03:27,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:03:27,871 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 107 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:27,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 444 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:27,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 04:03:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-01-09 04:03:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.34) internal successors, (134), 113 states have internal predecessors, (134), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (21), 14 states have call predecessors, (21), 20 states have call successors, (21) [2025-01-09 04:03:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 175 transitions. [2025-01-09 04:03:27,891 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 175 transitions. Word has length 37 [2025-01-09 04:03:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:27,892 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 175 transitions. [2025-01-09 04:03:27,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 175 transitions. [2025-01-09 04:03:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:03:27,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:27,899 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:03:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:03:27,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1161598687, now seen corresponding path program 1 times [2025-01-09 04:03:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603876801] [2025-01-09 04:03:27,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:27,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:03:27,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:03:27,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:27,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:27,992 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:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603876801] [2025-01-09 04:03:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603876801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008268477] [2025-01-09 04:03:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:27,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:27,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:27,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:27,994 INFO L87 Difference]: Start difference. First operand 134 states and 175 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:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:28,121 INFO L93 Difference]: Finished difference Result 302 states and 407 transitions. [2025-01-09 04:03:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:03:28,121 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:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:28,123 INFO L225 Difference]: With dead ends: 302 [2025-01-09 04:03:28,125 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 04:03:28,126 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:28,126 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:28,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 511 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 04:03:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2025-01-09 04:03:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 142 states have internal predecessors, (167), 24 states have call successors, (24), 19 states have call predecessors, (24), 19 states have return successors, (32), 22 states have call predecessors, (32), 24 states have call successors, (32) [2025-01-09 04:03:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 223 transitions. [2025-01-09 04:03:28,152 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 223 transitions. Word has length 40 [2025-01-09 04:03:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:28,152 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 223 transitions. [2025-01-09 04:03:28,152 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:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2025-01-09 04:03:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:03:28,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:28,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:03:28,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:28,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1764488316, now seen corresponding path program 1 times [2025-01-09 04:03:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:28,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411901192] [2025-01-09 04:03:28,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:03:28,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:03:28,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:28,220 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:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411901192] [2025-01-09 04:03:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411901192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:28,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:28,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253892725] [2025-01-09 04:03:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:28,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:28,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:28,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:28,223 INFO L87 Difference]: Start difference. First operand 175 states and 223 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:28,242 INFO L93 Difference]: Finished difference Result 344 states and 440 transitions. [2025-01-09 04:03:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2025-01-09 04:03:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:28,246 INFO L225 Difference]: With dead ends: 344 [2025-01-09 04:03:28,246 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 04:03:28,246 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:28,247 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 37 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:28,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 265 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 04:03:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2025-01-09 04:03:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 142 states have internal predecessors, (166), 24 states have call successors, (24), 19 states have call predecessors, (24), 19 states have return successors, (30), 22 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:03:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 220 transitions. [2025-01-09 04:03:28,266 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 220 transitions. Word has length 59 [2025-01-09 04:03:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:28,266 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 220 transitions. [2025-01-09 04:03:28,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 220 transitions. [2025-01-09 04:03:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:03:28,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:28,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:28,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:03:28,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:28,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -499028090, now seen corresponding path program 1 times [2025-01-09 04:03:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985483486] [2025-01-09 04:03:28,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:28,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:03:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:03:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:28,369 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:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985483486] [2025-01-09 04:03:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985483486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250932584] [2025-01-09 04:03:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:28,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:28,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:28,371 INFO L87 Difference]: Start difference. First operand 175 states and 220 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:03:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:28,397 INFO L93 Difference]: Finished difference Result 345 states and 442 transitions. [2025-01-09 04:03:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-01-09 04:03:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:28,399 INFO L225 Difference]: With dead ends: 345 [2025-01-09 04:03:28,400 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 04:03:28,401 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:28,401 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:28,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 04:03:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-01-09 04:03:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 145 states have internal predecessors, (169), 24 states have call successors, (24), 19 states have call predecessors, (24), 19 states have return successors, (30), 22 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:03:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2025-01-09 04:03:28,418 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 56 [2025-01-09 04:03:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:28,419 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2025-01-09 04:03:28,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:03:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2025-01-09 04:03:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:03:28,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:28,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:28,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:03:28,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -76326264, now seen corresponding path program 1 times [2025-01-09 04:03:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026276196] [2025-01-09 04:03:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:28,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:03:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:03:28,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:28,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:28,524 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:28,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:28,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026276196] [2025-01-09 04:03:28,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026276196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:28,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:28,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:28,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590460421] [2025-01-09 04:03:28,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:28,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:28,527 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:03:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:28,556 INFO L93 Difference]: Finished difference Result 350 states and 453 transitions. [2025-01-09 04:03:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:03:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-01-09 04:03:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:28,558 INFO L225 Difference]: With dead ends: 350 [2025-01-09 04:03:28,560 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 04:03:28,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:28,561 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:28,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 04:03:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 04:03:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 147 states have internal predecessors, (171), 24 states have call successors, (24), 19 states have call predecessors, (24), 19 states have return successors, (30), 22 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:03:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2025-01-09 04:03:28,576 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 56 [2025-01-09 04:03:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2025-01-09 04:03:28,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:03:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2025-01-09 04:03:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:03:28,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:28,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, 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:28,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:03:28,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1881764598, now seen corresponding path program 1 times [2025-01-09 04:03:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164074024] [2025-01-09 04:03:28,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:28,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:03:28,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:03:28,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:28,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:28,649 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:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164074024] [2025-01-09 04:03:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164074024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:03:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502120173] [2025-01-09 04:03:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:28,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:03:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:03:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:03:28,650 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:28,762 INFO L93 Difference]: Finished difference Result 609 states and 786 transitions. [2025-01-09 04:03:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:03:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-01-09 04:03:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:28,764 INFO L225 Difference]: With dead ends: 609 [2025-01-09 04:03:28,764 INFO L226 Difference]: Without dead ends: 437 [2025-01-09 04:03:28,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:28,765 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 152 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:28,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 395 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-09 04:03:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 428. [2025-01-09 04:03:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 322 states have (on average 1.236024844720497) internal successors, (398), 344 states have internal predecessors, (398), 58 states have call successors, (58), 46 states have call predecessors, (58), 47 states have return successors, (84), 55 states have call predecessors, (84), 58 states have call successors, (84) [2025-01-09 04:03:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 540 transitions. [2025-01-09 04:03:28,791 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 540 transitions. Word has length 56 [2025-01-09 04:03:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:28,792 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 540 transitions. [2025-01-09 04:03:28,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 540 transitions. [2025-01-09 04:03:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:03:28,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:28,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:28,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:03:28,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:28,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1663558960, now seen corresponding path program 1 times [2025-01-09 04:03:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226301373] [2025-01-09 04:03:28,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:03:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:03:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:28,913 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:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226301373] [2025-01-09 04:03:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226301373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:03:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310747450] [2025-01-09 04:03:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:03:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:28,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:03:28,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:03:28,915 INFO L87 Difference]: Start difference. First operand 428 states and 540 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 04:03:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:29,340 INFO L93 Difference]: Finished difference Result 1216 states and 1581 transitions. [2025-01-09 04:03:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 60 [2025-01-09 04:03:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:29,345 INFO L225 Difference]: With dead ends: 1216 [2025-01-09 04:03:29,345 INFO L226 Difference]: Without dead ends: 887 [2025-01-09 04:03:29,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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:29,347 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 350 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:29,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 611 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:03:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-01-09 04:03:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 792. [2025-01-09 04:03:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 592 states have (on average 1.2195945945945945) internal successors, (722), 634 states have internal predecessors, (722), 105 states have call successors, (105), 80 states have call predecessors, (105), 94 states have return successors, (160), 105 states have call predecessors, (160), 105 states have call successors, (160) [2025-01-09 04:03:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 987 transitions. [2025-01-09 04:03:29,411 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 987 transitions. Word has length 60 [2025-01-09 04:03:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:29,411 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 987 transitions. [2025-01-09 04:03:29,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 04:03:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 987 transitions. [2025-01-09 04:03:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:03:29,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:29,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:03:29,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:29,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 47797527, now seen corresponding path program 1 times [2025-01-09 04:03:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:29,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265075701] [2025-01-09 04:03:29,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:29,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:03:29,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:03:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 04:03:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265075701] [2025-01-09 04:03:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265075701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:29,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:29,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:29,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163588375] [2025-01-09 04:03:29,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:29,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:29,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:29,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:29,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:29,541 INFO L87 Difference]: Start difference. First operand 792 states and 987 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 04:03:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:29,605 INFO L93 Difference]: Finished difference Result 1498 states and 1905 transitions. [2025-01-09 04:03:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 109 [2025-01-09 04:03:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:29,612 INFO L225 Difference]: With dead ends: 1498 [2025-01-09 04:03:29,613 INFO L226 Difference]: Without dead ends: 801 [2025-01-09 04:03:29,614 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:29,616 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:29,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-01-09 04:03:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-01-09 04:03:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 601 states have (on average 1.21630615640599) internal successors, (731), 643 states have internal predecessors, (731), 105 states have call successors, (105), 80 states have call predecessors, (105), 94 states have return successors, (160), 105 states have call predecessors, (160), 105 states have call successors, (160) [2025-01-09 04:03:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 996 transitions. [2025-01-09 04:03:29,687 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 996 transitions. Word has length 109 [2025-01-09 04:03:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:29,688 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 996 transitions. [2025-01-09 04:03:29,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 04:03:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 996 transitions. [2025-01-09 04:03:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:03:29,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:29,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:03:29,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -14242087, now seen corresponding path program 1 times [2025-01-09 04:03:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879540599] [2025-01-09 04:03:29,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:29,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:03:29,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:03:29,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:29,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:03:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:29,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879540599] [2025-01-09 04:03:29,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879540599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:29,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63251740] [2025-01-09 04:03:29,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:29,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:29,863 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:29,869 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:29,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:03:29,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:03:29,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:29,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:29,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:03:29,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:03:30,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:03:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63251740] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:30,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:30,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-01-09 04:03:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928479472] [2025-01-09 04:03:30,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:30,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:03:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:30,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:03:30,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:03:30,280 INFO L87 Difference]: Start difference. First operand 801 states and 996 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) [2025-01-09 04:03:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:30,689 INFO L93 Difference]: Finished difference Result 1831 states and 2342 transitions. [2025-01-09 04:03:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 04:03:30,690 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) Word has length 109 [2025-01-09 04:03:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:30,697 INFO L225 Difference]: With dead ends: 1831 [2025-01-09 04:03:30,699 INFO L226 Difference]: Without dead ends: 1125 [2025-01-09 04:03:30,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:03:30,702 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 242 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:30,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1757 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-09 04:03:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 982. [2025-01-09 04:03:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 726 states have (on average 1.2011019283746556) internal successors, (872), 785 states have internal predecessors, (872), 132 states have call successors, (132), 110 states have call predecessors, (132), 123 states have return successors, (178), 127 states have call predecessors, (178), 132 states have call successors, (178) [2025-01-09 04:03:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1182 transitions. [2025-01-09 04:03:30,793 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1182 transitions. Word has length 109 [2025-01-09 04:03:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1182 transitions. [2025-01-09 04:03:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 12 states have internal predecessors, (141), 5 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) [2025-01-09 04:03:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1182 transitions. [2025-01-09 04:03:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:03:30,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:30,800 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:30,811 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:31,000 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:31,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1130429299, now seen corresponding path program 1 times [2025-01-09 04:03:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474888010] [2025-01-09 04:03:31,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:31,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:03:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:03:31,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:31,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 04:03:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474888010] [2025-01-09 04:03:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474888010] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893180891] [2025-01-09 04:03:31,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:31,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:31,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:31,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:03:31,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:03:31,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:03:31,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:31,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:03:31,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 04:03:31,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 77 proven. 38 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 04:03:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893180891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:31,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 22 [2025-01-09 04:03:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589802870] [2025-01-09 04:03:31,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:03:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:31,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:03:31,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:03:31,807 INFO L87 Difference]: Start difference. First operand 982 states and 1182 transitions. Second operand has 22 states, 22 states have (on average 9.590909090909092) internal successors, (211), 21 states have internal predecessors, (211), 9 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2025-01-09 04:03:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:33,385 INFO L93 Difference]: Finished difference Result 2181 states and 2718 transitions. [2025-01-09 04:03:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:03:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.590909090909092) internal successors, (211), 21 states have internal predecessors, (211), 9 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 187 [2025-01-09 04:03:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:33,389 INFO L225 Difference]: With dead ends: 2181 [2025-01-09 04:03:33,389 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:03:33,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:03:33,393 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 537 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:33,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 844 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:03:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:03:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:03:33,394 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:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:03:33,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2025-01-09 04:03:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:33,395 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:03:33,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.590909090909092) internal successors, (211), 21 states have internal predecessors, (211), 9 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2025-01-09 04:03:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:03:33,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:03:33,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:03:33,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:03:33,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:33,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:33,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:03:40,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:03:40,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:40 BoogieIcfgContainer [2025-01-09 04:03:40,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:03:40,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:03:40,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:03:40,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:03:40,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:27" (3/4) ... [2025-01-09 04:03:40,148 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:03:40,152 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-01-09 04:03:40,156 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 04:03:40,156 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:03:40,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:03:40,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:40,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:40,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:03:40,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:03:40,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:03:40,228 INFO L158 Benchmark]: Toolchain (without parser) took 13716.27ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 111.8MB in the beginning and 224.6MB in the end (delta: -112.7MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,228 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:40,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.70ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 92.3MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.01ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,228 INFO L158 Benchmark]: Boogie Preprocessor took 58.20ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:40,228 INFO L158 Benchmark]: RCFGBuilder took 318.17ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 69.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,229 INFO L158 Benchmark]: TraceAbstraction took 12891.13ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 69.8MB in the beginning and 232.7MB in the end (delta: -162.9MB). Peak memory consumption was 166.9MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,229 INFO L158 Benchmark]: Witness Printer took 80.29ms. Allocated memory is still 360.7MB. Free memory was 232.7MB in the beginning and 224.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:40,230 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.29ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.70ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 92.3MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.01ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.20ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 318.17ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 69.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12891.13ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 69.8MB in the beginning and 232.7MB in the end (delta: -162.9MB). Peak memory consumption was 166.9MB. Max. memory is 16.1GB. * Witness Printer took 80.29ms. Allocated memory is still 360.7MB. Free memory was 232.7MB in the beginning and 224.6MB in the end (delta: 8.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,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] - GenericResultAtLocation [Line: 418]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [418] - GenericResultAtLocation [Line: 488]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [488] - GenericResultAtLocation [Line: 526]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [526] - GenericResultAtLocation [Line: 535]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [535] - GenericResultAtLocation [Line: 584]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [584] - GenericResultAtLocation [Line: 950]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [950] * 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: 531]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1551 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1520 mSDsluCounter, 6518 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4961 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1973 IncrementalHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 1557 mSDtfsCounter, 1973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 600 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=982occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 253 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1097 NumberOfCodeBlocks, 1097 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1378 ConstructedInterpolants, 0 QuantifiedInterpolants, 2474 SizeOfPredicates, 2 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 689/763 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: 480]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((((pumpRunning == 0) && (2 == waterLevel)) && (splverifierCounter == 0)) || (((((waterLevel <= 1) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) && (pumpRunning == 1))) || ((((2 == waterLevel) && (splverifierCounter == 0)) && (0 != systemActive)) && (pumpRunning == 1))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (splverifierCounter == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:03:40,250 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