./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product34.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 750fa47004e8b71818a419cd0705c167dc764081be79a2bed3ff642b9979f0ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:01:19,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:01:19,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:01:19,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:01:19,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:01:19,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:01:19,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:01:19,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:01:19,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:01:19,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:01:19,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:01:19,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:01:19,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:01:19,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:01:19,564 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:01:19,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:01:19,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:01:19,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:01:19,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:01:19,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:19,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:19,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:19,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:01:19,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:19,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:19,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:19,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:19,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:01:19,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:01:19,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:01:19,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:01:19,569 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 -> 750fa47004e8b71818a419cd0705c167dc764081be79a2bed3ff642b9979f0ab [2025-01-09 04:01:19,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:01:19,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:01:19,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:01:19,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:01:19,865 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:01:19,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2025-01-09 04:01:21,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723feddf8/7e0b79ce82ea4b9fa371807464aa7f20/FLAG783922327 [2025-01-09 04:01:21,464 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:01:21,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2025-01-09 04:01:21,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723feddf8/7e0b79ce82ea4b9fa371807464aa7f20/FLAG783922327 [2025-01-09 04:01:21,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723feddf8/7e0b79ce82ea4b9fa371807464aa7f20 [2025-01-09 04:01:21,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:01:21,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:01:21,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:21,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:01:21,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:01:21,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f8c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21, skipping insertion in model container [2025-01-09 04:01:21,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:01:21,700 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_product34.cil.c[16171,16184] [2025-01-09 04:01:21,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:21,714 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:01:21,719 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-01-09 04:01:21,720 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [121] [2025-01-09 04:01:21,720 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] [2025-01-09 04:01:21,720 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [389] [2025-01-09 04:01:21,721 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [755] [2025-01-09 04:01:21,721 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [791] [2025-01-09 04:01:21,721 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] [2025-01-09 04:01:21,721 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [894] [2025-01-09 04:01:21,764 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_product34.cil.c[16171,16184] [2025-01-09 04:01:21,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:21,782 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:01:21,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21 WrapperNode [2025-01-09 04:01:21,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:21,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:21,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:01:21,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:01:21,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,815 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 176 [2025-01-09 04:01:21,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:21,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:01:21,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:01:21,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:01:21,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:01:21,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:01:21,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:01:21,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:01:21,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:01:21,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (1/1) ... [2025-01-09 04:01:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:01:21,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:01:21,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:01:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:01:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:01:21,908 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:01:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:01:21,908 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:01:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:01:21,908 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:01:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:01:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:01:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:01:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:01:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:01:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:01:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:01:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:01:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:01:21,969 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:01:21,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:01:22,233 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-01-09 04:01:22,234 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:01:22,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:01:22,245 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:01:22,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:22 BoogieIcfgContainer [2025-01-09 04:01:22,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:01:22,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:01:22,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:01:22,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:01:22,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:21" (1/3) ... [2025-01-09 04:01:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab873b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:22, skipping insertion in model container [2025-01-09 04:01:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:21" (2/3) ... [2025-01-09 04:01:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab873b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:22, skipping insertion in model container [2025-01-09 04:01:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:22" (3/3) ... [2025-01-09 04:01:22,254 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product34.cil.c [2025-01-09 04:01:22,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:01:22,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product34.cil.c that has 7 procedures, 75 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:01:22,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:01:22,350 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;@2ba8c963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:01:22,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:01:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 64 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:01:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:01:22,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:22,368 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-01-09 04:01:22,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 295532647, now seen corresponding path program 1 times [2025-01-09 04:01:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183491935] [2025-01-09 04:01:22,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:01:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:01:22,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:22,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:22,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183491935] [2025-01-09 04:01:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183491935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159548294] [2025-01-09 04:01:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:22,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:22,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:22,698 INFO L87 Difference]: Start difference. First operand has 75 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 64 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-09 04:01:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:22,735 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2025-01-09 04:01:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:22,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-09 04:01:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:22,746 INFO L225 Difference]: With dead ends: 130 [2025-01-09 04:01:22,746 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 04:01:22,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:22,755 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:22,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 04:01:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 04:01:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 51 states have internal predecessors, (62), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:01:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2025-01-09 04:01:22,791 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 25 [2025-01-09 04:01:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2025-01-09 04:01:22,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-09 04:01:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2025-01-09 04:01:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 04:01:22,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:22,794 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-01-09 04:01:22,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:01:22,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 234036891, now seen corresponding path program 1 times [2025-01-09 04:01:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754377523] [2025-01-09 04:01:22,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:22,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 04:01:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:01:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754377523] [2025-01-09 04:01:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754377523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:01:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837693534] [2025-01-09 04:01:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:01:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:22,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:01:22,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:01:22,984 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:23,086 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2025-01-09 04:01:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-09 04:01:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:23,089 INFO L225 Difference]: With dead ends: 109 [2025-01-09 04:01:23,089 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 04:01:23,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:01:23,090 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:23,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 180 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:01:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 04:01:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 04:01:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.326086956521739) internal successors, (61), 51 states have internal predecessors, (61), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:01:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-01-09 04:01:23,107 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 30 [2025-01-09 04:01:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:23,107 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-01-09 04:01:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-01-09 04:01:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 04:01:23,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,110 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] [2025-01-09 04:01:23,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:01:23,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 316320934, now seen corresponding path program 1 times [2025-01-09 04:01:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763198275] [2025-01-09 04:01:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:23,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 04:01:23,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 04:01:23,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:23,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763198275] [2025-01-09 04:01:23,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763198275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:23,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:23,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399938572] [2025-01-09 04:01:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:23,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:23,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:23,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:23,212 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:01:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:23,247 INFO L93 Difference]: Finished difference Result 149 states and 192 transitions. [2025-01-09 04:01:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-01-09 04:01:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:23,248 INFO L225 Difference]: With dead ends: 149 [2025-01-09 04:01:23,248 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 04:01:23,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:23,250 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 62 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:23,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 04:01:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-01-09 04:01:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 81 states have internal predecessors, (99), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 04:01:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2025-01-09 04:01:23,278 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 35 [2025-01-09 04:01:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2025-01-09 04:01:23,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:01:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2025-01-09 04:01:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:01:23,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,283 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] [2025-01-09 04:01:23,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:01:23,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -72768961, now seen corresponding path program 1 times [2025-01-09 04:01:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605461710] [2025-01-09 04:01:23,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:23,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:01:23,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:01:23,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:23,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605461710] [2025-01-09 04:01:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605461710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699920456] [2025-01-09 04:01:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:23,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:23,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:23,425 INFO L87 Difference]: Start difference. First operand 96 states and 121 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:23,467 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2025-01-09 04:01:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:23,471 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, (2), 1 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 39 [2025-01-09 04:01:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:23,472 INFO L225 Difference]: With dead ends: 188 [2025-01-09 04:01:23,472 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 04:01:23,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:23,474 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:23,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 04:01:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 04:01:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 84 states have internal predecessors, (102), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 04:01:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-01-09 04:01:23,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 39 [2025-01-09 04:01:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-01-09 04:01:23,493 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-01-09 04:01:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:01:23,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,494 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] [2025-01-09 04:01:23,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:01:23,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2066913667, now seen corresponding path program 1 times [2025-01-09 04:01:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612408244] [2025-01-09 04:01:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:01:23,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:01:23,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:23,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612408244] [2025-01-09 04:01:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612408244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:23,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:01:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460269977] [2025-01-09 04:01:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:23,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:01:23,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:23,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:01:23,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:01:23,624 INFO L87 Difference]: Start difference. First operand 99 states and 124 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:23,676 INFO L93 Difference]: Finished difference Result 193 states and 248 transitions. [2025-01-09 04:01:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:01:23,677 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, (2), 1 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 39 [2025-01-09 04:01:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:23,679 INFO L225 Difference]: With dead ends: 193 [2025-01-09 04:01:23,680 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 04:01:23,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:01:23,682 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 04:01:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 04:01:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 86 states have internal predecessors, (104), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 04:01:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2025-01-09 04:01:23,701 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 39 [2025-01-09 04:01:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:23,702 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2025-01-09 04:01:23,702 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2025-01-09 04:01:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:01:23,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,704 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] [2025-01-09 04:01:23,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:01:23,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1410405179, now seen corresponding path program 1 times [2025-01-09 04:01:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546711813] [2025-01-09 04:01:23,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:23,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:01:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:01:23,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:23,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546711813] [2025-01-09 04:01:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546711813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:23,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526606390] [2025-01-09 04:01:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:23,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:23,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:23,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:23,805 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-09 04:01:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:23,836 INFO L93 Difference]: Finished difference Result 240 states and 303 transitions. [2025-01-09 04:01:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 39 [2025-01-09 04:01:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:23,838 INFO L225 Difference]: With dead ends: 240 [2025-01-09 04:01:23,838 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 04:01:23,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:23,840 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:23,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 129 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 04:01:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-01-09 04:01:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.280701754385965) internal successors, (146), 121 states have internal predecessors, (146), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2025-01-09 04:01:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2025-01-09 04:01:23,865 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 39 [2025-01-09 04:01:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:23,866 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2025-01-09 04:01:23,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-09 04:01:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2025-01-09 04:01:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:01:23,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,869 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-01-09 04:01:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:01:23,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1906183966, now seen corresponding path program 1 times [2025-01-09 04:01:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456271921] [2025-01-09 04:01:23,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:23,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:01:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:01:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456271921] [2025-01-09 04:01:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456271921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088837616] [2025-01-09 04:01:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,014 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:01:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,066 INFO L93 Difference]: Finished difference Result 279 states and 347 transitions. [2025-01-09 04:01:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,067 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-01-09 04:01:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,068 INFO L225 Difference]: With dead ends: 279 [2025-01-09 04:01:24,068 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 04:01:24,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:24,069 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 260 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 04:01:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-09 04:01:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 119 states have internal predecessors, (142), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2025-01-09 04:01:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2025-01-09 04:01:24,084 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 41 [2025-01-09 04:01:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2025-01-09 04:01:24,085 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:01:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2025-01-09 04:01:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:01:24,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,086 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-01-09 04:01:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:01:24,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -370603679, now seen corresponding path program 1 times [2025-01-09 04:01:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868592578] [2025-01-09 04:01:24,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:01:24,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:01:24,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868592578] [2025-01-09 04:01:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868592578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57739869] [2025-01-09 04:01:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,187 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,239 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2025-01-09 04:01:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-09 04:01:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,241 INFO L225 Difference]: With dead ends: 236 [2025-01-09 04:01:24,241 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 04:01:24,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:24,242 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 44 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 379 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 04:01:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-01-09 04:01:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 81 states have internal predecessors, (94), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 04:01:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-01-09 04:01:24,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 43 [2025-01-09 04:01:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-01-09 04:01:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-01-09 04:01:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:01:24,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,253 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-01-09 04:01:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:01:24,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash -246344764, now seen corresponding path program 1 times [2025-01-09 04:01:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465766435] [2025-01-09 04:01:24,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:01:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:01:24,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465766435] [2025-01-09 04:01:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465766435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721927723] [2025-01-09 04:01:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,328 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,387 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2025-01-09 04:01:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-01-09 04:01:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,388 INFO L225 Difference]: With dead ends: 189 [2025-01-09 04:01:24,389 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 04:01:24,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:24,390 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 04:01:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-09 04:01:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 116 states have internal predecessors, (136), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2025-01-09 04:01:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2025-01-09 04:01:24,407 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 45 [2025-01-09 04:01:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,407 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2025-01-09 04:01:24,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2025-01-09 04:01:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:01:24,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,409 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-01-09 04:01:24,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:01:24,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -27490046, now seen corresponding path program 1 times [2025-01-09 04:01:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680483293] [2025-01-09 04:01:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:01:24,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:01:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680483293] [2025-01-09 04:01:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680483293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:01:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108201649] [2025-01-09 04:01:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:01:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:01:24,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:24,467 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,491 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2025-01-09 04:01:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:01:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-01-09 04:01:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,494 INFO L225 Difference]: With dead ends: 232 [2025-01-09 04:01:24,494 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 04:01:24,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:24,495 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 04:01:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-09 04:01:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 116 states have internal predecessors, (134), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2025-01-09 04:01:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 166 transitions. [2025-01-09 04:01:24,514 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 166 transitions. Word has length 45 [2025-01-09 04:01:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 166 transitions. [2025-01-09 04:01:24,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 166 transitions. [2025-01-09 04:01:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:01:24,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,516 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-01-09 04:01:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:01:24,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -845138496, now seen corresponding path program 1 times [2025-01-09 04:01:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814906004] [2025-01-09 04:01:24,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:01:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:01:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814906004] [2025-01-09 04:01:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814906004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998969636] [2025-01-09 04:01:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,612 INFO L87 Difference]: Start difference. First operand 140 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,640 INFO L93 Difference]: Finished difference Result 210 states and 252 transitions. [2025-01-09 04:01:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-01-09 04:01:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,641 INFO L225 Difference]: With dead ends: 210 [2025-01-09 04:01:24,642 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:01:24,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,642 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:01:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:01:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:01:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:01:24,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-01-09 04:01:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,644 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:01:24,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:01:24,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:01:24,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:01:24,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:01:24,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:24,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:01:25,581 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:01:25,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:25 BoogieIcfgContainer [2025-01-09 04:01:25,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:01:25,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:01:25,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:01:25,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:01:25,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:22" (3/4) ... [2025-01-09 04:01:25,600 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:01:25,605 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:01:25,606 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:01:25,606 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:01:25,606 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:01:25,606 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:01:25,606 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:01:25,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 04:01:25,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:01:25,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:01:25,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:25,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:25,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:01:25,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:01:25,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:01:25,703 INFO L158 Benchmark]: Toolchain (without parser) took 4197.95ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 64.3MB in the end (delta: 58.0MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,704 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:25,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.27ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 103.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.79ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:25,706 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 100.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,706 INFO L158 Benchmark]: RCFGBuilder took 404.28ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 84.4MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,706 INFO L158 Benchmark]: TraceAbstraction took 3348.59ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 72.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,706 INFO L158 Benchmark]: Witness Printer took 104.52ms. Allocated memory is still 167.8MB. Free memory was 72.5MB in the beginning and 64.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:25,708 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.39ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.27ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 103.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.79ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 100.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 404.28ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 84.4MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3348.59ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 72.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 104.52ms. Allocated memory is still 167.8MB. Free memory was 72.5MB in the beginning and 64.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [121] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] - GenericResultAtLocation [Line: 389]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [389] - GenericResultAtLocation [Line: 755]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [755] - GenericResultAtLocation [Line: 791]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [791] - GenericResultAtLocation [Line: 800]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] - GenericResultAtLocation [Line: 894]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [894] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 796]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 2472 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1668 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 804 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((pumpRunning == 0) && (2 != waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((1 == systemActive) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 113]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:01:25,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE