./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5a4c274bc0fec0eeea8ea2f72c4bc5bbc7aef2fd24f2cf907e22c2c7f3759d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:55:29,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:55:29,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:55:29,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:55:29,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:55:29,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:55:29,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:55:29,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:55:29,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:55:29,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:55:29,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:55:29,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:55:29,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:55:29,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:55:29,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:55:29,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:55:29,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:55:29,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:55:29,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:55:29,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:55:29,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:55:29,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:55:29,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:55:29,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:55:29,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:55:29,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:55:29,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:55:29,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:55:29,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:55:29,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:55:29,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:55:29,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:55:29,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:55:29,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:55:29,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:55:29,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:55:29,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:55:29,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:55:29,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:55:29,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:55:29,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:55:29,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:55:29,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5a4c274bc0fec0eeea8ea2f72c4bc5bbc7aef2fd24f2cf907e22c2c7f3759d4 [2024-11-16 07:55:29,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:55:29,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:55:29,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:55:29,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:55:29,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:55:29,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2024-11-16 07:55:31,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:55:31,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:55:31,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2024-11-16 07:55:31,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36274c153/297417ff0e614a24bf41e14f5c9ac6c5/FLAG513a88c70 [2024-11-16 07:55:32,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36274c153/297417ff0e614a24bf41e14f5c9ac6c5 [2024-11-16 07:55:32,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:55:32,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:55:32,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:55:32,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:55:32,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:55:32,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319cfe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32, skipping insertion in model container [2024-11-16 07:55:32,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:55:32,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18537,18550] [2024-11-16 07:55:32,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:55:32,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:55:32,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-16 07:55:32,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] [2024-11-16 07:55:32,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [521] [2024-11-16 07:55:32,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [589] [2024-11-16 07:55:32,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [786] [2024-11-16 07:55:32,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [881] [2024-11-16 07:55:32,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [931] [2024-11-16 07:55:32,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [966] [2024-11-16 07:55:32,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18537,18550] [2024-11-16 07:55:32,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:55:32,541 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:55:32,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32 WrapperNode [2024-11-16 07:55:32,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:55:32,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:55:32,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:55:32,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:55:32,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,593 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 204 [2024-11-16 07:55:32,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:55:32,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:55:32,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:55:32,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:55:32,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,624 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]. [2024-11-16 07:55:32,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:55:32,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:55:32,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:55:32,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:55:32,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (1/1) ... [2024-11-16 07:55:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:55:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:55:32,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:55:32,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:55:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:55:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:55:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:55:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:55:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:55:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:55:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:55:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:55:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:55:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-16 07:55:32,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-16 07:55:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:55:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:55:32,717 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:55:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:55:32,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:55:32,789 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:55:32,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:55:32,944 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L704-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~4#1; [2024-11-16 07:55:32,944 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L832-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~7#1; [2024-11-16 07:55:32,945 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L878-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-16 07:55:32,945 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L768-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~6#1; [2024-11-16 07:55:32,945 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L864-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~8#1; [2024-11-16 07:55:33,040 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L963-1: valid_product_#res#1 := valid_product_~retValue_acc~11#1; [2024-11-16 07:55:33,041 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L518-1: main_#res#1 := main_~retValue_acc~3#1; [2024-11-16 07:55:33,046 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~5; [2024-11-16 07:55:33,063 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-16 07:55:33,063 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:55:33,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:55:33,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:55:33,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:33 BoogieIcfgContainer [2024-11-16 07:55:33,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:55:33,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:55:33,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:55:33,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:55:33,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:55:32" (1/3) ... [2024-11-16 07:55:33,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e9214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:55:33, skipping insertion in model container [2024-11-16 07:55:33,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:32" (2/3) ... [2024-11-16 07:55:33,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e9214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:55:33, skipping insertion in model container [2024-11-16 07:55:33,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:33" (3/3) ... [2024-11-16 07:55:33,086 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product43.cil.c [2024-11-16 07:55:33,098 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:55:33,098 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:55:33,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:55:33,174 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;@5c3560c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:55:33,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:55:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 82 states have internal predecessors, (102), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 07:55:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 07:55:33,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:33,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:33,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1432191166, now seen corresponding path program 1 times [2024-11-16 07:55:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818922775] [2024-11-16 07:55:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 07:55:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:55:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818922775] [2024-11-16 07:55:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818922775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:33,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:55:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661519154] [2024-11-16 07:55:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:33,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:55:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:55:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:55:33,471 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 82 states have internal predecessors, (102), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:33,499 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2024-11-16 07:55:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:55:33,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-16 07:55:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:33,513 INFO L225 Difference]: With dead ends: 178 [2024-11-16 07:55:33,514 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 07:55:33,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:55:33,522 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:33,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 07:55:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 07:55:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 72 states have internal predecessors, (86), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 07:55:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2024-11-16 07:55:33,574 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 34 [2024-11-16 07:55:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2024-11-16 07:55:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2024-11-16 07:55:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:55:33,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:33,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:33,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:55:33,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:33,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 464118222, now seen corresponding path program 1 times [2024-11-16 07:55:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845972931] [2024-11-16 07:55:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:55:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:55:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845972931] [2024-11-16 07:55:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845972931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:55:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977505506] [2024-11-16 07:55:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:33,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:55:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:55:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:55:33,883 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:34,107 INFO L93 Difference]: Finished difference Result 289 states and 380 transitions. [2024-11-16 07:55:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:55:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 2 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 39 [2024-11-16 07:55:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:34,112 INFO L225 Difference]: With dead ends: 289 [2024-11-16 07:55:34,113 INFO L226 Difference]: Without dead ends: 214 [2024-11-16 07:55:34,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:55:34,118 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 236 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:34,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 432 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:55:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-16 07:55:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 202. [2024-11-16 07:55:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 170 states have internal predecessors, (207), 28 states have call successors, (28), 17 states have call predecessors, (28), 14 states have return successors, (28), 23 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-16 07:55:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 263 transitions. [2024-11-16 07:55:34,156 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 263 transitions. Word has length 39 [2024-11-16 07:55:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:34,156 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 263 transitions. [2024-11-16 07:55:34,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 263 transitions. [2024-11-16 07:55:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 07:55:34,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:34,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:34,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:55:34,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -408164108, now seen corresponding path program 1 times [2024-11-16 07:55:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922126582] [2024-11-16 07:55:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:55:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:55:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 07:55:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922126582] [2024-11-16 07:55:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922126582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:55:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708215468] [2024-11-16 07:55:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:55:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:55:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:34,221 INFO L87 Difference]: Start difference. First operand 202 states and 263 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:55:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:34,239 INFO L93 Difference]: Finished difference Result 302 states and 390 transitions. [2024-11-16 07:55:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:55:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-16 07:55:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:34,241 INFO L225 Difference]: With dead ends: 302 [2024-11-16 07:55:34,242 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 07:55:34,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:34,244 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 158 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 [2024-11-16 07:55:34,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 07:55:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-16 07:55:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 146 states have internal predecessors, (180), 19 states have call successors, (19), 14 states have call predecessors, (19), 14 states have return successors, (20), 17 states have call predecessors, (20), 19 states have call successors, (20) [2024-11-16 07:55:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2024-11-16 07:55:34,273 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 42 [2024-11-16 07:55:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:34,274 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2024-11-16 07:55:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:55:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2024-11-16 07:55:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 07:55:34,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:34,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:34,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:55:34,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:34,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1060349799, now seen corresponding path program 1 times [2024-11-16 07:55:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254050500] [2024-11-16 07:55:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:55:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 07:55:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 07:55:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254050500] [2024-11-16 07:55:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254050500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:55:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221072933] [2024-11-16 07:55:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:55:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:55:34,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:34,418 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:55:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:34,457 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2024-11-16 07:55:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:55:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 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 44 [2024-11-16 07:55:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:34,461 INFO L225 Difference]: With dead ends: 418 [2024-11-16 07:55:34,462 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 07:55:34,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:34,464 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:34,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 152 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 07:55:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-16 07:55:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 200 states have (on average 1.305) internal successors, (261), 215 states have internal predecessors, (261), 29 states have call successors, (29), 24 states have call predecessors, (29), 24 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-11-16 07:55:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 325 transitions. [2024-11-16 07:55:34,507 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 325 transitions. Word has length 44 [2024-11-16 07:55:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 325 transitions. [2024-11-16 07:55:34,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:55:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 325 transitions. [2024-11-16 07:55:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 07:55:34,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:34,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:34,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:55:34,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:34,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1384989398, now seen corresponding path program 1 times [2024-11-16 07:55:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705665742] [2024-11-16 07:55:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:55:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 07:55:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:55:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705665742] [2024-11-16 07:55:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705665742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:55:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010974162] [2024-11-16 07:55:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:55:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:55:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:55:34,664 INFO L87 Difference]: Start difference. First operand 254 states and 325 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:34,766 INFO L93 Difference]: Finished difference Result 497 states and 642 transitions. [2024-11-16 07:55:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:55:34,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-16 07:55:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:34,770 INFO L225 Difference]: With dead ends: 497 [2024-11-16 07:55:34,770 INFO L226 Difference]: Without dead ends: 251 [2024-11-16 07:55:34,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:55:34,775 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 45 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:34,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 378 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:55:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-16 07:55:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-16 07:55:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 212 states have internal predecessors, (252), 29 states have call successors, (29), 24 states have call predecessors, (29), 24 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-11-16 07:55:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 316 transitions. [2024-11-16 07:55:34,798 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 316 transitions. Word has length 43 [2024-11-16 07:55:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:34,799 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 316 transitions. [2024-11-16 07:55:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 316 transitions. [2024-11-16 07:55:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 07:55:34,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:34,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:55:34,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 569541035, now seen corresponding path program 1 times [2024-11-16 07:55:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461695437] [2024-11-16 07:55:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:55:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 07:55:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461695437] [2024-11-16 07:55:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461695437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:55:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862444468] [2024-11-16 07:55:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:34,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:55:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:55:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:55:34,913 INFO L87 Difference]: Start difference. First operand 251 states and 316 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (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) [2024-11-16 07:55:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:34,945 INFO L93 Difference]: Finished difference Result 500 states and 642 transitions. [2024-11-16 07:55:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:55:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (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 52 [2024-11-16 07:55:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:34,948 INFO L225 Difference]: With dead ends: 500 [2024-11-16 07:55:34,949 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 07:55:34,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:55:34,951 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 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 [2024-11-16 07:55:34,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 07:55:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-16 07:55:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.270935960591133) internal successors, (258), 218 states have internal predecessors, (258), 29 states have call successors, (29), 24 states have call predecessors, (29), 24 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-11-16 07:55:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 322 transitions. [2024-11-16 07:55:34,977 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 322 transitions. Word has length 52 [2024-11-16 07:55:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:34,977 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 322 transitions. [2024-11-16 07:55:34,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (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) [2024-11-16 07:55:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2024-11-16 07:55:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 07:55:34,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:34,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:34,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:55:34,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:34,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1468515254, now seen corresponding path program 1 times [2024-11-16 07:55:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357335476] [2024-11-16 07:55:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:55:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 07:55:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357335476] [2024-11-16 07:55:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357335476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:35,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:55:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021215698] [2024-11-16 07:55:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:35,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:55:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:55:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:55:35,102 INFO L87 Difference]: Start difference. First operand 257 states and 322 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2024-11-16 07:55:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:35,140 INFO L93 Difference]: Finished difference Result 510 states and 652 transitions. [2024-11-16 07:55:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:55:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 52 [2024-11-16 07:55:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:35,143 INFO L225 Difference]: With dead ends: 510 [2024-11-16 07:55:35,143 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 07:55:35,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:55:35,145 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 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 [2024-11-16 07:55:35,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 07:55:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-16 07:55:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 207 states have (on average 1.2657004830917875) internal successors, (262), 222 states have internal predecessors, (262), 29 states have call successors, (29), 24 states have call predecessors, (29), 24 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-11-16 07:55:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 326 transitions. [2024-11-16 07:55:35,170 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 326 transitions. Word has length 52 [2024-11-16 07:55:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:35,171 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 326 transitions. [2024-11-16 07:55:35,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2024-11-16 07:55:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 326 transitions. [2024-11-16 07:55:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 07:55:35,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:35,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:55:35,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1602528760, now seen corresponding path program 1 times [2024-11-16 07:55:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807743861] [2024-11-16 07:55:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:55:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 07:55:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807743861] [2024-11-16 07:55:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807743861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:35,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:35,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:55:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998869925] [2024-11-16 07:55:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:35,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:55:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:55:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:35,259 INFO L87 Difference]: Start difference. First operand 261 states and 326 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:35,296 INFO L93 Difference]: Finished difference Result 644 states and 814 transitions. [2024-11-16 07:55:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:55:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 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 52 [2024-11-16 07:55:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:35,300 INFO L225 Difference]: With dead ends: 644 [2024-11-16 07:55:35,301 INFO L226 Difference]: Without dead ends: 391 [2024-11-16 07:55:35,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:35,303 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 164 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 [2024-11-16 07:55:35,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-16 07:55:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-16 07:55:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 309 states have (on average 1.2394822006472492) internal successors, (383), 327 states have internal predecessors, (383), 46 states have call successors, (46), 38 states have call predecessors, (46), 35 states have return successors, (53), 43 states have call predecessors, (53), 46 states have call successors, (53) [2024-11-16 07:55:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 482 transitions. [2024-11-16 07:55:35,331 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 482 transitions. Word has length 52 [2024-11-16 07:55:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 482 transitions. [2024-11-16 07:55:35,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 482 transitions. [2024-11-16 07:55:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 07:55:35,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:35,334 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:55:35,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:35,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2146588278, now seen corresponding path program 1 times [2024-11-16 07:55:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204172275] [2024-11-16 07:55:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:55:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:55:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 07:55:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:55:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204172275] [2024-11-16 07:55:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204172275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:55:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491577967] [2024-11-16 07:55:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:35,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:55:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:55:35,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:55:35,556 INFO L87 Difference]: Start difference. First operand 391 states and 482 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:55:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:35,946 INFO L93 Difference]: Finished difference Result 1229 states and 1590 transitions. [2024-11-16 07:55:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 07:55:35,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2024-11-16 07:55:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:35,953 INFO L225 Difference]: With dead ends: 1229 [2024-11-16 07:55:35,953 INFO L226 Difference]: Without dead ends: 976 [2024-11-16 07:55:35,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:55:35,955 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 290 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:35,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 574 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:55:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-16 07:55:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 964. [2024-11-16 07:55:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 764 states have (on average 1.213350785340314) internal successors, (927), 812 states have internal predecessors, (927), 108 states have call successors, (108), 81 states have call predecessors, (108), 91 states have return successors, (154), 103 states have call predecessors, (154), 108 states have call successors, (154) [2024-11-16 07:55:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1189 transitions. [2024-11-16 07:55:36,035 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1189 transitions. Word has length 56 [2024-11-16 07:55:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1189 transitions. [2024-11-16 07:55:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:55:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1189 transitions. [2024-11-16 07:55:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 07:55:36,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:36,038 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:36,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:55:36,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:36,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash 541913755, now seen corresponding path program 1 times [2024-11-16 07:55:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833046646] [2024-11-16 07:55:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:55:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:55:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:55:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 07:55:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 07:55:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 07:55:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:55:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833046646] [2024-11-16 07:55:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833046646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:55:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553672035] [2024-11-16 07:55:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:55:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:55:36,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:55:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:55:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:36,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:55:36,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:55:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:55:36,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:55:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:55:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553672035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:55:36,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:55:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-16 07:55:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405947041] [2024-11-16 07:55:36,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:55:36,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 07:55:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:36,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 07:55:36,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:55:36,774 INFO L87 Difference]: Start difference. First operand 964 states and 1189 transitions. Second operand has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 11 states have internal predecessors, (109), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-16 07:55:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:37,564 INFO L93 Difference]: Finished difference Result 1666 states and 2109 transitions. [2024-11-16 07:55:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 07:55:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 11 states have internal predecessors, (109), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 88 [2024-11-16 07:55:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:37,566 INFO L225 Difference]: With dead ends: 1666 [2024-11-16 07:55:37,566 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:55:37,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 184 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2024-11-16 07:55:37,573 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 166 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:37,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1399 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 07:55:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:55:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:55:37,575 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) [2024-11-16 07:55:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:55:37,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2024-11-16 07:55:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:37,576 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:55:37,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 11 states have internal predecessors, (109), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-16 07:55:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:55:37,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:55:37,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:55:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:55:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 07:55:37,782 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:55:37,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:55:40,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:55:40,858 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|)) (.cse1 (not (= 0 ~systemActive~0))) (.cse2 (<= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1 (= |old(~waterLevel~0)| 2)) (and (<= 1 |old(~switchedOnBeforeTS~0)|) .cse2 .cse0 .cse1) (and (= |old(~pumpRunning~0)| 0) .cse2))) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0))) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse2 (<= 1 ~switchedOnBeforeTS~0) .cse1) (and (= ~pumpRunning~0 0) .cse2))) [2024-11-16 07:55:40,868 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= |old(~waterLevel~0)| 2)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 (= |old(~waterLevel~0)| 2)) (and (= ~pumpRunning~0 0) .cse2) (and .cse0 (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse1))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0))) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse2 (<= 1 ~switchedOnBeforeTS~0) .cse1) (and (= ~pumpRunning~0 0) .cse2))) [2024-11-16 07:55:40,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:55:40 BoogieIcfgContainer [2024-11-16 07:55:40,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:55:40,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:55:40,879 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:55:40,879 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:55:40,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:33" (3/4) ... [2024-11-16 07:55:40,882 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 07:55:40,887 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-16 07:55:40,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-16 07:55:40,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-16 07:55:40,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-16 07:55:40,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-16 07:55:40,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-16 07:55:40,896 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-11-16 07:55:40,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-16 07:55:40,898 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 07:55:40,898 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:55:40,898 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:55:41,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:55:41,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 07:55:41,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:55:41,008 INFO L158 Benchmark]: Toolchain (without parser) took 8987.01ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 117.9MB in the beginning and 146.5MB in the end (delta: -28.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,008 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:55:41,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.67ms. Allocated memory is still 188.7MB. Free memory was 117.7MB in the beginning and 153.3MB in the end (delta: -35.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.42ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 150.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,009 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 188.7MB. Free memory was 150.6MB in the beginning and 148.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,009 INFO L158 Benchmark]: IcfgBuilder took 437.52ms. Allocated memory is still 188.7MB. Free memory was 148.5MB in the beginning and 128.8MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,010 INFO L158 Benchmark]: TraceAbstraction took 7797.18ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 128.1MB in the beginning and 153.9MB in the end (delta: -25.8MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,010 INFO L158 Benchmark]: Witness Printer took 128.93ms. Allocated memory is still 226.5MB. Free memory was 153.9MB in the beginning and 146.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 07:55:41,011 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.17ms. Allocated memory is still 109.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.67ms. Allocated memory is still 188.7MB. Free memory was 117.7MB in the beginning and 153.3MB in the end (delta: -35.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.42ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 150.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 188.7MB. Free memory was 150.6MB in the beginning and 148.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 437.52ms. Allocated memory is still 188.7MB. Free memory was 148.5MB in the beginning and 128.8MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7797.18ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 128.1MB in the beginning and 153.9MB in the end (delta: -25.8MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Witness Printer took 128.93ms. Allocated memory is still 226.5MB. Free memory was 153.9MB in the beginning and 146.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] - GenericResultAtLocation [Line: 521]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [521] - GenericResultAtLocation [Line: 589]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [589] - GenericResultAtLocation [Line: 786]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [786] - GenericResultAtLocation [Line: 881]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [881] - GenericResultAtLocation [Line: 931]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [931] - GenericResultAtLocation [Line: 966]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [966] * 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: 971]: 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, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 850 mSDsluCounter, 4144 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3113 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1147 IncrementalHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 1031 mSDtfsCounter, 1147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 1313 SizeOfPredicates, 2 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 97/117 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 428]: Location Invariant Derived location invariant: null - InvariantResult [Line: 533]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 629]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive))) Ensures: ((((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive))) && (((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 814]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) Ensures: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 602]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) Ensures: (((((((((1 <= \old(pumpRunning)) && (0 != systemActive)) && (\old(waterLevel) == 2)) || ((((1 <= \old(switchedOnBeforeTS)) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning))) && (0 != systemActive))) || ((\old(pumpRunning) == 0) && (\old(waterLevel) <= 2))) && ((\old(pumpRunning) < 1) || (((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && (((\old(pumpRunning) != 0) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) && (\old(waterLevel) == 2)))) && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 418]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 802]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) Ensures: (((((((((1 <= pumpRunning) && (0 != systemActive)) && (\old(waterLevel) == 2)) || ((pumpRunning == 0) && (\old(waterLevel) <= 2))) || ((((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (\old(waterLevel) <= 2)) && (0 != systemActive))) && ((2 == waterLevel) || (\old(waterLevel) != 2))) && ((2 == waterLevel) || (\old(waterLevel) != 1))) && (waterLevel <= 2)) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 707]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) Ensures: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) && (pumpRunning == \result)) && (((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 07:55:41,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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