./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b77aa0b6bb6bc59dbd8795b5281a5f1c0be2cf01c1e68aab61a4eabad5ef322b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:41,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:41,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:41,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:41,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:41,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:41,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:41,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:41,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:41,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:41,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:41,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:41,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:41,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:41,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:41,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:41,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:41,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:41,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:41,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:41,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:41,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:41,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:41,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:41,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:41,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:41,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:41,474 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/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 -> b77aa0b6bb6bc59dbd8795b5281a5f1c0be2cf01c1e68aab61a4eabad5ef322b [2025-03-08 05:38:41,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:41,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:41,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:41,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:41,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:41,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2025-03-08 05:38:42,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30fbc61b/98992d59024f443289f7ce05212dd50c/FLAGffb5b541e [2025-03-08 05:38:43,155 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:38:43,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2025-03-08 05:38:43,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30fbc61b/98992d59024f443289f7ce05212dd50c/FLAGffb5b541e [2025-03-08 05:38:43,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30fbc61b/98992d59024f443289f7ce05212dd50c [2025-03-08 05:38:43,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:38:43,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:38:43,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:43,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:38:43,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:38:43,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b46d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43, skipping insertion in model container [2025-03-08 05:38:43,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:38:43,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c[16839,16852] [2025-03-08 05:38:43,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:43,721 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:38:43,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2025-03-08 05:38:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [153] [2025-03-08 05:38:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [188] [2025-03-08 05:38:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [217] [2025-03-08 05:38:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] [2025-03-08 05:38:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [775] [2025-03-08 05:38:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [842] [2025-03-08 05:38:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [851] [2025-03-08 05:38:43,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c[16839,16852] [2025-03-08 05:38:43,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:43,792 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:38:43,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43 WrapperNode [2025-03-08 05:38:43,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:43,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:43,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:38:43,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:38:43,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,819 INFO L138 Inliner]: procedures = 54, calls = 98, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 186 [2025-03-08 05:38:43,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:43,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:38:43,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:38:43,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:38:43,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,838 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-03-08 05:38:43,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:38:43,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:38:43,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:38:43,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:38:43,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (1/1) ... [2025-03-08 05:38:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:43,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:43,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:38:43,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:38:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:38:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:38:43,958 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:38:43,960 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:38:43,997 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L897: #res := ~retValue_acc~9; [2025-03-08 05:38:44,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2025-03-08 05:38:44,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-03-08 05:38:44,141 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-08 05:38:44,142 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-1: main_#res#1 := main_~retValue_acc~0#1; [2025-03-08 05:38:44,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L764-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2025-03-08 05:38:44,164 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L943-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; [2025-03-08 05:38:44,180 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 05:38:44,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:38:44,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:38:44,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:38:44,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:44 BoogieIcfgContainer [2025-03-08 05:38:44,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:38:44,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:38:44,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:38:44,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:38:44,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:43" (1/3) ... [2025-03-08 05:38:44,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53723215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:44, skipping insertion in model container [2025-03-08 05:38:44,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43" (2/3) ... [2025-03-08 05:38:44,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53723215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:44, skipping insertion in model container [2025-03-08 05:38:44,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:44" (3/3) ... [2025-03-08 05:38:44,197 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product38.cil.c [2025-03-08 05:38:44,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:38:44,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product38.cil.c that has 8 procedures, 83 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:38:44,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:38:44,263 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;@34744bfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:38:44,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:38:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 70 states have internal predecessors, (85), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 05:38:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:38:44,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:44,272 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-03-08 05:38:44,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:44,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1902512128, now seen corresponding path program 1 times [2025-03-08 05:38:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:44,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278228020] [2025-03-08 05:38:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:38:44,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:38:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:44,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278228020] [2025-03-08 05:38:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278228020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:44,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801026804] [2025-03-08 05:38:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:44,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:44,470 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 70 states have internal predecessors, (85), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-08 05:38:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:44,502 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2025-03-08 05:38:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-08 05:38:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:44,510 INFO L225 Difference]: With dead ends: 146 [2025-03-08 05:38:44,510 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 05:38:44,513 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-03-08 05:38:44,515 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 161 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-03-08 05:38:44,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 05:38:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 05:38:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 57 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:38:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-08 05:38:44,540 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 23 [2025-03-08 05:38:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-08 05:38:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-08 05:38:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-08 05:38:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 05:38:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:44,543 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-03-08 05:38:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:38:44,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1490637620, now seen corresponding path program 1 times [2025-03-08 05:38:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444565807] [2025-03-08 05:38:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:38:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:38:44,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:44,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444565807] [2025-03-08 05:38:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444565807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:44,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454899314] [2025-03-08 05:38:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:44,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:44,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:44,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:44,697 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-08 05:38:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:44,751 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2025-03-08 05:38:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-08 05:38:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:44,752 INFO L225 Difference]: With dead ends: 125 [2025-03-08 05:38:44,752 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 05:38:44,753 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-03-08 05:38:44,753 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:44,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 241 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 05:38:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 05:38:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.32) internal successors, (66), 57 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:38:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-03-08 05:38:44,760 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 27 [2025-03-08 05:38:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-03-08 05:38:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-08 05:38:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-03-08 05:38:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:38:44,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:44,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:38:44,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1015884332, now seen corresponding path program 1 times [2025-03-08 05:38:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46621686] [2025-03-08 05:38:44,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:44,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:38:44,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:38:44,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:44,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46621686] [2025-03-08 05:38:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46621686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749955584] [2025-03-08 05:38:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:44,874 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:38:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,059 INFO L93 Difference]: Finished difference Result 195 states and 248 transitions. [2025-03-08 05:38:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-03-08 05:38:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,060 INFO L225 Difference]: With dead ends: 195 [2025-03-08 05:38:45,060 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 05:38:45,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:38:45,061 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 163 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 250 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 05:38:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2025-03-08 05:38:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-08 05:38:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2025-03-08 05:38:45,075 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 37 [2025-03-08 05:38:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2025-03-08 05:38:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:38:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2025-03-08 05:38:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 05:38:45,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:38:45,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1686311279, now seen corresponding path program 1 times [2025-03-08 05:38:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673848844] [2025-03-08 05:38:45,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 05:38:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:38:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673848844] [2025-03-08 05:38:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673848844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450810394] [2025-03-08 05:38:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:45,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:45,137 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,162 INFO L93 Difference]: Finished difference Result 256 states and 318 transitions. [2025-03-08 05:38:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:45,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 05:38:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,164 INFO L225 Difference]: With dead ends: 256 [2025-03-08 05:38:45,164 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 05:38:45,164 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-03-08 05:38:45,165 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 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-03-08 05:38:45,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 05:38:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-08 05:38:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 108 states have internal predecessors, (127), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-08 05:38:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2025-03-08 05:38:45,183 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 41 [2025-03-08 05:38:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,184 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2025-03-08 05:38:45,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2025-03-08 05:38:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 05:38:45,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:38:45,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash 689238926, now seen corresponding path program 1 times [2025-03-08 05:38:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257989227] [2025-03-08 05:38:45,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 05:38:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:38:45,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257989227] [2025-03-08 05:38:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257989227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677702689] [2025-03-08 05:38:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:45,273 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,304 INFO L93 Difference]: Finished difference Result 261 states and 326 transitions. [2025-03-08 05:38:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 05:38:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,307 INFO L225 Difference]: With dead ends: 261 [2025-03-08 05:38:45,307 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 05:38:45,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:45,309 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 05:38:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 05:38:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 110 states have internal predecessors, (129), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-08 05:38:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2025-03-08 05:38:45,321 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 41 [2025-03-08 05:38:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,321 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2025-03-08 05:38:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2025-03-08 05:38:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 05:38:45,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:38:45,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -128409524, now seen corresponding path program 1 times [2025-03-08 05:38:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752988413] [2025-03-08 05:38:45,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 05:38:45,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:38:45,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752988413] [2025-03-08 05:38:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752988413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:38:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753417455] [2025-03-08 05:38:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:38:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:38:45,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:45,398 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,474 INFO L93 Difference]: Finished difference Result 417 states and 527 transitions. [2025-03-08 05:38:45,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:38:45,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 05:38:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,476 INFO L225 Difference]: With dead ends: 417 [2025-03-08 05:38:45,476 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 05:38:45,477 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-03-08 05:38:45,477 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 112 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 277 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 05:38:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 182. [2025-03-08 05:38:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 147 states have internal predecessors, (171), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-03-08 05:38:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 219 transitions. [2025-03-08 05:38:45,498 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 219 transitions. Word has length 41 [2025-03-08 05:38:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 219 transitions. [2025-03-08 05:38:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 219 transitions. [2025-03-08 05:38:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:38:45,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:38:45,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1845173448, now seen corresponding path program 1 times [2025-03-08 05:38:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84682325] [2025-03-08 05:38:45,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:38:45,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:38:45,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84682325] [2025-03-08 05:38:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84682325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388363753] [2025-03-08 05:38:45,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:45,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:45,578 INFO L87 Difference]: Start difference. First operand 182 states and 219 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:38:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,722 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2025-03-08 05:38:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:38:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-08 05:38:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,724 INFO L225 Difference]: With dead ends: 186 [2025-03-08 05:38:45,724 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 05:38:45,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:38:45,725 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 259 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 05:38:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2025-03-08 05:38:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 147 states have internal predecessors, (168), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-03-08 05:38:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2025-03-08 05:38:45,748 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 43 [2025-03-08 05:38:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2025-03-08 05:38:45,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:38:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2025-03-08 05:38:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 05:38:45,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:38:45,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -19275670, now seen corresponding path program 1 times [2025-03-08 05:38:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203642686] [2025-03-08 05:38:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 05:38:45,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:38:45,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:45,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203642686] [2025-03-08 05:38:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203642686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136697082] [2025-03-08 05:38:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:45,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:45,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:45,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:45,854 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:45,946 INFO L93 Difference]: Finished difference Result 520 states and 634 transitions. [2025-03-08 05:38:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-08 05:38:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:45,950 INFO L225 Difference]: With dead ends: 520 [2025-03-08 05:38:45,952 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 05:38:45,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:45,953 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:45,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 373 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 05:38:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-08 05:38:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 258 states have (on average 1.193798449612403) internal successors, (308), 275 states have internal predecessors, (308), 42 states have call successors, (42), 38 states have call predecessors, (42), 44 states have return successors, (57), 42 states have call predecessors, (57), 42 states have call successors, (57) [2025-03-08 05:38:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 407 transitions. [2025-03-08 05:38:45,996 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 407 transitions. Word has length 45 [2025-03-08 05:38:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:45,996 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 407 transitions. [2025-03-08 05:38:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 407 transitions. [2025-03-08 05:38:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:38:45,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:45,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:45,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:38:45,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1120321303, now seen corresponding path program 1 times [2025-03-08 05:38:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731987223] [2025-03-08 05:38:45,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:46,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:38:46,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:38:46,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:46,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:38:46,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:38:46,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:38:46,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:46,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:38:46,038 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:38:46,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:38:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:38:46,042 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:46,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:38:46,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:38:46 BoogieIcfgContainer [2025-03-08 05:38:46,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:38:46,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:38:46,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:38:46,089 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:38:46,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:44" (3/4) ... [2025-03-08 05:38:46,090 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:38:46,133 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-03-08 05:38:46,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:38:46,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:38:46,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:38:46,199 INFO L158 Benchmark]: Toolchain (without parser) took 2739.89ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 102.4MB in the end (delta: 29.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,199 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.22ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 113.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 111.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,200 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,200 INFO L158 Benchmark]: IcfgBuilder took 345.30ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 92.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,200 INFO L158 Benchmark]: TraceAbstraction took 1896.76ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 111.2MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:46,202 INFO L158 Benchmark]: Witness Printer took 109.42ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 102.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:46,203 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.22ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 113.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 111.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 345.30ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 92.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1896.76ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 111.2MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 109.42ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 102.4MB in the end (delta: 8.8MB). 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,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [153] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [188] - GenericResultAtLocation [Line: 217]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [217] - GenericResultAtLocation [Line: 583]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] - GenericResultAtLocation [Line: 775]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [775] - GenericResultAtLocation [Line: 842]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [842] - GenericResultAtLocation [Line: 851]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [851] * 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 - CounterExampleResult [Line: 847]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L50] int cleanupTimeShifts = 4; [L387] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L590] int pumpRunning = 0; [L591] int systemActive = 1; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L131] int retValue_acc ; [L132] int tmp ; [L136] FCALL select_helpers() [L137] FCALL select_features() [L138] CALL, EXPR valid_product() [L180] int retValue_acc ; [L183] retValue_acc = 1 [L184] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L138] RET, EXPR valid_product() [L138] tmp = valid_product() [L140] COND TRUE \read(tmp) [L142] FCALL setup() [L143] CALL runTest() [L122] CALL test() [L777] int splverifierCounter ; [L778] int tmp ; [L779] int tmp___0 ; [L780] int tmp___1 ; [L781] int tmp___2 ; [L784] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L788] COND TRUE splverifierCounter < 4 [L794] tmp = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L798] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L871] COND TRUE waterLevel < 2 [L872] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L798] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L804] tmp___0 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L808] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L883] COND FALSE !(\read(methaneLevelCritical)) [L886] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L808] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L814] tmp___2 = __VERIFIER_nondet_int() [L816] COND TRUE \read(tmp___2) [L818] CALL startSystem() [L771] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L818] RET startSystem() [L831] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L597] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L604] COND TRUE \read(systemActive) [L606] CALL processEnvironment() [L652] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L655] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L670] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L626] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] COND TRUE ! pumpRunning [L631] CALL, EXPR isHighWaterLevel() [L749] int retValue_acc ; [L750] int tmp ; [L751] int tmp___0 ; [L755] CALL, EXPR isHighWaterSensorDry() [L933] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L936] COND FALSE !(waterLevel < 2) [L940] retValue_acc = 0 [L941] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L755] RET, EXPR isHighWaterSensorDry() [L755] tmp = isHighWaterSensorDry() [L757] COND FALSE !(\read(tmp)) [L760] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L762] retValue_acc = tmp___0 [L763] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L631] RET, EXPR isHighWaterLevel() [L631] tmp = isHighWaterLevel() [L633] COND TRUE \read(tmp) [L635] CALL activatePump() [L680] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L635] RET activatePump() [L670] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L606] RET processEnvironment() [L612] CALL __utac_acc__Specification1_spec__1() [L193] int tmp ; [L194] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L198] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L892] int retValue_acc ; [L895] retValue_acc = methaneLevelCritical [L896] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L198] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L198] tmp = isMethaneLevelCritical() [L200] COND TRUE \read(tmp) [L202] CALL, EXPR isPumpRunning() [L704] int retValue_acc ; [L707] retValue_acc = pumpRunning [L708] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L202] RET, EXPR isPumpRunning() [L202] tmp___0 = isPumpRunning() [L204] COND TRUE \read(tmp___0) [L206] CALL __automaton_fail() [L847] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 83 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 2271 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1553 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 718 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 115 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:38:46,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE