./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product63.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_spec1_product63.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 fd0b8ceecda33bdad48c402c2c8ba6fe539641c6d50bf604e9c60e70c71a562b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:51:10,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:51:10,416 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:10,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:51:10,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:51:10,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:51:10,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:51:10,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:51:10,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:51:10,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:51:10,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:51:10,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:51:10,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:51:10,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:51:10,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:51:10,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:51:10,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:51:10,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:51:10,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:10,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:51:10,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:51:10,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:51:10,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:51:10,452 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 -> fd0b8ceecda33bdad48c402c2c8ba6fe539641c6d50bf604e9c60e70c71a562b [2025-02-05 15:51:10,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:51:10,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:51:10,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:51:10,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:51:10,703 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:51:10,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product63.cil.c [2025-02-05 15:51:11,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e75c7234/db921dc352de403b8b6beac3e5f125dd/FLAG76d849e1a [2025-02-05 15:51:12,126 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:51:12,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product63.cil.c [2025-02-05 15:51:12,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e75c7234/db921dc352de403b8b6beac3e5f125dd/FLAG76d849e1a [2025-02-05 15:51:12,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e75c7234/db921dc352de403b8b6beac3e5f125dd [2025-02-05 15:51:12,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:51:12,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:51:12,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:12,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:51:12,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:51:12,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:12" (1/1) ... [2025-02-05 15:51:12,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3049b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:12, skipping insertion in model container [2025-02-05 15:51:12,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:12" (1/1) ... [2025-02-05 15:51:12,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:51:12,610 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_spec1_product63.cil.c[6160,6173] [2025-02-05 15:51:12,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:12,675 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:51:12,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [316] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [386] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [395] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [761] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [860] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [886] [2025-02-05 15:51:12,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [990] [2025-02-05 15:51:12,690 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_spec1_product63.cil.c[6160,6173] [2025-02-05 15:51:12,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:12,748 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:51:12,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:12 WrapperNode [2025-02-05 15:51:12,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:12,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:12,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:51:12,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:51:12,755 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:12" (1/1) ... [2025-02-05 15:51:12,767 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:12" (1/1) ... [2025-02-05 15:51:12,782 INFO L138 Inliner]: procedures = 58, calls = 106, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 217 [2025-02-05 15:51:12,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:12,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:51:12,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:51:12,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:51:12,789 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:12" (1/1) ... [2025-02-05 15:51:12,789 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:12" (1/1) ... [2025-02-05 15:51:12,791 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:12" (1/1) ... [2025-02-05 15:51:12,801 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:12,801 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:12" (1/1) ... [2025-02-05 15:51:12,801 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:12" (1/1) ... [2025-02-05 15:51:12,804 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:12" (1/1) ... [2025-02-05 15:51:12,805 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:12" (1/1) ... [2025-02-05 15:51:12,806 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:12" (1/1) ... [2025-02-05 15:51:12,807 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:12" (1/1) ... [2025-02-05 15:51:12,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:51:12,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:51:12,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:51:12,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:51:12,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:12" (1/1) ... [2025-02-05 15:51:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:12,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:12,830 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:12,834 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:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:51:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:51:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:51:12,915 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:51:12,917 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:51:12,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~11#1; [2025-02-05 15:51:12,985 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L298-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-02-05 15:51:13,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:51:13,021 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: #res := ~retValue_acc~8; [2025-02-05 15:51:13,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L224-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-02-05 15:51:13,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022-1: valid_product_#res#1 := valid_product_~retValue_acc~13#1; [2025-02-05 15:51:13,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L857-1: main_#res#1 := main_~retValue_acc~7#1; [2025-02-05 15:51:13,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-02-05 15:51:13,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~10#1; [2025-02-05 15:51:13,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L215: #res := ~retValue_acc~0; [2025-02-05 15:51:13,160 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-05 15:51:13,161 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:51:13,167 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:51:13,168 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:51:13,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:13 BoogieIcfgContainer [2025-02-05 15:51:13,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:51:13,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:51:13,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:51:13,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:51:13,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:51:12" (1/3) ... [2025-02-05 15:51:13,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:13, skipping insertion in model container [2025-02-05 15:51:13,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:12" (2/3) ... [2025-02-05 15:51:13,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:13, skipping insertion in model container [2025-02-05 15:51:13,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:13" (3/3) ... [2025-02-05 15:51:13,175 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product63.cil.c [2025-02-05 15:51:13,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:51:13,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product63.cil.c that has 11 procedures, 111 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:51:13,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:51:13,238 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;@540fa576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:51:13,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:51:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 90 states have internal predecessors, (107), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:51:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:51:13,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:13,247 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] [2025-02-05 15:51:13,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:13,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2087698558, now seen corresponding path program 1 times [2025-02-05 15:51:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315730793] [2025-02-05 15:51:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:13,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:51:13,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:51:13,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:13,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:13,396 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:13,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315730793] [2025-02-05 15:51:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315730793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:13,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:13,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:51:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363269669] [2025-02-05 15:51:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:51:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:51:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:13,421 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 90 states have internal predecessors, (107), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:13,452 INFO L93 Difference]: Finished difference Result 204 states and 275 transitions. [2025-02-05 15:51:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:51:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2025-02-05 15:51:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:13,459 INFO L225 Difference]: With dead ends: 204 [2025-02-05 15:51:13,459 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 15:51:13,464 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:13,465 INFO L435 NwaCegarLoop]: 138 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, 138 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:13,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 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:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 15:51:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-05 15:51:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 83 states have internal predecessors, (96), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:51:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2025-02-05 15:51:13,498 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 23 [2025-02-05 15:51:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:13,498 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2025-02-05 15:51:13,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2025-02-05 15:51:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:51:13,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:13,500 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] [2025-02-05 15:51:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:51:13,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:13,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1880346907, now seen corresponding path program 1 times [2025-02-05 15:51:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714867363] [2025-02-05 15:51:13,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:51:13,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:51:13,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:13,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:13,586 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:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714867363] [2025-02-05 15:51:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714867363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:13,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515701884] [2025-02-05 15:51:13,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:13,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:13,602 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:13,627 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2025-02-05 15:51:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:13,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2025-02-05 15:51:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:13,628 INFO L225 Difference]: With dead ends: 167 [2025-02-05 15:51:13,628 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 15:51:13,629 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:13,629 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 220 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:13,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 220 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:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 15:51:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 15:51:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.328358208955224) internal successors, (89), 77 states have internal predecessors, (89), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-05 15:51:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2025-02-05 15:51:13,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 24 [2025-02-05 15:51:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:13,636 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2025-02-05 15:51:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2025-02-05 15:51:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 15:51:13,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:13,637 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] [2025-02-05 15:51:13,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:51:13,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash -405453411, now seen corresponding path program 1 times [2025-02-05 15:51:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393768606] [2025-02-05 15:51:13,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:13,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 15:51:13,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:51:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:13,722 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:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393768606] [2025-02-05 15:51:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393768606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957004282] [2025-02-05 15:51:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:13,724 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:13,748 INFO L93 Difference]: Finished difference Result 264 states and 349 transitions. [2025-02-05 15:51:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:13,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2025-02-05 15:51:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:13,750 INFO L225 Difference]: With dead ends: 264 [2025-02-05 15:51:13,750 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 15:51:13,750 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:13,751 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 102 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:13,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 15:51:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-02-05 15:51:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.346774193548387) internal successors, (167), 143 states have internal predecessors, (167), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 15:51:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 231 transitions. [2025-02-05 15:51:13,782 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 231 transitions. Word has length 27 [2025-02-05 15:51:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:13,786 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 231 transitions. [2025-02-05 15:51:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 231 transitions. [2025-02-05 15:51:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:51:13,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:13,788 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] [2025-02-05 15:51:13,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:51:13,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:13,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 597089441, now seen corresponding path program 1 times [2025-02-05 15:51:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823090832] [2025-02-05 15:51:13,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:13,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:51:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:51:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:13,919 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:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823090832] [2025-02-05 15:51:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823090832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446678753] [2025-02-05 15:51:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:13,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:13,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:13,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:13,922 INFO L87 Difference]: Start difference. First operand 175 states and 231 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:14,013 INFO L93 Difference]: Finished difference Result 443 states and 598 transitions. [2025-02-05 15:51:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2025-02-05 15:51:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:14,017 INFO L225 Difference]: With dead ends: 443 [2025-02-05 15:51:14,017 INFO L226 Difference]: Without dead ends: 275 [2025-02-05 15:51:14,022 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:14,023 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 66 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:14,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 417 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-05 15:51:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2025-02-05 15:51:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 197 states have (on average 1.2944162436548223) internal successors, (255), 216 states have internal predecessors, (255), 42 states have call successors, (42), 34 states have call predecessors, (42), 34 states have return successors, (54), 37 states have call predecessors, (54), 42 states have call successors, (54) [2025-02-05 15:51:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 351 transitions. [2025-02-05 15:51:14,057 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 351 transitions. Word has length 31 [2025-02-05 15:51:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:14,057 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 351 transitions. [2025-02-05 15:51:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 351 transitions. [2025-02-05 15:51:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 15:51:14,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:14,060 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] [2025-02-05 15:51:14,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:51:14,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1063661077, now seen corresponding path program 1 times [2025-02-05 15:51:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627531864] [2025-02-05 15:51:14,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:14,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:51:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:51:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:14,165 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:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627531864] [2025-02-05 15:51:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627531864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173260830] [2025-02-05 15:51:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:14,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:14,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:14,166 INFO L87 Difference]: Start difference. First operand 274 states and 351 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:14,204 INFO L93 Difference]: Finished difference Result 547 states and 727 transitions. [2025-02-05 15:51:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:14,204 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-02-05 15:51:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:14,206 INFO L225 Difference]: With dead ends: 547 [2025-02-05 15:51:14,206 INFO L226 Difference]: Without dead ends: 280 [2025-02-05 15:51:14,207 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:14,207 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 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:14,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 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:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-05 15:51:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-02-05 15:51:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.2857142857142858) internal successors, (261), 222 states have internal predecessors, (261), 42 states have call successors, (42), 34 states have call predecessors, (42), 34 states have return successors, (54), 37 states have call predecessors, (54), 42 states have call successors, (54) [2025-02-05 15:51:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 357 transitions. [2025-02-05 15:51:14,255 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 357 transitions. Word has length 58 [2025-02-05 15:51:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:14,256 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 357 transitions. [2025-02-05 15:51:14,256 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 357 transitions. [2025-02-05 15:51:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 15:51:14,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:14,260 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] [2025-02-05 15:51:14,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:51:14,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1221202378, now seen corresponding path program 1 times [2025-02-05 15:51:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051152323] [2025-02-05 15:51:14,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:14,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:51:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:51:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:14,342 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:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051152323] [2025-02-05 15:51:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051152323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899672261] [2025-02-05 15:51:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:14,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:14,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:14,343 INFO L87 Difference]: Start difference. First operand 280 states and 357 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:14,374 INFO L93 Difference]: Finished difference Result 557 states and 737 transitions. [2025-02-05 15:51:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:14,375 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-02-05 15:51:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:14,378 INFO L225 Difference]: With dead ends: 557 [2025-02-05 15:51:14,379 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 15:51:14,380 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:14,381 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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:14,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 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:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 15:51:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-05 15:51:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 207 states have (on average 1.2801932367149758) internal successors, (265), 226 states have internal predecessors, (265), 42 states have call successors, (42), 34 states have call predecessors, (42), 34 states have return successors, (54), 37 states have call predecessors, (54), 42 states have call successors, (54) [2025-02-05 15:51:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 361 transitions. [2025-02-05 15:51:14,405 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 361 transitions. Word has length 58 [2025-02-05 15:51:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:14,405 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 361 transitions. [2025-02-05 15:51:14,405 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, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:51:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 361 transitions. [2025-02-05 15:51:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 15:51:14,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:14,408 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] [2025-02-05 15:51:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:51:14,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:14,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1022780920, now seen corresponding path program 1 times [2025-02-05 15:51:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:14,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873380373] [2025-02-05 15:51:14,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:14,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:51:14,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:51:14,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:14,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:14,484 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:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873380373] [2025-02-05 15:51:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873380373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:14,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532282592] [2025-02-05 15:51:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:14,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:14,486 INFO L87 Difference]: Start difference. First operand 284 states and 361 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:51:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:14,634 INFO L93 Difference]: Finished difference Result 909 states and 1195 transitions. [2025-02-05 15:51:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:14,634 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 58 [2025-02-05 15:51:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:14,638 INFO L225 Difference]: With dead ends: 909 [2025-02-05 15:51:14,638 INFO L226 Difference]: Without dead ends: 632 [2025-02-05 15:51:14,640 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:14,640 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 152 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:14,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 393 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-02-05 15:51:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2025-02-05 15:51:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 451 states have (on average 1.2594235033259424) internal successors, (568), 486 states have internal predecessors, (568), 90 states have call successors, (90), 76 states have call predecessors, (90), 78 states have return successors, (140), 82 states have call predecessors, (140), 90 states have call successors, (140) [2025-02-05 15:51:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 798 transitions. [2025-02-05 15:51:14,692 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 798 transitions. Word has length 58 [2025-02-05 15:51:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:14,692 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 798 transitions. [2025-02-05 15:51:14,693 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:51:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 798 transitions. [2025-02-05 15:51:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 15:51:14,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:14,694 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, 1, 1] [2025-02-05 15:51:14,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:51:14,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -352134778, now seen corresponding path program 1 times [2025-02-05 15:51:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296123009] [2025-02-05 15:51:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:14,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:51:14,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:51:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:14,834 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:14,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:14,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296123009] [2025-02-05 15:51:14,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296123009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:14,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:14,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:51:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117287345] [2025-02-05 15:51:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:14,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:51:14,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:14,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:51:14,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:51:14,837 INFO L87 Difference]: Start difference. First operand 620 states and 798 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, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:51:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:15,109 INFO L93 Difference]: Finished difference Result 1818 states and 2429 transitions. [2025-02-05 15:51:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:51:15,109 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, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-02-05 15:51:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:15,120 INFO L225 Difference]: With dead ends: 1818 [2025-02-05 15:51:15,121 INFO L226 Difference]: Without dead ends: 1205 [2025-02-05 15:51:15,123 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:15,124 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:15,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 840 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-02-05 15:51:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2025-02-05 15:51:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 868 states have (on average 1.23963133640553) internal successors, (1076), 933 states have internal predecessors, (1076), 180 states have call successors, (180), 152 states have call predecessors, (180), 156 states have return successors, (298), 164 states have call predecessors, (298), 180 states have call successors, (298) [2025-02-05 15:51:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1554 transitions. [2025-02-05 15:51:15,226 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1554 transitions. Word has length 62 [2025-02-05 15:51:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:15,226 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1554 transitions. [2025-02-05 15:51:15,226 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, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:51:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1554 transitions. [2025-02-05 15:51:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:51:15,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:15,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:15,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:51:15,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:15,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1966017911, now seen corresponding path program 1 times [2025-02-05 15:51:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335456387] [2025-02-05 15:51:15,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:51:15,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:51:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:51:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335456387] [2025-02-05 15:51:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335456387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723134107] [2025-02-05 15:51:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:15,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:15,287 INFO L87 Difference]: Start difference. First operand 1205 states and 1554 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:51:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:15,401 INFO L93 Difference]: Finished difference Result 1409 states and 1812 transitions. [2025-02-05 15:51:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:15,401 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 100 [2025-02-05 15:51:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:15,405 INFO L225 Difference]: With dead ends: 1409 [2025-02-05 15:51:15,406 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 15:51:15,408 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:15,408 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 146 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:15,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 273 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 15:51:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-02-05 15:51:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 425 states have (on average 1.2) internal successors, (510), 454 states have internal predecessors, (510), 86 states have call successors, (86), 76 states have call predecessors, (86), 78 states have return successors, (145), 80 states have call predecessors, (145), 86 states have call successors, (145) [2025-02-05 15:51:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 741 transitions. [2025-02-05 15:51:15,466 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 741 transitions. Word has length 100 [2025-02-05 15:51:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 741 transitions. [2025-02-05 15:51:15,467 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:51:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 741 transitions. [2025-02-05 15:51:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:51:15,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:15,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:51:15,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:15,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -605365441, now seen corresponding path program 1 times [2025-02-05 15:51:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542564671] [2025-02-05 15:51:15,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:15,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:51:15,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:51:15,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:15,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:51:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542564671] [2025-02-05 15:51:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542564671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693279507] [2025-02-05 15:51:15,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:15,585 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:15,587 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:15,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:51:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:51:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:15,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:51:15,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:51:15,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693279507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:15,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:15,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-05 15:51:15,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652872851] [2025-02-05 15:51:15,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:15,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:15,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:15,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:15,774 INFO L87 Difference]: Start difference. First operand 590 states and 741 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:51:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:16,088 INFO L93 Difference]: Finished difference Result 1301 states and 1697 transitions. [2025-02-05 15:51:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-02-05 15:51:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:16,095 INFO L225 Difference]: With dead ends: 1301 [2025-02-05 15:51:16,095 INFO L226 Difference]: Without dead ends: 816 [2025-02-05 15:51:16,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:51:16,098 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 154 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:16,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 281 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:51:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-02-05 15:51:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 814. [2025-02-05 15:51:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 585 states have (on average 1.1777777777777778) internal successors, (689), 622 states have internal predecessors, (689), 118 states have call successors, (118), 96 states have call predecessors, (118), 110 states have return successors, (243), 120 states have call predecessors, (243), 118 states have call successors, (243) [2025-02-05 15:51:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1050 transitions. [2025-02-05 15:51:16,152 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1050 transitions. Word has length 123 [2025-02-05 15:51:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:16,152 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1050 transitions. [2025-02-05 15:51:16,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:51:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1050 transitions. [2025-02-05 15:51:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:51:16,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:16,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:51:16,355 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:16,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1908464610, now seen corresponding path program 1 times [2025-02-05 15:51:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089221378] [2025-02-05 15:51:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:16,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:51:16,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:51:16,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:16,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:51:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089221378] [2025-02-05 15:51:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089221378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080522326] [2025-02-05 15:51:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:16,522 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:16,524 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:16,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:51:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:51:16,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:16,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:51:16,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:51:16,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080522326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:16,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:16,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-02-05 15:51:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493521854] [2025-02-05 15:51:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:16,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:51:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:16,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:51:16,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:51:16,761 INFO L87 Difference]: Start difference. First operand 814 states and 1050 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:51:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:16,929 INFO L93 Difference]: Finished difference Result 1621 states and 2093 transitions. [2025-02-05 15:51:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:51:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-02-05 15:51:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:16,934 INFO L225 Difference]: With dead ends: 1621 [2025-02-05 15:51:16,934 INFO L226 Difference]: Without dead ends: 814 [2025-02-05 15:51:16,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:51:16,937 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 70 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:16,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 739 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-05 15:51:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2025-02-05 15:51:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 585 states have (on average 1.1641025641025642) internal successors, (681), 622 states have internal predecessors, (681), 118 states have call successors, (118), 96 states have call predecessors, (118), 110 states have return successors, (213), 120 states have call predecessors, (213), 118 states have call successors, (213) [2025-02-05 15:51:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1012 transitions. [2025-02-05 15:51:17,007 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1012 transitions. Word has length 123 [2025-02-05 15:51:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:17,007 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1012 transitions. [2025-02-05 15:51:17,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:51:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1012 transitions. [2025-02-05 15:51:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:51:17,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:17,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,016 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:17,210 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:17,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1375198657, now seen corresponding path program 1 times [2025-02-05 15:51:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170824813] [2025-02-05 15:51:17,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:17,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:51:17,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:51:17,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:17,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:51:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:17,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170824813] [2025-02-05 15:51:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170824813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:17,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262807459] [2025-02-05 15:51:17,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:17,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:17,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:51:17,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:51:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:51:17,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:17,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:17,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:51:17,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:51:17,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262807459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-02-05 15:51:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277485872] [2025-02-05 15:51:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:51:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:51:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:51:17,533 INFO L87 Difference]: Start difference. First operand 814 states and 1012 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:51:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:17,649 INFO L93 Difference]: Finished difference Result 1425 states and 1797 transitions. [2025-02-05 15:51:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:51:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-05 15:51:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:17,651 INFO L225 Difference]: With dead ends: 1425 [2025-02-05 15:51:17,651 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:51:17,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 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:17,655 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 805 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:17,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 805 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:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:51:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:51:17,655 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:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:51:17,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2025-02-05 15:51:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:17,657 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:51:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:51:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:51:17,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:51:17,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:51:17,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:51:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:17,862 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:17,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:51:20,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:51:20,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:51:20 BoogieIcfgContainer [2025-02-05 15:51:20,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:51:20,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:51:20,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:51:20,887 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:51:20,887 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:13" (3/4) ... [2025-02-05 15:51:20,889 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:51:20,893 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:51:20,895 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-02-05 15:51:20,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-05 15:51:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:51:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:51:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:20,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:51:20,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:51:20,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:51:20,968 INFO L158 Benchmark]: Toolchain (without parser) took 8524.61ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 111.8MB in the beginning and 245.9MB in the end (delta: -134.1MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,968 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:20,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.21ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.7MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.43ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,968 INFO L158 Benchmark]: Boogie Preprocessor took 25.03ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:20,969 INFO L158 Benchmark]: IcfgBuilder took 359.76ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,969 INFO L158 Benchmark]: TraceAbstraction took 7715.50ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.6MB in the beginning and 254.2MB in the end (delta: -185.6MB). Peak memory consumption was 185.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,969 INFO L158 Benchmark]: Witness Printer took 80.59ms. Allocated memory is still 402.7MB. Free memory was 254.2MB in the beginning and 245.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:20,970 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.21ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.7MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.43ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.03ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 359.76ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7715.50ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.6MB in the beginning and 254.2MB in the end (delta: -185.6MB). Peak memory consumption was 185.4MB. Max. memory is 16.1GB. * Witness Printer took 80.59ms. Allocated memory is still 402.7MB. Free memory was 254.2MB in the beginning and 245.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] - GenericResultAtLocation [Line: 316]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [316] - GenericResultAtLocation [Line: 386]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [386] - GenericResultAtLocation [Line: 395]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [395] - GenericResultAtLocation [Line: 761]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [761] - GenericResultAtLocation [Line: 860]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [860] - GenericResultAtLocation [Line: 886]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [886] - GenericResultAtLocation [Line: 990]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [990] * 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: 391]: 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 11 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 890 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 868 mSDsluCounter, 5174 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3455 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 1719 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1171 NumberOfCodeBlocks, 1171 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1895 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1120 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 311/341 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: 773]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 330]: Location Invariant Derived location invariant: (((((pumpRunning == 0) && (splverifierCounter == 0)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 15:51:20,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE