./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product48.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product48.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 797436b26f0180d1dd4048b2036765c1f76ffc9f34d72e35837e9efcc5780486 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:51:47,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:51:47,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:51:47,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:51:47,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:51:47,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:51:47,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:51:47,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:51:47,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:51:47,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:51:47,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:51:47,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:51:47,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:51:47,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:51:47,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:51:47,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:47,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:51:47,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:51:47,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:51:47,356 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 -> 797436b26f0180d1dd4048b2036765c1f76ffc9f34d72e35837e9efcc5780486 [2025-02-05 15:51:47,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:51:47,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:51:47,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:51:47,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:51:47,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:51:47,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product48.cil.c [2025-02-05 15:51:48,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bde3f150/aa4e460c6e484a5caf0813b50ed19e68/FLAG36cb03c45 [2025-02-05 15:51:49,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:51:49,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product48.cil.c [2025-02-05 15:51:49,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bde3f150/aa4e460c6e484a5caf0813b50ed19e68/FLAG36cb03c45 [2025-02-05 15:51:49,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bde3f150/aa4e460c6e484a5caf0813b50ed19e68 [2025-02-05 15:51:49,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:51:49,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:51:49,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:49,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:51:49,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:51:49,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2dd7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49, skipping insertion in model container [2025-02-05 15:51:49,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:51:49,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product48.cil.c[17766,17779] [2025-02-05 15:51:49,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:49,374 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:51:49,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-02-05 15:51:49,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [150] [2025-02-05 15:51:49,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [188] [2025-02-05 15:51:49,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [261] [2025-02-05 15:51:49,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [484] [2025-02-05 15:51:49,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [524] [2025-02-05 15:51:49,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [890] [2025-02-05 15:51:49,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [899] [2025-02-05 15:51:49,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product48.cil.c[17766,17779] [2025-02-05 15:51:49,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:49,451 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:51:49,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49 WrapperNode [2025-02-05 15:51:49,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:49,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:49,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:51:49,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:51:49,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,478 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 196 [2025-02-05 15:51:49,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:49,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:51:49,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:51:49,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:51:49,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,494 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:51:49,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:51:49,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:51:49,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:51:49,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:51:49,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (1/1) ... [2025-02-05 15:51:49,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:49,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:51:49,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:51:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:51:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:51:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:51:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:51:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:51:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:51:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:51:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:51:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:51:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:51:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:51:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:51:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:51:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:51:49,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:51:49,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:51:49,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:51:49,645 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:51:49,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; [2025-02-05 15:51:49,700 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: #res := ~retValue_acc~0; [2025-02-05 15:51:49,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L993-1: main_#res#1 := main_~retValue_acc~11#1; [2025-02-05 15:51:49,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-02-05 15:51:49,794 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-02-05 15:51:49,794 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L458-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~7#1; [2025-02-05 15:51:49,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: #res := ~retValue_acc~5; [2025-02-05 15:51:49,818 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-05 15:51:49,822 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:51:49,829 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:51:49,829 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:51:49,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:49 BoogieIcfgContainer [2025-02-05 15:51:49,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:51:49,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:51:49,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:51:49,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:51:49,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:51:49" (1/3) ... [2025-02-05 15:51:49,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:49, skipping insertion in model container [2025-02-05 15:51:49,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:49" (2/3) ... [2025-02-05 15:51:49,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:49, skipping insertion in model container [2025-02-05 15:51:49,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:49" (3/3) ... [2025-02-05 15:51:49,838 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product48.cil.c [2025-02-05 15:51:49,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:51:49,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product48.cil.c that has 10 procedures, 102 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:51:49,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:51:49,908 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;@29951189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:51:49,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:51:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 83 states have internal predecessors, (100), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:51:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:51:49,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:49,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:49,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 885872283, now seen corresponding path program 1 times [2025-02-05 15:51:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:49,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478648382] [2025-02-05 15:51:49,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:49,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:51:50,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:51:50,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478648382] [2025-02-05 15:51:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478648382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:51:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352658425] [2025-02-05 15:51:50,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:51:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:51:50,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:50,102 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 83 states have internal predecessors, (100), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:50,129 INFO L93 Difference]: Finished difference Result 185 states and 248 transitions. [2025-02-05 15:51:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:51:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-05 15:51:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:50,137 INFO L225 Difference]: With dead ends: 185 [2025-02-05 15:51:50,137 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 15:51:50,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:50,144 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:50,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 15:51:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 15:51:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 76 states have internal predecessors, (89), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:51:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2025-02-05 15:51:50,182 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 25 [2025-02-05 15:51:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:50,182 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2025-02-05 15:51:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2025-02-05 15:51:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:51:50,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:50,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:50,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:51:50,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:50,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 328827820, now seen corresponding path program 1 times [2025-02-05 15:51:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:50,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317465917] [2025-02-05 15:51:50,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:50,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:51:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:51:50,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:50,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317465917] [2025-02-05 15:51:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317465917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577356174] [2025-02-05 15:51:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:50,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:50,310 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:50,329 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2025-02-05 15:51:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:50,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-05 15:51:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:50,333 INFO L225 Difference]: With dead ends: 147 [2025-02-05 15:51:50,333 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 15:51:50,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:50,351 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:50,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 193 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 15:51:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 15:51:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 70 states have internal predecessors, (82), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:51:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2025-02-05 15:51:50,358 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 26 [2025-02-05 15:51:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:50,358 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2025-02-05 15:51:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2025-02-05 15:51:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 15:51:50,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:50,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:50,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:51:50,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:50,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1354593777, now seen corresponding path program 1 times [2025-02-05 15:51:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-02-05 15:51:50,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:50,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:51:50,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:51:50,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:50,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344337227] [2025-02-05 15:51:50,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344337227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066447993] [2025-02-05 15:51:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:50,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:50,426 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:50,469 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2025-02-05 15:51:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-05 15:51:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:50,471 INFO L225 Difference]: With dead ends: 234 [2025-02-05 15:51:50,471 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 15:51:50,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:50,472 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 86 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:50,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 15:51:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-02-05 15:51:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 127 states have internal predecessors, (151), 26 states have call successors, (26), 16 states have call predecessors, (26), 16 states have return successors, (26), 19 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 15:51:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2025-02-05 15:51:50,488 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 30 [2025-02-05 15:51:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:50,489 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2025-02-05 15:51:50,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2025-02-05 15:51:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:51:50,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:50,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:50,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:51:50,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:50,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -775613095, now seen corresponding path program 1 times [2025-02-05 15:51:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706157783] [2025-02-05 15:51:50,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:50,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:51:50,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:51:50,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706157783] [2025-02-05 15:51:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706157783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116168218] [2025-02-05 15:51:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:50,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:50,602 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:50,675 INFO L93 Difference]: Finished difference Result 395 states and 526 transitions. [2025-02-05 15:51:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:50,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-02-05 15:51:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:50,677 INFO L225 Difference]: With dead ends: 395 [2025-02-05 15:51:50,677 INFO L226 Difference]: Without dead ends: 248 [2025-02-05 15:51:50,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:51:50,678 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 60 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:50,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 371 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-05 15:51:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2025-02-05 15:51:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 180 states have (on average 1.3) internal successors, (234), 197 states have internal predecessors, (234), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (44), 33 states have call predecessors, (44), 36 states have call successors, (44) [2025-02-05 15:51:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 314 transitions. [2025-02-05 15:51:50,697 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 314 transitions. Word has length 33 [2025-02-05 15:51:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:50,697 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 314 transitions. [2025-02-05 15:51:50,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 314 transitions. [2025-02-05 15:51:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 15:51:50,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:50,699 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-02-05 15:51:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:51:50,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2102286600, now seen corresponding path program 1 times [2025-02-05 15:51:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726605226] [2025-02-05 15:51:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 15:51:50,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 15:51:50,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726605226] [2025-02-05 15:51:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726605226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503773742] [2025-02-05 15:51:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:50,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:50,778 INFO L87 Difference]: Start difference. First operand 247 states and 314 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-02-05 15:51:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:50,821 INFO L93 Difference]: Finished difference Result 492 states and 644 transitions. [2025-02-05 15:51:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:50,821 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-02-05 15:51:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:50,824 INFO L225 Difference]: With dead ends: 492 [2025-02-05 15:51:50,824 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 15:51:50,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:50,828 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:50,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 15:51:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-05 15:51:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 186 states have (on average 1.2903225806451613) internal successors, (240), 203 states have internal predecessors, (240), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (44), 33 states have call predecessors, (44), 36 states have call successors, (44) [2025-02-05 15:51:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2025-02-05 15:51:50,863 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 56 [2025-02-05 15:51:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:50,863 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2025-02-05 15:51:50,863 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-02-05 15:51:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2025-02-05 15:51:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 15:51:50,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:50,865 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-02-05 15:51:50,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:51:50,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:50,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1751486663, now seen corresponding path program 1 times [2025-02-05 15:51:50,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400380299] [2025-02-05 15:51:50,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:50,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:50,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 15:51:50,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 15:51:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:50,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400380299] [2025-02-05 15:51:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400380299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:50,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415064688] [2025-02-05 15:51:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:50,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:50,981 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-02-05 15:51:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:51,000 INFO L93 Difference]: Finished difference Result 502 states and 654 transitions. [2025-02-05 15:51:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:51,001 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), 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-02-05 15:51:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:51,002 INFO L225 Difference]: With dead ends: 502 [2025-02-05 15:51:51,003 INFO L226 Difference]: Without dead ends: 257 [2025-02-05 15:51:51,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:51,004 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-05 15:51:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-05 15:51:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.2842105263157895) internal successors, (244), 207 states have internal predecessors, (244), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (44), 33 states have call predecessors, (44), 36 states have call successors, (44) [2025-02-05 15:51:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 324 transitions. [2025-02-05 15:51:51,018 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 324 transitions. Word has length 56 [2025-02-05 15:51:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 324 transitions. [2025-02-05 15:51:51,018 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), 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-02-05 15:51:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2025-02-05 15:51:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 15:51:51,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:51,020 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-02-05 15:51:51,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:51:51,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:51,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1823873221, now seen corresponding path program 1 times [2025-02-05 15:51:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-02-05 15:51:51,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:51,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 15:51:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 15:51:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-02-05 15:51:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711340295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:51,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:51,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122950237] [2025-02-05 15:51:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:51,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:51,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:51,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:51,090 INFO L87 Difference]: Start difference. First operand 257 states and 324 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:51:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:51,255 INFO L93 Difference]: Finished difference Result 817 states and 1063 transitions. [2025-02-05 15:51:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:51,257 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), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-02-05 15:51:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:51,260 INFO L225 Difference]: With dead ends: 817 [2025-02-05 15:51:51,261 INFO L226 Difference]: Without dead ends: 568 [2025-02-05 15:51:51,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:51,262 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 134 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:51,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 337 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-05 15:51:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2025-02-05 15:51:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 411 states have (on average 1.2652068126520681) internal successors, (520), 442 states have internal predecessors, (520), 76 states have call successors, (76), 66 states have call predecessors, (76), 68 states have return successors, (112), 72 states have call predecessors, (112), 76 states have call successors, (112) [2025-02-05 15:51:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 708 transitions. [2025-02-05 15:51:51,322 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 708 transitions. Word has length 56 [2025-02-05 15:51:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:51,323 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 708 transitions. [2025-02-05 15:51:51,323 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), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:51:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 708 transitions. [2025-02-05 15:51:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 15:51:51,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:51,330 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-02-05 15:51:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:51:51,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 962388093, now seen corresponding path program 1 times [2025-02-05 15:51:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255013345] [2025-02-05 15:51:51,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 15:51:51,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 15:51:51,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:51,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255013345] [2025-02-05 15:51:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255013345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:51:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850388795] [2025-02-05 15:51:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:51:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:51,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:51:51,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:51:51,563 INFO L87 Difference]: Start difference. First operand 556 states and 708 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:51,867 INFO L93 Difference]: Finished difference Result 1620 states and 2139 transitions. [2025-02-05 15:51:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:51:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 15:51:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:51,878 INFO L225 Difference]: With dead ends: 1620 [2025-02-05 15:51:51,878 INFO L226 Difference]: Without dead ends: 1072 [2025-02-05 15:51:51,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:51:51,881 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 88 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:51,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 752 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:51:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-02-05 15:51:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-02-05 15:51:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 783 states have (on average 1.240102171136654) internal successors, (971), 840 states have internal predecessors, (971), 152 states have call successors, (152), 132 states have call predecessors, (152), 136 states have return successors, (240), 144 states have call predecessors, (240), 152 states have call successors, (240) [2025-02-05 15:51:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1363 transitions. [2025-02-05 15:51:51,968 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1363 transitions. Word has length 60 [2025-02-05 15:51:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:51,968 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1363 transitions. [2025-02-05 15:51:51,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1363 transitions. [2025-02-05 15:51:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:51:51,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:51,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:51,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:51:51,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:51,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 224356914, now seen corresponding path program 1 times [2025-02-05 15:51:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585275173] [2025-02-05 15:51:51,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:51:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:51:51,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:51:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585275173] [2025-02-05 15:51:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585275173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:52,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:52,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860029850] [2025-02-05 15:51:52,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:52,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:52,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:52,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:52,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:52,046 INFO L87 Difference]: Start difference. First operand 1072 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:51:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:52,153 INFO L93 Difference]: Finished difference Result 1803 states and 2289 transitions. [2025-02-05 15:51:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2025-02-05 15:51:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:52,158 INFO L225 Difference]: With dead ends: 1803 [2025-02-05 15:51:52,158 INFO L226 Difference]: Without dead ends: 739 [2025-02-05 15:51:52,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:52,161 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 131 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:52,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 251 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-02-05 15:51:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 727. [2025-02-05 15:51:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 538 states have (on average 1.224907063197026) internal successors, (659), 577 states have internal predecessors, (659), 98 states have call successors, (98), 88 states have call predecessors, (98), 90 states have return successors, (147), 96 states have call predecessors, (147), 98 states have call successors, (147) [2025-02-05 15:51:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 904 transitions. [2025-02-05 15:51:52,219 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 904 transitions. Word has length 94 [2025-02-05 15:51:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:52,219 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 904 transitions. [2025-02-05 15:51:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:51:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 904 transitions. [2025-02-05 15:51:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:51:52,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:52,222 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:51:52,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:52,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash -250171624, now seen corresponding path program 1 times [2025-02-05 15:51:52,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:52,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329573353] [2025-02-05 15:51:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:51:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:51:52,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:52,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:51:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329573353] [2025-02-05 15:51:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329573353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642008182] [2025-02-05 15:51:52,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:52,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:52,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:52,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:52,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:51:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:51:52,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:51:52,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:51:52,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:51:52,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642008182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-02-05 15:51:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414857495] [2025-02-05 15:51:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:52,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:51:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:52,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:51:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:51:52,853 INFO L87 Difference]: Start difference. First operand 727 states and 904 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:51:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:53,086 INFO L93 Difference]: Finished difference Result 1446 states and 1800 transitions. [2025-02-05 15:51:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:51:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-02-05 15:51:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:53,091 INFO L225 Difference]: With dead ends: 1446 [2025-02-05 15:51:53,091 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 15:51:53,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:51:53,093 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 66 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:53,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 610 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:51:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 15:51:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-02-05 15:51:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 538 states have (on average 1.20817843866171) internal successors, (650), 577 states have internal predecessors, (650), 98 states have call successors, (98), 88 states have call predecessors, (98), 90 states have return successors, (131), 96 states have call predecessors, (131), 98 states have call successors, (131) [2025-02-05 15:51:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 879 transitions. [2025-02-05 15:51:53,132 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 879 transitions. Word has length 116 [2025-02-05 15:51:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:53,132 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 879 transitions. [2025-02-05 15:51:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:51:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 879 transitions. [2025-02-05 15:51:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:51:53,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:53,135 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-02-05 15:51:53,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:51:53,339 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-02-05 15:51:53,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -817073927, now seen corresponding path program 1 times [2025-02-05 15:51:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666963824] [2025-02-05 15:51:53,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:53,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:51:53,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:51:53,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:53,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:51:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666963824] [2025-02-05 15:51:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666963824] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133649265] [2025-02-05 15:51:53,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:53,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:53,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:51:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:51:53,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:51:53,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:53,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:53,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:51:53,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:51:53,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133649265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:53,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:53,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-02-05 15:51:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738355963] [2025-02-05 15:51:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:51:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:53,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:51:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:51:53,700 INFO L87 Difference]: Start difference. First operand 727 states and 879 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:51:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:53,825 INFO L93 Difference]: Finished difference Result 1230 states and 1501 transitions. [2025-02-05 15:51:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:51:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:51:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:53,828 INFO L225 Difference]: With dead ends: 1230 [2025-02-05 15:51:53,828 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:51:53,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:51:53,831 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:53,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 801 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:51:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:51:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:51:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:51:53,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2025-02-05 15:51:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:53,833 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:51:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:51:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:51:53,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:51:53,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:51:53,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:51:54,040 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-02-05 15:51:54,042 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:54,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:51:56,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:51:56,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:51:56 BoogieIcfgContainer [2025-02-05 15:51:56,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:51:56,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:51:56,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:51:56,863 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:51:56,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:49" (3/4) ... [2025-02-05 15:51:56,865 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:51:56,869 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-02-05 15:51:56,869 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:51:56,869 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:56,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-02-05 15:51:56,874 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-05 15:51:56,874 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:51:56,874 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:51:56,874 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:56,875 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:56,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:51:56,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:51:56,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:51:56,931 INFO L158 Benchmark]: Toolchain (without parser) took 7821.52ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 116.3MB in the beginning and 351.9MB in the end (delta: -235.5MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,931 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:56,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 97.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.99ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:56,932 INFO L158 Benchmark]: Boogie Preprocessor took 20.77ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,932 INFO L158 Benchmark]: IcfgBuilder took 328.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 75.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,932 INFO L158 Benchmark]: TraceAbstraction took 7031.50ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 74.6MB in the beginning and 360.0MB in the end (delta: -285.3MB). Peak memory consumption was 201.7MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,932 INFO L158 Benchmark]: Witness Printer took 67.91ms. Allocated memory is still 411.0MB. Free memory was 360.0MB in the beginning and 351.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:56,933 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 97.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.99ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.77ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 328.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 75.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7031.50ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 74.6MB in the beginning and 360.0MB in the end (delta: -285.3MB). Peak memory consumption was 201.7MB. Max. memory is 16.1GB. * Witness Printer took 67.91ms. Allocated memory is still 411.0MB. Free memory was 360.0MB in the beginning and 351.9MB in the end (delta: 8.1MB). 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: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [150] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [188] - GenericResultAtLocation [Line: 261]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [261] - GenericResultAtLocation [Line: 484]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [484] - GenericResultAtLocation [Line: 524]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [524] - GenericResultAtLocation [Line: 890]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [890] - GenericResultAtLocation [Line: 899]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [899] * 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: 895]: 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, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 4389 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2927 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1462 mSDtfsCounter, 650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1072occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 884 NumberOfCodeBlocks, 884 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 1477 SizeOfPredicates, 1 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 207/232 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: 203]: Location Invariant Derived location invariant: (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 911]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:51:56,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE