./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product58.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product58.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 a5df7e7a530538a677becf014bfb990c6b0570c5e1058d85d7e78cec25f53253 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:14:20,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:14:20,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:14:20,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:14:20,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:14:20,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:14:20,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:14:20,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:14:20,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:14:20,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:14:20,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:14:20,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:14:20,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:14:20,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:14:20,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:14:20,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:14:20,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:14:20,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:14:20,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:14:20,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:14:20,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:14:20,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:14:20,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:14:20,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:14:20,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:14:20,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:14:20,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:14:20,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:14:20,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:14:20,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:14:20,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:14:20,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:14:20,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:20,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:14:20,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:14:20,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:14:20,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:14:20,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:14:20,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:14:20,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:14:20,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:14:20,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:14:20,462 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 -> a5df7e7a530538a677becf014bfb990c6b0570c5e1058d85d7e78cec25f53253 [2024-11-08 15:14:20,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:14:20,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:14:20,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:14:20,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:14:20,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:14:20,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product58.cil.c [2024-11-08 15:14:22,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:14:22,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:14:22,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product58.cil.c [2024-11-08 15:14:22,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af66a65c/d3ccc54da0e843578791cc606a8453c3/FLAGdf91a83b0 [2024-11-08 15:14:22,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af66a65c/d3ccc54da0e843578791cc606a8453c3 [2024-11-08 15:14:22,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:14:22,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:14:22,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:22,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:14:22,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:14:22,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:22" (1/1) ... [2024-11-08 15:14:22,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3775ec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:22, skipping insertion in model container [2024-11-08 15:14:22,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:22" (1/1) ... [2024-11-08 15:14:22,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:14:22,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product58.cil.c[19170,19183] [2024-11-08 15:14:22,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:22,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:14:22,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-08 15:14:22,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [160] [2024-11-08 15:14:22,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [526] [2024-11-08 15:14:22,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [596] [2024-11-08 15:14:22,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [824] [2024-11-08 15:14:22,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [864] [2024-11-08 15:14:22,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] [2024-11-08 15:14:22,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [999] [2024-11-08 15:14:22,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product58.cil.c[19170,19183] [2024-11-08 15:14:22,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:23,003 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:14:23,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23 WrapperNode [2024-11-08 15:14:23,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:23,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:23,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:14:23,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:14:23,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,068 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 226 [2024-11-08 15:14:23,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:23,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:14:23,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:14:23,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:14:23,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:14:23,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:14:23,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:14:23,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:14:23,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:14:23,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (1/1) ... [2024-11-08 15:14:23,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:23,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:14:23,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:14:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:14:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:14:23,201 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:14:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:14:23,201 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:14:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:14:23,201 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:14:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:14:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:14:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:14:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:14:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:14:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:14:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:14:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:14:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:14:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:14:23,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:14:23,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:14:23,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:14:23,592 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-08 15:14:23,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:14:23,605 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:14:23,606 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:14:23,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:23 BoogieIcfgContainer [2024-11-08 15:14:23,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:14:23,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:14:23,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:14:23,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:14:23,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:14:22" (1/3) ... [2024-11-08 15:14:23,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3efdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:23, skipping insertion in model container [2024-11-08 15:14:23,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:23" (2/3) ... [2024-11-08 15:14:23,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3efdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:23, skipping insertion in model container [2024-11-08 15:14:23,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:23" (3/3) ... [2024-11-08 15:14:23,619 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product58.cil.c [2024-11-08 15:14:23,632 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:14:23,633 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:14:23,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:14:23,700 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;@2e237e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:14:23,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:14:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 81 states have internal predecessors, (101), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 15:14:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:14:23,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:23,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:23,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:23,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1936540556, now seen corresponding path program 1 times [2024-11-08 15:14:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:23,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618463056] [2024-11-08 15:14:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:14:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618463056] [2024-11-08 15:14:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618463056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:14:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307872243] [2024-11-08 15:14:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:14:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:14:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:24,002 INFO L87 Difference]: Start difference. First operand has 94 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 81 states have internal predecessors, (101), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:24,042 INFO L93 Difference]: Finished difference Result 179 states and 244 transitions. [2024-11-08 15:14:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:14:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-08 15:14:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:24,053 INFO L225 Difference]: With dead ends: 179 [2024-11-08 15:14:24,053 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 15:14:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:24,061 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:24,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 15:14:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 15:14:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 73 states have internal predecessors, (87), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:14:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-11-08 15:14:24,118 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 25 [2024-11-08 15:14:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:24,118 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-11-08 15:14:24,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-11-08 15:14:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 15:14:24,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:24,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:24,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:14:24,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash -433728910, now seen corresponding path program 1 times [2024-11-08 15:14:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233518245] [2024-11-08 15:14:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:14:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233518245] [2024-11-08 15:14:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233518245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777774657] [2024-11-08 15:14:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,274 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:24,298 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2024-11-08 15:14:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-08 15:14:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:24,301 INFO L225 Difference]: With dead ends: 134 [2024-11-08 15:14:24,302 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 15:14:24,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,305 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:24,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 15:14:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 15:14:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 67 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:14:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2024-11-08 15:14:24,317 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 26 [2024-11-08 15:14:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2024-11-08 15:14:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-08 15:14:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 15:14:24,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:24,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:24,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:14:24,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:24,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -960870689, now seen corresponding path program 1 times [2024-11-08 15:14:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812643532] [2024-11-08 15:14:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812643532] [2024-11-08 15:14:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812643532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536015208] [2024-11-08 15:14:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,441 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:24,465 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-11-08 15:14:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-08 15:14:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:24,467 INFO L225 Difference]: With dead ends: 144 [2024-11-08 15:14:24,467 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 15:14:24,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,469 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:24,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 15:14:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 15:14:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 67 states have internal predecessors, (79), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:14:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-08 15:14:24,485 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 31 [2024-11-08 15:14:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:24,486 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-08 15:14:24,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-08 15:14:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:14:24,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:24,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:14:24,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1051649323, now seen corresponding path program 1 times [2024-11-08 15:14:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083531731] [2024-11-08 15:14:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:14:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083531731] [2024-11-08 15:14:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083531731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885050624] [2024-11-08 15:14:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:24,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,609 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:24,664 INFO L93 Difference]: Finished difference Result 189 states and 247 transitions. [2024-11-08 15:14:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:14:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:24,668 INFO L225 Difference]: With dead ends: 189 [2024-11-08 15:14:24,668 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 15:14:24,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:24,670 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:24,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 170 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 15:14:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-11-08 15:14:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 101 states have internal predecessors, (121), 13 states have call successors, (13), 12 states have call predecessors, (13), 12 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-08 15:14:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2024-11-08 15:14:24,691 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 39 [2024-11-08 15:14:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:24,692 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2024-11-08 15:14:24,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2024-11-08 15:14:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:14:24,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:24,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:14:24,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:24,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1776043399, now seen corresponding path program 1 times [2024-11-08 15:14:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528904988] [2024-11-08 15:14:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:14:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528904988] [2024-11-08 15:14:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528904988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477923331] [2024-11-08 15:14:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:24,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:24,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:24,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:24,898 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:14:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:25,065 INFO L93 Difference]: Finished difference Result 258 states and 338 transitions. [2024-11-08 15:14:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-08 15:14:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:25,068 INFO L225 Difference]: With dead ends: 258 [2024-11-08 15:14:25,068 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 15:14:25,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-08 15:14:25,070 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 55 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:25,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 286 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 15:14:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-08 15:14:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 122 states have internal predecessors, (148), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-08 15:14:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-11-08 15:14:25,090 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 47 [2024-11-08 15:14:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-11-08 15:14:25,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:14:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-11-08 15:14:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:14:25,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:25,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:14:25,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1353341573, now seen corresponding path program 1 times [2024-11-08 15:14:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850260417] [2024-11-08 15:14:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:14:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:25,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850260417] [2024-11-08 15:14:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850260417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:25,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:25,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:14:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613762518] [2024-11-08 15:14:25,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:25,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:14:25,244 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:14:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:25,453 INFO L93 Difference]: Finished difference Result 282 states and 362 transitions. [2024-11-08 15:14:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:14:25,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-08 15:14:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:25,457 INFO L225 Difference]: With dead ends: 282 [2024-11-08 15:14:25,457 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 15:14:25,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:14:25,462 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 110 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:25,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 355 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:14:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 15:14:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2024-11-08 15:14:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 120 states have internal predecessors, (142), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-08 15:14:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 179 transitions. [2024-11-08 15:14:25,492 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 179 transitions. Word has length 47 [2024-11-08 15:14:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:25,494 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 179 transitions. [2024-11-08 15:14:25,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:14:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 179 transitions. [2024-11-08 15:14:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:14:25,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:25,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:14:25,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:25,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1275147008, now seen corresponding path program 1 times [2024-11-08 15:14:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360954036] [2024-11-08 15:14:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:14:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:14:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360954036] [2024-11-08 15:14:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360954036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:14:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445512340] [2024-11-08 15:14:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:14:25,629 INFO L87 Difference]: Start difference. First operand 143 states and 179 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:14:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:25,791 INFO L93 Difference]: Finished difference Result 283 states and 363 transitions. [2024-11-08 15:14:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:14:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-08 15:14:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:25,794 INFO L225 Difference]: With dead ends: 283 [2024-11-08 15:14:25,794 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 15:14:25,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:14:25,796 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 56 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:25,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 365 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 15:14:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-08 15:14:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 123 states have internal predecessors, (145), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-08 15:14:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2024-11-08 15:14:25,818 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 53 [2024-11-08 15:14:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:25,819 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2024-11-08 15:14:25,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:14:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2024-11-08 15:14:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:14:25,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:25,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:25,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:14:25,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:25,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2034284420, now seen corresponding path program 1 times [2024-11-08 15:14:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808811064] [2024-11-08 15:14:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:14:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:14:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808811064] [2024-11-08 15:14:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808811064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932011637] [2024-11-08 15:14:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:25,922 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:14:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:26,136 INFO L93 Difference]: Finished difference Result 404 states and 525 transitions. [2024-11-08 15:14:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2024-11-08 15:14:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:26,139 INFO L225 Difference]: With dead ends: 404 [2024-11-08 15:14:26,139 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 15:14:26,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11-08 15:14:26,140 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 191 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:26,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 302 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:14:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 15:14:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-11-08 15:14:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 216 states have internal predecessors, (252), 30 states have call successors, (30), 28 states have call predecessors, (30), 29 states have return successors, (49), 30 states have call predecessors, (49), 30 states have call successors, (49) [2024-11-08 15:14:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 331 transitions. [2024-11-08 15:14:26,166 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 331 transitions. Word has length 53 [2024-11-08 15:14:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:26,168 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 331 transitions. [2024-11-08 15:14:26,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:14:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 331 transitions. [2024-11-08 15:14:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 15:14:26,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:26,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:26,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:14:26,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:26,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1253719722, now seen corresponding path program 1 times [2024-11-08 15:14:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567294056] [2024-11-08 15:14:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:14:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:14:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:26,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567294056] [2024-11-08 15:14:26,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567294056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:26,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233503350] [2024-11-08 15:14:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:26,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:26,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:26,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:26,246 INFO L87 Difference]: Start difference. First operand 264 states and 331 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:14:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:26,559 INFO L93 Difference]: Finished difference Result 549 states and 729 transitions. [2024-11-08 15:14:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:14:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2024-11-08 15:14:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:26,563 INFO L225 Difference]: With dead ends: 549 [2024-11-08 15:14:26,563 INFO L226 Difference]: Without dead ends: 547 [2024-11-08 15:14:26,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:14:26,566 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 307 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:26,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 224 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:14:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-08 15:14:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 490. [2024-11-08 15:14:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 380 states have (on average 1.2421052631578948) internal successors, (472), 405 states have internal predecessors, (472), 57 states have call successors, (57), 43 states have call predecessors, (57), 52 states have return successors, (127), 58 states have call predecessors, (127), 57 states have call successors, (127) [2024-11-08 15:14:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 656 transitions. [2024-11-08 15:14:26,618 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 656 transitions. Word has length 57 [2024-11-08 15:14:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:26,619 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 656 transitions. [2024-11-08 15:14:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:14:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 656 transitions. [2024-11-08 15:14:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:14:26,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:26,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:26,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:14:26,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:26,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 214602906, now seen corresponding path program 1 times [2024-11-08 15:14:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:26,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330040116] [2024-11-08 15:14:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:14:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:14:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:14:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 15:14:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330040116] [2024-11-08 15:14:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330040116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952323809] [2024-11-08 15:14:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:26,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:26,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:14:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:26,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:14:26,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 15:14:27,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:14:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 15:14:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952323809] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:27,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:14:27,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-08 15:14:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653232567] [2024-11-08 15:14:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:14:27,387 INFO L87 Difference]: Start difference. First operand 490 states and 656 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:14:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:27,522 INFO L93 Difference]: Finished difference Result 1380 states and 1909 transitions. [2024-11-08 15:14:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-11-08 15:14:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:27,530 INFO L225 Difference]: With dead ends: 1380 [2024-11-08 15:14:27,531 INFO L226 Difference]: Without dead ends: 898 [2024-11-08 15:14:27,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:14:27,533 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 53 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:27,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 434 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-08 15:14:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 779. [2024-11-08 15:14:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 597 states have (on average 1.2144053601340032) internal successors, (725), 639 states have internal predecessors, (725), 93 states have call successors, (93), 71 states have call predecessors, (93), 88 states have return successors, (199), 96 states have call predecessors, (199), 93 states have call successors, (199) [2024-11-08 15:14:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1017 transitions. [2024-11-08 15:14:27,612 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1017 transitions. Word has length 99 [2024-11-08 15:14:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:27,613 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1017 transitions. [2024-11-08 15:14:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:14:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1017 transitions. [2024-11-08 15:14:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 15:14:27,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:27,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:27,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:14:27,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:14:27,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1715039266, now seen corresponding path program 1 times [2024-11-08 15:14:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:27,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624763149] [2024-11-08 15:14:27,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:14:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:14:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:14:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:14:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:14:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624763149] [2024-11-08 15:14:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624763149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267155589] [2024-11-08 15:14:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:28,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:28,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:28,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:14:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:14:28,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:14:28,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:14:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267155589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:28,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:14:28,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-08 15:14:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155751073] [2024-11-08 15:14:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:28,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:14:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:14:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:14:28,326 INFO L87 Difference]: Start difference. First operand 779 states and 1017 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:14:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:28,462 INFO L93 Difference]: Finished difference Result 1476 states and 1944 transitions. [2024-11-08 15:14:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 103 [2024-11-08 15:14:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:28,468 INFO L225 Difference]: With dead ends: 1476 [2024-11-08 15:14:28,468 INFO L226 Difference]: Without dead ends: 705 [2024-11-08 15:14:28,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:14:28,472 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 60 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:28,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 664 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-08 15:14:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 697. [2024-11-08 15:14:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 535 states have (on average 1.2) internal successors, (642), 571 states have internal predecessors, (642), 85 states have call successors, (85), 65 states have call predecessors, (85), 76 states have return successors, (154), 84 states have call predecessors, (154), 85 states have call successors, (154) [2024-11-08 15:14:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 881 transitions. [2024-11-08 15:14:28,551 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 881 transitions. Word has length 103 [2024-11-08 15:14:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:28,551 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 881 transitions. [2024-11-08 15:14:28,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:14:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 881 transitions. [2024-11-08 15:14:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 15:14:28,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:28,556 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:28,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:14:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:14:28,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:28,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1133837867, now seen corresponding path program 1 times [2024-11-08 15:14:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465545789] [2024-11-08 15:14:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:14:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:14:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:14:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:14:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:14:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 15:14:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 15:14:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 15:14:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465545789] [2024-11-08 15:14:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465545789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206456764] [2024-11-08 15:14:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:29,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:14:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:29,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:14:29,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 82 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:14:29,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:14:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 15:14:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206456764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:14:29,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:14:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 20 [2024-11-08 15:14:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220661598] [2024-11-08 15:14:29,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:14:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:14:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:14:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:14:29,793 INFO L87 Difference]: Start difference. First operand 697 states and 881 transitions. Second operand has 20 states, 20 states have (on average 7.4) internal successors, (148), 17 states have internal predecessors, (148), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-08 15:14:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:31,548 INFO L93 Difference]: Finished difference Result 2184 states and 3353 transitions. [2024-11-08 15:14:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 15:14:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.4) internal successors, (148), 17 states have internal predecessors, (148), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 142 [2024-11-08 15:14:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:31,559 INFO L225 Difference]: With dead ends: 2184 [2024-11-08 15:14:31,560 INFO L226 Difference]: Without dead ends: 1591 [2024-11-08 15:14:31,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 307 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=547, Invalid=1805, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 15:14:31,595 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 670 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:31,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 840 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:14:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-11-08 15:14:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1075. [2024-11-08 15:14:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 822 states have (on average 1.1922141119221412) internal successors, (980), 870 states have internal predecessors, (980), 132 states have call successors, (132), 110 states have call predecessors, (132), 120 states have return successors, (230), 124 states have call predecessors, (230), 132 states have call successors, (230) [2024-11-08 15:14:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1342 transitions. [2024-11-08 15:14:31,685 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1342 transitions. Word has length 142 [2024-11-08 15:14:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:31,685 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1342 transitions. [2024-11-08 15:14:31,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.4) internal successors, (148), 17 states have internal predecessors, (148), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-08 15:14:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1342 transitions. [2024-11-08 15:14:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 15:14:31,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:31,690 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:31,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:14:31,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:31,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash 401870441, now seen corresponding path program 1 times [2024-11-08 15:14:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253812914] [2024-11-08 15:14:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:14:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:14:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:14:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:14:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:14:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:14:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 15:14:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:14:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 15:14:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-08 15:14:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253812914] [2024-11-08 15:14:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253812914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133129118] [2024-11-08 15:14:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:32,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:32,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:32,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:32,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:14:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:32,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:14:32,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 15:14:32,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:14:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133129118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:14:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 10 [2024-11-08 15:14:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375067271] [2024-11-08 15:14:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:14:32,215 INFO L87 Difference]: Start difference. First operand 1075 states and 1342 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 15:14:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:32,295 INFO L93 Difference]: Finished difference Result 1494 states and 1835 transitions. [2024-11-08 15:14:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 142 [2024-11-08 15:14:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:32,298 INFO L225 Difference]: With dead ends: 1494 [2024-11-08 15:14:32,298 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:14:32,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:14:32,304 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:14:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:14:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:14:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:14:32,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2024-11-08 15:14:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:14:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 15:14:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:14:32,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:14:32,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:14:32,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:14:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:32,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:32,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:14:35,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:14:35,753 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= |old(~methaneLevelCritical~0)| 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 |old(~methaneLevelCritical~0)|) .cse3) (and .cse1 .cse2 (<= 2 ~waterLevel~0) .cse3)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse1 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-11-08 15:14:35,767 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (= ~methAndRunningLastTime~0 0) (< ~methaneLevelCritical~0 1)) (= |old(~waterLevel~0)| ~waterLevel~0) (= |old(~methAndRunningLastTime~0)| ~methAndRunningLastTime~0) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse4 (<= 2 |old(~waterLevel~0)|))) (or (and .cse0 (= |old(~methAndRunningLastTime~0)| 0) .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse3 .cse1 .cse4) (and .cse0 .cse1 .cse4)))) Eliminated clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or .cse0 (< ~methaneLevelCritical~0 1)) (let ((.cse5 (<= 1 ~methaneLevelCritical~0)) (.cse2 (<= 2 ~waterLevel~0)) (.cse4 (= ~pumpRunning~0 0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse5 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))))) [2024-11-08 15:14:35,795 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse3 (= ~methAndRunningLastTime~0 0)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= ~waterLevel~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 1 ~systemActive~0)) (.cse5 (= ~waterLevel~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5) (and .cse0 .cse4 .cse3) (and .cse1 .cse2 .cse3 .cse5))) [2024-11-08 15:14:35,808 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse3 (= ~pumpRunning~0 0)) (.cse0 (= ~methAndRunningLastTime~0 0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 (<= 2 |old(~waterLevel~0)|)) (and .cse3 .cse0 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse3 .cse0 .cse1 .cse2))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse1 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-11-08 15:14:35,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:14:35 BoogieIcfgContainer [2024-11-08 15:14:35,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:14:35,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:14:35,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:14:35,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:14:35,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:23" (3/4) ... [2024-11-08 15:14:35,818 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:14:35,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:14:35,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:14:35,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:14:35,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:14:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-08 15:14:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:14:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:14:35,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-08 15:14:35,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:14:35,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:14:35,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:14:35,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:14:35,959 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:14:35,960 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:14:35,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:14:35,961 INFO L158 Benchmark]: Toolchain (without parser) took 13522.71ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 119.1MB in the beginning and 138.9MB in the end (delta: -19.8MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,961 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 74.8MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:14:35,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.19ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 97.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.32ms. Allocated memory is still 157.3MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,962 INFO L158 Benchmark]: Boogie Preprocessor took 45.33ms. Allocated memory is still 157.3MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,962 INFO L158 Benchmark]: RCFGBuilder took 488.45ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 113.2MB in the end (delta: -21.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,962 INFO L158 Benchmark]: TraceAbstraction took 12204.05ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 112.1MB in the beginning and 147.3MB in the end (delta: -35.2MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,963 INFO L158 Benchmark]: Witness Printer took 145.53ms. Allocated memory is still 272.6MB. Free memory was 147.3MB in the beginning and 138.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:14:35,964 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.09ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 74.8MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.19ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 97.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.32ms. Allocated memory is still 157.3MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.33ms. Allocated memory is still 157.3MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.45ms. Allocated memory is still 157.3MB. Free memory was 91.9MB in the beginning and 113.2MB in the end (delta: -21.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12204.05ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 112.1MB in the beginning and 147.3MB in the end (delta: -35.2MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. * Witness Printer took 145.53ms. Allocated memory is still 272.6MB. Free memory was 147.3MB in the beginning and 138.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [160] - GenericResultAtLocation [Line: 526]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [526] - GenericResultAtLocation [Line: 596]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [596] - GenericResultAtLocation [Line: 824]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [824] - GenericResultAtLocation [Line: 864]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [864] - GenericResultAtLocation [Line: 902]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] - GenericResultAtLocation [Line: 999]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [999] * 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: 1004]: 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 8 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1707 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1666 mSDsluCounter, 4395 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3069 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2519 IncrementalHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 1326 mSDtfsCounter, 2519 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 855 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1075occurred in iteration=12, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 710 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1350 NumberOfCodeBlocks, 1350 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1572 ConstructedInterpolants, 0 QuantifiedInterpolants, 2950 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1551 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 632/684 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: 540]: Loop Invariant Derived loop invariant: (((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 539]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 629]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: ((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 84]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (\old(methaneLevelCritical) == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) && ((((((waterLevel == \old(waterLevel)) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 904]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (head == \old(head))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 605]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((methAndRunningLastTime == 0) || (methaneLevelCritical < 1)) && ((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)))) Ensures: (((((((\old(pumpRunning) != 0) || (\old(methAndRunningLastTime) != 0)) || (\old(waterLevel) == waterLevel)) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (\old(waterLevel) <= ((long long) waterLevel + 1))) || (((methAndRunningLastTime == 0) && (2 <= waterLevel)) && (\old(waterLevel) <= ((long long) waterLevel + 1))))) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (\old(waterLevel) <= ((long long) waterLevel + 1))) || (methaneLevelCritical < 1))) && (((((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0)) || (((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (2 <= \old(waterLevel)))) || (((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (\old(pumpRunning) == 0))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel))))) && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (head == \old(head))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 96]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: ((((methaneLevelCritical <= \result) && (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (2 <= waterLevel))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) || ((methaneLevelCritical == 0) && (waterLevel == 0)))) && ((methaneLevelCritical != 0) || ((1 == systemActive) && (\result == 0)))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 637]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: (((((pumpRunning == \old(pumpRunning)) || (waterLevel != 0)) && ((((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (\old(pumpRunning) == 0)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || ((methaneLevelCritical == 0) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0)))) && (((\old(pumpRunning) != 0) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (1 == systemActive)))) && ((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 72]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && ((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (2 <= \old(waterLevel))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)))) && (\old(waterLevel) <= waterLevel)) && ((\old(waterLevel) != 1) || (1 < waterLevel))) && ((((((methaneLevelCritical == \old(methaneLevelCritical)) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:14:35,998 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