./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd97c2884595bd9a9b703dc95e9a5caeaf3b95ed9b6ed8cf435c9ebd351e9142 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:52:09,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:52:09,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:52:09,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:52:09,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:52:09,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:52:09,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:52:09,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:52:09,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:52:09,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:52:09,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:52:09,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:52:09,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:52:09,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:52:09,813 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:52:09,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:52:09,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:52:09,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:09,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:52:09,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:52:09,816 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd97c2884595bd9a9b703dc95e9a5caeaf3b95ed9b6ed8cf435c9ebd351e9142 [2025-02-05 15:52:10,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:52:10,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:52:10,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:52:10,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:52:10,038 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:52:10,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c [2025-02-05 15:52:11,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcb69a2b4/814ddb79c8874f59a018111bc9e8eff1/FLAGe7d1463df [2025-02-05 15:52:11,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:52:11,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c [2025-02-05 15:52:11,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcb69a2b4/814ddb79c8874f59a018111bc9e8eff1/FLAGe7d1463df [2025-02-05 15:52:11,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcb69a2b4/814ddb79c8874f59a018111bc9e8eff1 [2025-02-05 15:52:11,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:52:11,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:52:11,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:11,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:52:11,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:52:11,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11, skipping insertion in model container [2025-02-05 15:52:11,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:52:11,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c[14430,14443] [2025-02-05 15:52:11,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:11,752 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:52:11,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-02-05 15:52:11,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2025-02-05 15:52:11,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [251] [2025-02-05 15:52:11,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [617] [2025-02-05 15:52:11,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [655] [2025-02-05 15:52:11,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [664] [2025-02-05 15:52:11,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [699] [2025-02-05 15:52:11,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [795] [2025-02-05 15:52:11,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c[14430,14443] [2025-02-05 15:52:11,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:11,833 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:52:11,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11 WrapperNode [2025-02-05 15:52:11,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:11,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:11,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:52:11,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:52:11,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,861 INFO L138 Inliner]: procedures = 50, calls = 91, calls flagged for inlining = 19, calls inlined = 16, statements flattened = 143 [2025-02-05 15:52:11,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:11,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:52:11,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:52:11,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:52:11,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:52:11,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:52:11,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:52:11,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:52:11,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:52:11,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (1/1) ... [2025-02-05 15:52:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:11,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:11,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:52:11,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:52:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:52:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:52:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:52:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:52:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:52:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:52:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:52:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:52:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:52:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:52:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:52:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:52:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:52:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:52:11,988 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:52:11,989 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:52:12,021 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: #res := ~retValue_acc~8; [2025-02-05 15:52:12,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:52:12,089 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L872-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; [2025-02-05 15:52:12,089 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L197-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-02-05 15:52:12,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L792-1: main_#res#1 := main_~retValue_acc~7#1; [2025-02-05 15:52:12,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L652-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-02-05 15:52:12,151 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 15:52:12,151 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:52:12,159 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:52:12,159 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:52:12,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:12 BoogieIcfgContainer [2025-02-05 15:52:12,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:52:12,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:52:12,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:52:12,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:52:12,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:52:11" (1/3) ... [2025-02-05 15:52:12,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1a041a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:12, skipping insertion in model container [2025-02-05 15:52:12,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:11" (2/3) ... [2025-02-05 15:52:12,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1a041a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:12, skipping insertion in model container [2025-02-05 15:52:12,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:12" (3/3) ... [2025-02-05 15:52:12,169 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product03.cil.c [2025-02-05 15:52:12,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:52:12,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product03.cil.c that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:52:12,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:52:12,234 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;@4dffdc14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:52:12,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:52:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 56 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:52:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:52:12,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:12,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:12,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -675532542, now seen corresponding path program 1 times [2025-02-05 15:52:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799895430] [2025-02-05 15:52:12,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:12,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:52:12,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:52:12,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:12,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799895430] [2025-02-05 15:52:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799895430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:52:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162225781] [2025-02-05 15:52:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:52:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:12,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:52:12,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:12,435 INFO L87 Difference]: Start difference. First operand has 66 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 56 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:12,456 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2025-02-05 15:52:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:52:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-05 15:52:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:12,461 INFO L225 Difference]: With dead ends: 116 [2025-02-05 15:52:12,462 INFO L226 Difference]: Without dead ends: 58 [2025-02-05 15:52:12,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:12,468 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:12,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-05 15:52:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-05 15:52:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:52:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-02-05 15:52:12,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 25 [2025-02-05 15:52:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-02-05 15:52:12,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-02-05 15:52:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:52:12,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:12,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:12,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:52:12,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:12,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -811760734, now seen corresponding path program 1 times [2025-02-05 15:52:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-02-05 15:52:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:52:12,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:52:12,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:12,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:12,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-02-05 15:52:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335872842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564240806] [2025-02-05 15:52:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:12,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:12,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:12,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:12,629 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:12,637 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2025-02-05 15:52:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:12,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-05 15:52:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:12,638 INFO L225 Difference]: With dead ends: 79 [2025-02-05 15:52:12,638 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 15:52:12,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:12,640 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:12,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 15:52:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-05 15:52:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.325) internal successors, (53), 43 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:52:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-02-05 15:52:12,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2025-02-05 15:52:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:12,650 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-02-05 15:52:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-02-05 15:52:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:52:12,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:12,651 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] [2025-02-05 15:52:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:52:12,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:12,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -448202897, now seen corresponding path program 1 times [2025-02-05 15:52:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428436878] [2025-02-05 15:52:12,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:12,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:52:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:52:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:12,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428436878] [2025-02-05 15:52:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428436878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:52:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192980331] [2025-02-05 15:52:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:52:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:12,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:52:12,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:52:12,823 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:12,948 INFO L93 Difference]: Finished difference Result 172 states and 223 transitions. [2025-02-05 15:52:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:52:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-02-05 15:52:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:12,951 INFO L225 Difference]: With dead ends: 172 [2025-02-05 15:52:12,951 INFO L226 Difference]: Without dead ends: 130 [2025-02-05 15:52:12,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:52:12,952 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:12,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 292 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-05 15:52:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2025-02-05 15:52:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.368421052631579) internal successors, (130), 102 states have internal predecessors, (130), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-05 15:52:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2025-02-05 15:52:12,973 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 29 [2025-02-05 15:52:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:12,973 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2025-02-05 15:52:12,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2025-02-05 15:52:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 15:52:12,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:12,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:52:12,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:12,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1958612933, now seen corresponding path program 1 times [2025-02-05 15:52:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027023992] [2025-02-05 15:52:12,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:12,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:52:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:52:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027023992] [2025-02-05 15:52:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027023992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390150781] [2025-02-05 15:52:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:13,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:13,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:13,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:13,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:13,088 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:13,146 INFO L93 Difference]: Finished difference Result 329 states and 446 transitions. [2025-02-05 15:52:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-05 15:52:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:13,148 INFO L225 Difference]: With dead ends: 329 [2025-02-05 15:52:13,148 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 15:52:13,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:13,149 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:13,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 15:52:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-05 15:52:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 180 states have internal predecessors, (228), 24 states have call successors, (24), 24 states have call predecessors, (24), 21 states have return successors, (30), 21 states have call predecessors, (30), 24 states have call successors, (30) [2025-02-05 15:52:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2025-02-05 15:52:13,177 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 282 transitions. Word has length 30 [2025-02-05 15:52:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:13,177 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 282 transitions. [2025-02-05 15:52:13,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2025-02-05 15:52:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 15:52:13,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:13,178 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] [2025-02-05 15:52:13,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:52:13,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:13,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash -151230814, now seen corresponding path program 1 times [2025-02-05 15:52:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-02-05 15:52:13,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:13,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 15:52:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 15:52:13,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:13,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-02-05 15:52:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813965551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613825524] [2025-02-05 15:52:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:13,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:13,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:13,227 INFO L87 Difference]: Start difference. First operand 216 states and 282 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:13,245 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2025-02-05 15:52:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (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 32 [2025-02-05 15:52:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:13,247 INFO L225 Difference]: With dead ends: 384 [2025-02-05 15:52:13,247 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 15:52:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:13,248 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:13,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 15:52:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-05 15:52:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.2955974842767295) internal successors, (206), 169 states have internal predecessors, (206), 24 states have call successors, (24), 24 states have call predecessors, (24), 21 states have return successors, (26), 21 states have call predecessors, (26), 24 states have call successors, (26) [2025-02-05 15:52:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2025-02-05 15:52:13,263 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 32 [2025-02-05 15:52:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:13,263 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2025-02-05 15:52:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2025-02-05 15:52:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 15:52:13,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:13,264 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] [2025-02-05 15:52:13,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:52:13,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1040144035, now seen corresponding path program 1 times [2025-02-05 15:52:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855934982] [2025-02-05 15:52:13,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:13,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 15:52:13,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:52:13,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:13,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:52:13,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:52:13,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 15:52:13,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:52:13,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:13,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:52:13,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:52:13,305 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:52:13,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:52:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:52:13,312 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 15:52:13,344 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:52:13,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:52:13 BoogieIcfgContainer [2025-02-05 15:52:13,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:52:13,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:52:13,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:52:13,348 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:52:13,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:12" (3/4) ... [2025-02-05 15:52:13,349 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:52:13,389 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-02-05 15:52:13,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:52:13,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:52:13,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:52:13,462 INFO L158 Benchmark]: Toolchain (without parser) took 1969.70ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 110.4MB in the end (delta: -4.6MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2025-02-05 15:52:13,463 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:13,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.93ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 87.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:13,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:13,463 INFO L158 Benchmark]: Boogie Preprocessor took 25.81ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:13,464 INFO L158 Benchmark]: IcfgBuilder took 271.16ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 69.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:13,464 INFO L158 Benchmark]: TraceAbstraction took 1183.54ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 43.8MB in the end (delta: 24.7MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-02-05 15:52:13,464 INFO L158 Benchmark]: Witness Printer took 114.80ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 110.4MB in the end (delta: -66.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-02-05 15:52:13,466 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.93ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 87.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.81ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 271.16ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 69.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1183.54ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 43.8MB in the end (delta: 24.7MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 114.80ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 110.4MB in the end (delta: -66.6MB). Peak memory consumption was 9.1MB. 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 251]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [251] - GenericResultAtLocation [Line: 617]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [617] - GenericResultAtLocation [Line: 655]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [655] - GenericResultAtLocation [Line: 664]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [664] - GenericResultAtLocation [Line: 699]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [699] - GenericResultAtLocation [Line: 795]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [795] * 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: 660]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L129] int pumpRunning = 0; [L130] int systemActive = 1; [L421] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L700] int cleanupTimeShifts = 4; [L796] int waterLevel = 1; [L797] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L773] int retValue_acc ; [L774] int tmp ; [L778] FCALL select_helpers() [L779] FCALL select_features() [L780] CALL, EXPR valid_product() [L647] int retValue_acc ; [L650] retValue_acc = 1 [L651] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L780] RET, EXPR valid_product() [L780] tmp = valid_product() [L782] COND TRUE \read(tmp) [L784] FCALL setup() [L785] CALL runTest() [L767] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L814] COND TRUE waterLevel < 2 [L815] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] CALL timeShift() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L137] COND FALSE !(\read(pumpRunning)) VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L144] COND TRUE \read(systemActive) [L146] FCALL processEnvironment() [L152] CALL __utac_acc__Specification3_spec__1() [L667] int tmp ; [L668] int tmp___0 ; [L669] int tmp___1 ; VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] CALL, EXPR isMethaneLevelCritical() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L835] int retValue_acc ; [L838] retValue_acc = methaneLevelCritical [L839] return (retValue_acc); VAL [\old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] RET, EXPR isMethaneLevelCritical() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] tmp = isMethaneLevelCritical() [L675] COND FALSE !(\read(tmp)) [L679] CALL, EXPR getWaterLevel() [L867] int retValue_acc ; [L870] retValue_acc = waterLevel [L871] return (retValue_acc); VAL [\old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L679] RET, EXPR getWaterLevel() [L679] tmp___0 = getWaterLevel() [L681] COND TRUE tmp___0 == 2 [L683] CALL, EXPR isPumpRunning() [L192] int retValue_acc ; [L195] retValue_acc = pumpRunning [L196] return (retValue_acc); VAL [\old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L683] RET, EXPR isPumpRunning() [L683] tmp___1 = isPumpRunning() [L685] COND FALSE !(\read(tmp___1)) [L689] CALL __automaton_fail() [L660] reach_error() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 304 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-02-05 15:52:13,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE