./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product45.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product45.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 603cfb64133b588a2e9c81e31ac984484d295feb0a468539180131e3ac5a47d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:10:49,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:10:49,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:10:49,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:10:49,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:10:49,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:10:49,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:10:49,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:10:49,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:10:49,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:10:49,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:10:49,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:10:49,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:10:49,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:10:49,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:10:49,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:10:49,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:10:49,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:10:49,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:10:49,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:10:49,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:10:49,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:10:49,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:10:49,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:10:49,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:10:49,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:10:49,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:10:49,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:10:49,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:10:49,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:10:49,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:10:49,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:10:49,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:10:49,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:10:49,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:10:49,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:10:49,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:10:49,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:10:49,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:10:49,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:10:49,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:10:49,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:10:49,687 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 -> 603cfb64133b588a2e9c81e31ac984484d295feb0a468539180131e3ac5a47d6 [2024-10-14 03:10:49,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:10:49,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:10:49,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:10:49,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:10:49,999 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:10:50,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product45.cil.c [2024-10-14 03:10:51,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:10:51,758 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:10:51,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product45.cil.c [2024-10-14 03:10:51,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95765353/fa73e9342d1e48f79c5c334e63a17f71/FLAGf9963e45a [2024-10-14 03:10:51,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95765353/fa73e9342d1e48f79c5c334e63a17f71 [2024-10-14 03:10:51,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:10:51,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:10:51,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:10:51,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:10:51,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:10:51,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:10:51" (1/1) ... [2024-10-14 03:10:51,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbec0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:51, skipping insertion in model container [2024-10-14 03:10:51,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:10:51" (1/1) ... [2024-10-14 03:10:51,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:10:52,043 WARN L248 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_product45.cil.c[3064,3077] [2024-10-14 03:10:52,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:10:52,162 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:10:52,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-14 03:10:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2024-10-14 03:10:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [159] [2024-10-14 03:10:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [525] [2024-10-14 03:10:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] [2024-10-14 03:10:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [777] [2024-10-14 03:10:52,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [843] [2024-10-14 03:10:52,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [881] [2024-10-14 03:10:52,183 WARN L248 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_product45.cil.c[3064,3077] [2024-10-14 03:10:52,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:10:52,267 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:10:52,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52 WrapperNode [2024-10-14 03:10:52,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:10:52,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:10:52,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:10:52,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:10:52,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,313 INFO L138 Inliner]: procedures = 56, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 211 [2024-10-14 03:10:52,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:10:52,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:10:52,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:10:52,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:10:52,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,340 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-10-14 03:10:52,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:10:52,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:10:52,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:10:52,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:10:52,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (1/1) ... [2024-10-14 03:10:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:10:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:52,405 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-10-14 03:10:52,409 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-10-14 03:10:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:10:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:10:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:10:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:10:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:10:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:10:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:10:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:10:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:10:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-10-14 03:10:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-10-14 03:10:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-10-14 03:10:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-10-14 03:10:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-10-14 03:10:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-10-14 03:10:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:10:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:10:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:10:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:10:52,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:10:52,557 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:10:52,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:10:52,890 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-14 03:10:52,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:10:52,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:10:52,995 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:10:52,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:52 BoogieIcfgContainer [2024-10-14 03:10:52,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:10:52,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:10:52,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:10:53,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:10:53,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:10:51" (1/3) ... [2024-10-14 03:10:53,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e6245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:10:53, skipping insertion in model container [2024-10-14 03:10:53,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:52" (2/3) ... [2024-10-14 03:10:53,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e6245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:10:53, skipping insertion in model container [2024-10-14 03:10:53,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:52" (3/3) ... [2024-10-14 03:10:53,004 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product45.cil.c [2024-10-14 03:10:53,019 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:10:53,019 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:10:53,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:10:53,101 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;@461c1727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:10:53,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:10:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 61 states have internal predecessors, (80), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 03:10:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 03:10:53,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:53,115 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:53,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash -38034389, now seen corresponding path program 1 times [2024-10-14 03:10:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599024132] [2024-10-14 03:10:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:10:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:53,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:53,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599024132] [2024-10-14 03:10:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599024132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:10:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486162142] [2024-10-14 03:10:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:10:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:10:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:10:53,361 INFO L87 Difference]: Start difference. First operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 61 states have internal predecessors, (80), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-10-14 03:10:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:53,423 INFO L93 Difference]: Finished difference Result 152 states and 217 transitions. [2024-10-14 03:10:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:10:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 22 [2024-10-14 03:10:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:53,435 INFO L225 Difference]: With dead ends: 152 [2024-10-14 03:10:53,437 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 03:10:53,442 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-10-14 03:10:53,446 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:53,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 03:10:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 03:10:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.4) internal successors, (70), 57 states have internal predecessors, (70), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 03:10:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-10-14 03:10:53,501 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 22 [2024-10-14 03:10:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:53,502 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-10-14 03:10:53,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-10-14 03:10:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-10-14 03:10:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:10:53,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:53,507 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:53,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:10:53,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:53,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1633170571, now seen corresponding path program 1 times [2024-10-14 03:10:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698788450] [2024-10-14 03:10:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:10:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:10:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698788450] [2024-10-14 03:10:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698788450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:53,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:53,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:10:53,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760417407] [2024-10-14 03:10:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:53,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:53,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:53,658 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-14 03:10:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:53,708 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2024-10-14 03:10:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2024-10-14 03:10:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:53,710 INFO L225 Difference]: With dead ends: 117 [2024-10-14 03:10:53,710 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:10:53,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-14 03:10:53,714 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:53,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:10:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 03:10:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:10:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2024-10-14 03:10:53,730 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 23 [2024-10-14 03:10:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2024-10-14 03:10:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-14 03:10:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-10-14 03:10:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:10:53,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:53,734 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:10:53,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:10:53,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:53,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash 989570964, now seen corresponding path program 1 times [2024-10-14 03:10:53,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:53,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85329970] [2024-10-14 03:10:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 03:10:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85329970] [2024-10-14 03:10:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85329970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:53,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:10:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535234611] [2024-10-14 03:10:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:53,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:53,874 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10-14 03:10:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:53,913 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2024-10-14 03:10:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 26 [2024-10-14 03:10:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:53,915 INFO L225 Difference]: With dead ends: 126 [2024-10-14 03:10:53,915 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:10:53,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-14 03:10:53,917 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:53,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:10:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 03:10:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4) internal successors, (63), 52 states have internal predecessors, (63), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:10:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-10-14 03:10:53,929 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 26 [2024-10-14 03:10:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:53,932 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-10-14 03:10:53,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10-14 03:10:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-10-14 03:10:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 03:10:53,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:53,934 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:10:53,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:10:53,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:53,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1916189960, now seen corresponding path program 1 times [2024-10-14 03:10:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854545844] [2024-10-14 03:10:53,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:10:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:10:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854545844] [2024-10-14 03:10:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854545844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:54,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:54,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:10:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261711677] [2024-10-14 03:10:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:54,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:54,022 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:10:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:54,096 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2024-10-14 03:10:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-14 03:10:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:54,103 INFO L225 Difference]: With dead ends: 171 [2024-10-14 03:10:54,104 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 03:10:54,105 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-10-14 03:10:54,110 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 68 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:54,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 03:10:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-10-14 03:10:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.355263157894737) internal successors, (103), 84 states have internal predecessors, (103), 16 states have call successors, (16), 14 states have call predecessors, (16), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-14 03:10:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2024-10-14 03:10:54,136 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 33 [2024-10-14 03:10:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:54,136 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2024-10-14 03:10:54,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:10:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2024-10-14 03:10:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 03:10:54,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:54,139 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:10:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:10:54,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1804428860, now seen corresponding path program 1 times [2024-10-14 03:10:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:54,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246705489] [2024-10-14 03:10:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:54,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:10:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:10:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246705489] [2024-10-14 03:10:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246705489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:10:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928402975] [2024-10-14 03:10:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:54,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:10:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:10:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:10:54,310 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 03:10:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:54,539 INFO L93 Difference]: Finished difference Result 236 states and 316 transitions. [2024-10-14 03:10:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:10:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2024-10-14 03:10:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:54,541 INFO L225 Difference]: With dead ends: 236 [2024-10-14 03:10:54,541 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 03:10:54,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:10:54,549 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 115 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:54,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 184 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 03:10:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-10-14 03:10:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 101 states have internal predecessors, (126), 18 states have call successors, (18), 14 states have call predecessors, (18), 17 states have return successors, (25), 19 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-14 03:10:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2024-10-14 03:10:54,612 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 41 [2024-10-14 03:10:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:54,616 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2024-10-14 03:10:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 03:10:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2024-10-14 03:10:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 03:10:54,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:54,618 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:10:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:10:54,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:54,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -496393730, now seen corresponding path program 1 times [2024-10-14 03:10:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333385931] [2024-10-14 03:10:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:10:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:10:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:10:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333385931] [2024-10-14 03:10:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333385931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:10:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695035990] [2024-10-14 03:10:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:54,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:10:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:10:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:54,750 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:10:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:55,016 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2024-10-14 03:10:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:10:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-14 03:10:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:55,018 INFO L225 Difference]: With dead ends: 256 [2024-10-14 03:10:55,018 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 03:10:55,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:10:55,019 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:55,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 272 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 03:10:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2024-10-14 03:10:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 99 states have internal predecessors, (120), 18 states have call successors, (18), 14 states have call predecessors, (18), 17 states have return successors, (25), 19 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-14 03:10:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2024-10-14 03:10:55,047 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 41 [2024-10-14 03:10:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:55,048 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2024-10-14 03:10:55,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:10:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2024-10-14 03:10:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:10:55,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:55,049 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:10:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:10:55,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:55,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1383791686, now seen corresponding path program 1 times [2024-10-14 03:10:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757137125] [2024-10-14 03:10:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:10:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:10:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:55,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757137125] [2024-10-14 03:10:55,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757137125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:10:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295716296] [2024-10-14 03:10:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:55,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:10:55,141 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:10:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:55,269 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2024-10-14 03:10:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:10:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-10-14 03:10:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:55,271 INFO L225 Difference]: With dead ends: 256 [2024-10-14 03:10:55,271 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 03:10:55,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:55,272 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 49 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:55,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 03:10:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-10-14 03:10:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 101 states have internal predecessors, (122), 18 states have call successors, (18), 14 states have call predecessors, (18), 17 states have return successors, (25), 19 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-14 03:10:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2024-10-14 03:10:55,291 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 44 [2024-10-14 03:10:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2024-10-14 03:10:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:10:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2024-10-14 03:10:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:10:55,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:55,295 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:10:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:10:55,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:55,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1055178, now seen corresponding path program 1 times [2024-10-14 03:10:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384590646] [2024-10-14 03:10:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:10:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:10:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:10:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384590646] [2024-10-14 03:10:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384590646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:55,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:10:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669701076] [2024-10-14 03:10:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:10:55,372 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 03:10:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:55,637 INFO L93 Difference]: Finished difference Result 410 states and 562 transitions. [2024-10-14 03:10:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:10:55,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-10-14 03:10:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:55,642 INFO L225 Difference]: With dead ends: 410 [2024-10-14 03:10:55,642 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 03:10:55,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:55,646 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 190 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:55,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 244 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 03:10:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2024-10-14 03:10:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 200 states have (on average 1.3) internal successors, (260), 213 states have internal predecessors, (260), 43 states have call successors, (43), 36 states have call predecessors, (43), 35 states have return successors, (67), 41 states have call predecessors, (67), 43 states have call successors, (67) [2024-10-14 03:10:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 370 transitions. [2024-10-14 03:10:55,682 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 370 transitions. Word has length 44 [2024-10-14 03:10:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 370 transitions. [2024-10-14 03:10:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 03:10:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 370 transitions. [2024-10-14 03:10:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:10:55,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:55,685 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:10:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:10:55,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1884193968, now seen corresponding path program 1 times [2024-10-14 03:10:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668141792] [2024-10-14 03:10:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:10:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 03:10:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 03:10:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668141792] [2024-10-14 03:10:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668141792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:55,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:10:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847512830] [2024-10-14 03:10:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:55,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:10:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:10:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:10:55,875 INFO L87 Difference]: Start difference. First operand 279 states and 370 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 03:10:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:56,298 INFO L93 Difference]: Finished difference Result 595 states and 802 transitions. [2024-10-14 03:10:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:10:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 48 [2024-10-14 03:10:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:56,301 INFO L225 Difference]: With dead ends: 595 [2024-10-14 03:10:56,301 INFO L226 Difference]: Without dead ends: 318 [2024-10-14 03:10:56,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:10:56,304 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 248 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:56,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 268 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:10:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-14 03:10:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-10-14 03:10:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 227 states have (on average 1.277533039647577) internal successors, (290), 244 states have internal predecessors, (290), 48 states have call successors, (48), 36 states have call predecessors, (48), 40 states have return successors, (83), 47 states have call predecessors, (83), 48 states have call successors, (83) [2024-10-14 03:10:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 421 transitions. [2024-10-14 03:10:56,346 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 421 transitions. Word has length 48 [2024-10-14 03:10:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 421 transitions. [2024-10-14 03:10:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 03:10:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 421 transitions. [2024-10-14 03:10:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 03:10:56,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:56,349 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:10:56,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -754437770, now seen corresponding path program 1 times [2024-10-14 03:10:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105701359] [2024-10-14 03:10:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:10:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:10:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:10:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:10:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:10:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:10:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:10:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105701359] [2024-10-14 03:10:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105701359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:10:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056437325] [2024-10-14 03:10:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:10:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:56,566 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-10-14 03:10:56,567 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-10-14 03:10:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:56,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 03:10:56,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:10:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:56,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:10:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:10:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056437325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:10:57,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:10:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-10-14 03:10:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200410306] [2024-10-14 03:10:57,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:10:57,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:10:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:10:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:10:57,038 INFO L87 Difference]: Start difference. First operand 316 states and 421 transitions. Second operand has 15 states, 12 states have (on average 8.5) internal successors, (102), 10 states have internal predecessors, (102), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2024-10-14 03:10:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:58,137 INFO L93 Difference]: Finished difference Result 708 states and 966 transitions. [2024-10-14 03:10:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 03:10:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.5) internal successors, (102), 10 states have internal predecessors, (102), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) Word has length 84 [2024-10-14 03:10:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:58,139 INFO L225 Difference]: With dead ends: 708 [2024-10-14 03:10:58,139 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:10:58,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 190 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 03:10:58,144 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 307 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 807 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:10:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:10:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:10:58,146 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-10-14 03:10:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:10:58,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-10-14 03:10:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:10:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.5) internal successors, (102), 10 states have internal predecessors, (102), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2024-10-14 03:10:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:10:58,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:10:58,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:10:58,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:10:58,354 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-10-14 03:10:58,357 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:58,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:11:01,089 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:11:01,122 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (<= |old(~waterLevel~0)| 2)) (.cse0 (= 1 ~systemActive~0)) (.cse2 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse0 (<= 1 |old(~switchedOnBeforeTS~0)|) .cse1 .cse2) (and .cse0 (= |old(~pumpRunning~0)| 0) .cse1) (and .cse0 .cse2 (= |old(~waterLevel~0)| 2))))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and (= ~pumpRunning~0 0) .cse1 .cse2))) [2024-10-14 03:11:01,133 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse2 (<= |old(~waterLevel~0)| 2)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~switchedOnBeforeTS~0) .cse2) (and (= ~pumpRunning~0 0) .cse1 .cse2) (and .cse0 .cse1 (= |old(~waterLevel~0)| 2)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and (= ~pumpRunning~0 0) .cse1 .cse2))) [2024-10-14 03:11:01,138 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and .cse0 (= |old(~pumpRunning~0)| 0) .cse1) (and .cse0 .cse1 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 ~switchedOnBeforeTS~0)) (and (= ~pumpRunning~0 0) .cse0 .cse1))) [2024-10-14 03:11:01,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:11:01 BoogieIcfgContainer [2024-10-14 03:11:01,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:11:01,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:11:01,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:11:01,150 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:11:01,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:52" (3/4) ... [2024-10-14 03:11:01,153 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 03:11:01,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-14 03:11:01,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-14 03:11:01,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-14 03:11:01,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-14 03:11:01,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-14 03:11:01,159 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-10-14 03:11:01,159 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-10-14 03:11:01,159 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-10-14 03:11:01,169 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-14 03:11:01,169 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 03:11:01,170 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 03:11:01,170 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:11:01,171 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:11:01,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:11:01,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 03:11:01,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:11:01,285 INFO L158 Benchmark]: Toolchain (without parser) took 9490.21ms. Allocated memory was 174.1MB in the beginning and 289.4MB in the end (delta: 115.3MB). Free memory was 115.9MB in the beginning and 158.1MB in the end (delta: -42.2MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,286 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:11:01,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.04ms. Allocated memory is still 174.1MB. Free memory was 115.9MB in the beginning and 95.6MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 174.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,286 INFO L158 Benchmark]: Boogie Preprocessor took 50.79ms. Allocated memory is still 174.1MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,287 INFO L158 Benchmark]: RCFGBuilder took 625.30ms. Allocated memory was 174.1MB in the beginning and 241.2MB in the end (delta: 67.1MB). Free memory was 90.8MB in the beginning and 206.0MB in the end (delta: -115.2MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,287 INFO L158 Benchmark]: TraceAbstraction took 8151.20ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 206.0MB in the beginning and 165.5MB in the end (delta: 40.5MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,287 INFO L158 Benchmark]: Witness Printer took 134.59ms. Allocated memory is still 289.4MB. Free memory was 165.5MB in the beginning and 158.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:11:01,288 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.27ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.04ms. Allocated memory is still 174.1MB. Free memory was 115.9MB in the beginning and 95.6MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 174.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.79ms. Allocated memory is still 174.1MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.30ms. Allocated memory was 174.1MB in the beginning and 241.2MB in the end (delta: 67.1MB). Free memory was 90.8MB in the beginning and 206.0MB in the end (delta: -115.2MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8151.20ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 206.0MB in the beginning and 165.5MB in the end (delta: 40.5MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. * Witness Printer took 134.59ms. Allocated memory is still 289.4MB. Free memory was 165.5MB in the beginning and 158.1MB 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [159] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [525] - GenericResultAtLocation [Line: 575]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] - GenericResultAtLocation [Line: 777]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [777] - GenericResultAtLocation [Line: 843]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [843] - GenericResultAtLocation [Line: 881]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [881] * 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: 155]: 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 9 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1208 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1174 mSDsluCounter, 2395 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1628 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2218 IncrementalHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 767 mSDtfsCounter, 2218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 1100 SizeOfPredicates, 2 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 77/105 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: 789]: Loop Invariant Derived loop invariant: (((((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((1 <= pumpRunning) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 702]: Location Invariant Derived location invariant: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) - InvariantResult [Line: 788]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 610]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) - ProcedureContractResult [Line: 83]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) - ProcedureContractResult [Line: 883]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 583]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((1 < \old(waterLevel)) || (waterLevel < 2)) && (((((pumpRunning == 0) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (\old(pumpRunning) < 1)) || (((pumpRunning == \old(pumpRunning)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(waterLevel) == 2)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (\old(waterLevel) == waterLevel))) || (\old(pumpRunning) != 0)) || (((pumpRunning == 0) && (2 == waterLevel)) && (\old(waterLevel) == 2)))) && ((((1 == systemActive) && (\old(pumpRunning) == 0)) || ((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning)))) || (((1 == systemActive) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2)))) - ProcedureContractResult [Line: 71]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((((2 == waterLevel) || (\old(waterLevel) != 2)) && ((((((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (\old(waterLevel) <= 2)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 2))) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2)))) && (waterLevel <= 2)) - ProcedureContractResult [Line: 618]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((((((1 == systemActive) && (\old(pumpRunning) == 0)) || (((1 == systemActive) && (1 <= switchedOnBeforeTS)) && (1 <= \old(pumpRunning)))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && ((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || (waterLevel < 2))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (1 < waterLevel))) - ProcedureContractResult [Line: 713]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((pumpRunning == \result) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) - ProcedureContractResult [Line: 702]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) Ensures: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) RESULT: Ultimate proved your program to be correct! [2024-10-14 03:11:01,317 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