./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ca9ad45e9cd0fa7cfc478092837003ff1c91f26680d4fb1c37c440560090c9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:58:33,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:58:33,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:58:33,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:58:33,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:58:33,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:58:33,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:58:33,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:58:33,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:58:33,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:58:33,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:58:33,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:58:33,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:58:33,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:58:33,353 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:58:33,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:58:33,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:58:33,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:58:33,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:58:33,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:58:33,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:58:33,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:58:33,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:58:33,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:58:33,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:58:33,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:58:33,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:33,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:58:33,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:58:33,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:58:33,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:58:33,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:58:33,366 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-clean/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-clean/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 -> ca9ad45e9cd0fa7cfc478092837003ff1c91f26680d4fb1c37c440560090c9e6 [2024-10-11 02:58:33,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:58:33,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:58:33,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:58:33,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:58:33,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:58:33,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c [2024-10-11 02:58:35,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:58:35,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:58:35,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c [2024-10-11 02:58:35,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43f5585b0/957881cf224b456d80671b85615f69a1/FLAG01ca245ab [2024-10-11 02:58:35,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43f5585b0/957881cf224b456d80671b85615f69a1 [2024-10-11 02:58:35,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:58:35,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:58:35,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:35,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:58:35,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:58:35,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:35" (1/1) ... [2024-10-11 02:58:35,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1633a8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:35, skipping insertion in model container [2024-10-11 02:58:35,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:35" (1/1) ... [2024-10-11 02:58:35,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:58:35,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c[1605,1618] [2024-10-11 02:58:36,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:36,131 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:58:36,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-11 02:58:36,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [58] [2024-10-11 02:58:36,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [99] [2024-10-11 02:58:36,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [137] [2024-10-11 02:58:36,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [331] [2024-10-11 02:58:36,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [401] [2024-10-11 02:58:36,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [498] [2024-10-11 02:58:36,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [593] [2024-10-11 02:58:36,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c[1605,1618] [2024-10-11 02:58:36,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:36,308 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:58:36,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36 WrapperNode [2024-10-11 02:58:36,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:36,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:36,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:58:36,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:58:36,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,390 INFO L138 Inliner]: procedures = 55, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 197 [2024-10-11 02:58:36,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:36,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:58:36,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:58:36,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:58:36,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,444 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 02:58:36,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:58:36,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:58:36,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:58:36,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:58:36,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (1/1) ... [2024-10-11 02:58:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:36,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:58:36,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:58:36,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:58:36,575 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:58:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:58:36,576 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:58:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:58:36,576 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:58:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:58:36,576 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:58:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:58:36,576 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:36,576 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:58:36,577 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:58:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:58:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:58:36,577 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:58:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:58:36,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:58:36,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:58:36,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:58:36,832 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-11 02:58:36,833 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:58:36,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:58:36,880 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:58:36,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:36 BoogieIcfgContainer [2024-10-11 02:58:36,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:58:36,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:58:36,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:58:36,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:58:36,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:58:35" (1/3) ... [2024-10-11 02:58:36,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e4de84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:36, skipping insertion in model container [2024-10-11 02:58:36,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:36" (2/3) ... [2024-10-11 02:58:36,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e4de84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:36, skipping insertion in model container [2024-10-11 02:58:36,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:36" (3/3) ... [2024-10-11 02:58:36,888 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product38.cil.c [2024-10-11 02:58:36,902 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:58:36,903 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:58:36,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:58:36,957 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;@744a9135, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:58:36,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:58:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.553191489361702) internal successors, (73), 55 states have internal predecessors, (73), 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-10-11 02:58:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:58:36,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:36,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:36,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -485112533, now seen corresponding path program 1 times [2024-10-11 02:58:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894786485] [2024-10-11 02:58:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:58:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:37,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894786485] [2024-10-11 02:58:37,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894786485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:37,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:58:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347588000] [2024-10-11 02:58:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:58:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:37,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:58:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:37,225 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.553191489361702) internal successors, (73), 55 states have internal predecessors, (73), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-11 02:58:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:37,308 INFO L93 Difference]: Finished difference Result 134 states and 195 transitions. [2024-10-11 02:58:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:58:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2024-10-11 02:58:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:37,325 INFO L225 Difference]: With dead ends: 134 [2024-10-11 02:58:37,326 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 02:58:37,332 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-10-11 02:58:37,339 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:37,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 02:58:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 02:58:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 51 states have internal predecessors, (63), 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-10-11 02:58:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-10-11 02:58:37,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 17 [2024-10-11 02:58:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:37,387 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-10-11 02:58:37,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-11 02:58:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-10-11 02:58:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:58:37,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:37,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:58:37,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 62804686, now seen corresponding path program 1 times [2024-10-11 02:58:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612068514] [2024-10-11 02:58:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:58:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:37,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612068514] [2024-10-11 02:58:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612068514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075236235] [2024-10-11 02:58:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:37,464 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 02:58:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:37,502 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-10-11 02:58:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2024-10-11 02:58:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:37,505 INFO L225 Difference]: With dead ends: 99 [2024-10-11 02:58:37,506 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:58:37,506 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-10-11 02:58:37,507 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:37,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:58:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:58:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 46 states have internal predecessors, (57), 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-10-11 02:58:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-11 02:58:37,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 18 [2024-10-11 02:58:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:37,516 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-11 02:58:37,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 02:58:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-11 02:58:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 02:58:37,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:37,520 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] [2024-10-11 02:58:37,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:58:37,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:37,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:37,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1754293312, now seen corresponding path program 1 times [2024-10-11 02:58:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856350974] [2024-10-11 02:58:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:37,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:37,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856350974] [2024-10-11 02:58:37,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856350974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:37,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657882706] [2024-10-11 02:58:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:37,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:37,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:37,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:37,583 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 02:58:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:37,618 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2024-10-11 02:58:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2024-10-11 02:58:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:37,619 INFO L225 Difference]: With dead ends: 108 [2024-10-11 02:58:37,620 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:58:37,620 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-10-11 02:58:37,621 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:37,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 62 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:58:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:58:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.435897435897436) internal successors, (56), 46 states have internal predecessors, (56), 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-10-11 02:58:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-11 02:58:37,627 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 21 [2024-10-11 02:58:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:37,628 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-11 02:58:37,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 02:58:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-11 02:58:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 02:58:37,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:37,629 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:37,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:58:37,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:37,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash 472757893, now seen corresponding path program 1 times [2024-10-11 02:58:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953598323] [2024-10-11 02:58:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:58:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953598323] [2024-10-11 02:58:37,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953598323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:37,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570742866] [2024-10-11 02:58:37,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:37,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:37,667 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:58:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:37,717 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2024-10-11 02:58:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:37,717 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 02:58:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:37,719 INFO L225 Difference]: With dead ends: 147 [2024-10-11 02:58:37,719 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 02:58:37,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:37,721 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:37,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 02:58:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-11 02:58:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.393939393939394) internal successors, (92), 73 states have internal predecessors, (92), 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-10-11 02:58:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-11 02:58:37,737 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 28 [2024-10-11 02:58:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:37,737 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-11 02:58:37,738 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:58:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2024-10-11 02:58:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:37,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:37,739 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] [2024-10-11 02:58:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:58:37,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -846459975, now seen corresponding path program 1 times [2024-10-11 02:58:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410111061] [2024-10-11 02:58:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:37,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410111061] [2024-10-11 02:58:37,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410111061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:37,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:37,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059680405] [2024-10-11 02:58:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:37,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:37,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:37,834 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:37,992 INFO L93 Difference]: Finished difference Result 206 states and 278 transitions. [2024-10-11 02:58:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:37,994 INFO L225 Difference]: With dead ends: 206 [2024-10-11 02:58:37,996 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 02:58:37,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:37,998 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:38,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 183 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 02:58:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-10-11 02:58:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 90 states have internal predecessors, (115), 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-10-11 02:58:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-10-11 02:58:38,028 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 33 [2024-10-11 02:58:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:38,028 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-10-11 02:58:38,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-10-11 02:58:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:38,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:38,029 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] [2024-10-11 02:58:38,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:58:38,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:38,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2126323653, now seen corresponding path program 1 times [2024-10-11 02:58:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:38,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581092158] [2024-10-11 02:58:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581092158] [2024-10-11 02:58:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581092158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:38,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:38,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097716564] [2024-10-11 02:58:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:38,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:38,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:38,222 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:38,373 INFO L93 Difference]: Finished difference Result 230 states and 314 transitions. [2024-10-11 02:58:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:38,377 INFO L225 Difference]: With dead ends: 230 [2024-10-11 02:58:38,377 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 02:58:38,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:38,379 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:38,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 02:58:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-11 02:58:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 92 states have internal predecessors, (117), 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-10-11 02:58:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-10-11 02:58:38,403 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 33 [2024-10-11 02:58:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:38,403 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-10-11 02:58:38,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-10-11 02:58:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:38,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:38,405 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] [2024-10-11 02:58:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:58:38,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 580295741, now seen corresponding path program 1 times [2024-10-11 02:58:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935250585] [2024-10-11 02:58:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935250585] [2024-10-11 02:58:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935250585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041426134] [2024-10-11 02:58:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:38,491 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:38,928 INFO L93 Difference]: Finished difference Result 343 states and 469 transitions. [2024-10-11 02:58:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:38,930 INFO L225 Difference]: With dead ends: 343 [2024-10-11 02:58:38,931 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 02:58:38,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:38,932 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 177 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:38,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:58:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 02:58:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2024-10-11 02:58:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 161 states have (on average 1.3354037267080745) internal successors, (215), 172 states have internal predecessors, (215), 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-10-11 02:58:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 294 transitions. [2024-10-11 02:58:39,001 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 294 transitions. Word has length 33 [2024-10-11 02:58:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 294 transitions. [2024-10-11 02:58:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 294 transitions. [2024-10-11 02:58:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 02:58:39,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:39,008 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] [2024-10-11 02:58:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:58:39,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 630468687, now seen corresponding path program 1 times [2024-10-11 02:58:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706936091] [2024-10-11 02:58:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:58:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706936091] [2024-10-11 02:58:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706936091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:39,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205773518] [2024-10-11 02:58:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:39,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:39,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:39,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:39,069 INFO L87 Difference]: Start difference. First operand 221 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:39,202 INFO L93 Difference]: Finished difference Result 438 states and 589 transitions. [2024-10-11 02:58:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 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 36 [2024-10-11 02:58:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:39,205 INFO L225 Difference]: With dead ends: 438 [2024-10-11 02:58:39,205 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 02:58:39,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:39,206 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 97 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:39,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 151 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 02:58:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-10-11 02:58:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 168 states have internal predecessors, (203), 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-10-11 02:58:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2024-10-11 02:58:39,223 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 36 [2024-10-11 02:58:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:39,223 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2024-10-11 02:58:39,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2024-10-11 02:58:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:58:39,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:39,224 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] [2024-10-11 02:58:39,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:58:39,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1523614121, now seen corresponding path program 1 times [2024-10-11 02:58:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449128121] [2024-10-11 02:58:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:58:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449128121] [2024-10-11 02:58:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449128121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812215795] [2024-10-11 02:58:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:39,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:39,271 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:39,518 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2024-10-11 02:58:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:58:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-11 02:58:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:39,522 INFO L225 Difference]: With dead ends: 451 [2024-10-11 02:58:39,524 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 02:58:39,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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-10-11 02:58:39,525 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 224 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:39,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 130 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:58:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 02:58:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 395. [2024-10-11 02:58:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 286 states have (on average 1.3006993006993006) internal successors, (372), 309 states have internal predecessors, (372), 57 states have call successors, (57), 42 states have call predecessors, (57), 51 states have return successors, (127), 58 states have call predecessors, (127), 57 states have call successors, (127) [2024-10-11 02:58:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 556 transitions. [2024-10-11 02:58:39,603 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 556 transitions. Word has length 37 [2024-10-11 02:58:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 556 transitions. [2024-10-11 02:58:39,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 556 transitions. [2024-10-11 02:58:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:58:39,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:39,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2024-10-11 02:58:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:58:39,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -673430054, now seen corresponding path program 1 times [2024-10-11 02:58:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084648660] [2024-10-11 02:58:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:58:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:58:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 02:58:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084648660] [2024-10-11 02:58:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084648660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986876079] [2024-10-11 02:58:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:39,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:39,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:58:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:39,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:58:39,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:39,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986876079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-10-11 02:58:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190738795] [2024-10-11 02:58:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:39,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:39,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:39,876 INFO L87 Difference]: Start difference. First operand 395 states and 556 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:58:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:39,921 INFO L93 Difference]: Finished difference Result 674 states and 974 transitions. [2024-10-11 02:58:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-10-11 02:58:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:39,923 INFO L225 Difference]: With dead ends: 674 [2024-10-11 02:58:39,923 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 02:58:39,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:39,925 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:39,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 02:58:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-10-11 02:58:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 253 states have internal predecessors, (298), 47 states have call successors, (47), 37 states have call predecessors, (47), 42 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2024-10-11 02:58:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2024-10-11 02:58:39,951 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 69 [2024-10-11 02:58:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:39,952 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2024-10-11 02:58:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:58:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2024-10-11 02:58:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 02:58:39,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:39,953 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:39,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:58:40,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:58:40,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -175638294, now seen corresponding path program 1 times [2024-10-11 02:58:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662658281] [2024-10-11 02:58:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:58:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:58:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:58:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662658281] [2024-10-11 02:58:40,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662658281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972392293] [2024-10-11 02:58:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:40,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:40,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:58:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:40,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:58:40,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:58:40,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:58:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:58:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972392293] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:40,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:58:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-10-11 02:58:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042903221] [2024-10-11 02:58:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:40,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:40,579 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 02:58:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:40,712 INFO L93 Difference]: Finished difference Result 923 states and 1219 transitions. [2024-10-11 02:58:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 74 [2024-10-11 02:58:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:40,715 INFO L225 Difference]: With dead ends: 923 [2024-10-11 02:58:40,715 INFO L226 Difference]: Without dead ends: 601 [2024-10-11 02:58:40,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 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-10-11 02:58:40,717 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:40,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 282 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-11 02:58:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 556. [2024-10-11 02:58:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 398 states have (on average 1.2311557788944723) internal successors, (490), 432 states have internal predecessors, (490), 81 states have call successors, (81), 65 states have call predecessors, (81), 76 states have return successors, (125), 81 states have call predecessors, (125), 81 states have call successors, (125) [2024-10-11 02:58:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 696 transitions. [2024-10-11 02:58:40,757 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 696 transitions. Word has length 74 [2024-10-11 02:58:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:40,758 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 696 transitions. [2024-10-11 02:58:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-11 02:58:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 696 transitions. [2024-10-11 02:58:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 02:58:40,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:40,760 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:58:40,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:58:40,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:40,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:40,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 619209870, now seen corresponding path program 1 times [2024-10-11 02:58:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270491091] [2024-10-11 02:58:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:58:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:58:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:58:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:58:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:58:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270491091] [2024-10-11 02:58:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270491091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033561398] [2024-10-11 02:58:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:41,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:41,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:58:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:41,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:58:41,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 02:58:41,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033561398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-11 02:58:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264390529] [2024-10-11 02:58:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:41,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:41,384 INFO L87 Difference]: Start difference. First operand 556 states and 696 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:58:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:41,509 INFO L93 Difference]: Finished difference Result 1012 states and 1260 transitions. [2024-10-11 02:58:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:58:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2024-10-11 02:58:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:41,512 INFO L225 Difference]: With dead ends: 1012 [2024-10-11 02:58:41,512 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:58:41,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:58:41,515 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:41,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 469 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:58:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:58:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 02:58:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:58:41,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-10-11 02:58:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:41,517 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:58:41,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:58:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:58:41,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:58:41,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:58:41,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:58:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:41,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:41,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:58:45,341 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:58:45,369 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or (<= 1 ~methaneLevelCritical~0) (< |old(~methaneLevelCritical~0)| 1)) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (or (not .cse2) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (or (< |old(~methaneLevelCritical~0)| 1) (< 0 ~methaneLevelCritical~0)) (or (not .cse2) (= ~methaneLevelCritical~0 0))))) [2024-10-11 02:58:45,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 02:58:45,400 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= |old(~methAndRunningLastTime~0)| 0)) (.cse0 (= |old(~pumpRunning~0)| 0))) (and (or (not .cse0) .cse1) (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (not .cse2) .cse1 (< ~methaneLevelCritical~0 1)) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse3 (= ~methaneLevelCritical~0 0)) (.cse6 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 1 ~systemActive~0)) (.cse5 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse3 .cse4 .cse5) (and .cse3 .cse2 .cse4 .cse0) (and .cse6 .cse2 .cse4 .cse5) (and .cse6 .cse2 .cse4 .cse0) (and .cse6 .cse4 (<= 2 |old(~waterLevel~0)|) .cse5))))) Eliminated clause: (let ((.cse6 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~pumpRunning~0 0))) (and (exists ((|old(~methAndRunningLastTime~0)| Int)) (let ((.cse4 (= |old(~methAndRunningLastTime~0)| 0))) (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4 .cse2) (and .cse5 .cse1 .cse4 .cse2))) (or (not .cse4) .cse6 (< ~methaneLevelCritical~0 1))))) (or .cse6 (not .cse5)))) [2024-10-11 02:58:45,414 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 02:58:45,429 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methAndRunningLastTime~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 (<= 1 |old(~pumpRunning~0)|)) (and .cse2 (<= 1 ~methaneLevelCritical~0) .cse1 .cse3) (and .cse2 .cse0 .cse1 .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 (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-10-11 02:58:45,438 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse4 (<= 1 ~pumpRunning~0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse4 .cse2 .cse3 (<= 2 |old(~waterLevel~0)|)) (and .cse0 .cse1 .cse5 .cse3))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 (<= 2 ~waterLevel~0) .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse0 .cse1 .cse5 .cse3))) [2024-10-11 02:58:45,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:58:45 BoogieIcfgContainer [2024-10-11 02:58:45,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:58:45,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:58:45,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:58:45,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:58:45,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:36" (3/4) ... [2024-10-11 02:58:45,452 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 02:58:45,456 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 02:58:45,456 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 02:58:45,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 02:58:45,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 02:58:45,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-11 02:58:45,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:45,457 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 02:58:45,463 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-10-11 02:58:45,466 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 02:58:45,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 02:58:45,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:45,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:45,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:58:45,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 02:58:45,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:58:45,592 INFO L158 Benchmark]: Toolchain (without parser) took 9990.87ms. Allocated memory was 142.6MB in the beginning and 299.9MB in the end (delta: 157.3MB). Free memory was 71.8MB in the beginning and 103.5MB in the end (delta: -31.7MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,592 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:58:45,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.71ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 50.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.92ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 50.8MB in the beginning and 219.9MB in the end (delta: -169.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,593 INFO L158 Benchmark]: Boogie Preprocessor took 81.75ms. Allocated memory is still 249.6MB. Free memory was 219.8MB in the beginning and 217.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,593 INFO L158 Benchmark]: RCFGBuilder took 403.78ms. Allocated memory is still 249.6MB. Free memory was 217.4MB in the beginning and 198.0MB in the end (delta: 19.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,594 INFO L158 Benchmark]: TraceAbstraction took 8565.71ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 197.0MB in the beginning and 110.8MB in the end (delta: 86.2MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,594 INFO L158 Benchmark]: Witness Printer took 142.48ms. Allocated memory is still 299.9MB. Free memory was 110.8MB in the beginning and 103.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 02:58:45,595 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.16ms. Allocated memory is still 142.6MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.71ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 50.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.92ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 50.8MB in the beginning and 219.9MB in the end (delta: -169.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.75ms. Allocated memory is still 249.6MB. Free memory was 219.8MB in the beginning and 217.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.78ms. Allocated memory is still 249.6MB. Free memory was 217.4MB in the beginning and 198.0MB in the end (delta: 19.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8565.71ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 197.0MB in the beginning and 110.8MB in the end (delta: 86.2MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. * Witness Printer took 142.48ms. Allocated memory is still 299.9MB. Free memory was 110.8MB in the beginning and 103.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [58] - GenericResultAtLocation [Line: 99]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [99] - GenericResultAtLocation [Line: 137]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [137] - GenericResultAtLocation [Line: 331]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [331] - GenericResultAtLocation [Line: 401]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [401] - GenericResultAtLocation [Line: 498]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [498] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [593] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 54]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 820 mSDsluCounter, 2105 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1272 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 833 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 115 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 1439 SizeOfPredicates, 3 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 192/202 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: 344]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) - ProcedureContractResult [Line: 173]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) - ProcedureContractResult [Line: 526]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= \old(methaneLevelCritical))) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 403]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 149]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((methAndRunningLastTime == 0) || (pumpRunning != 0)) Ensures: (((((((\old(pumpRunning) < 1) || (methaneLevelCritical < 1)) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && (((((((1 <= methaneLevelCritical) && (2 <= \old(waterLevel))) && (1 <= \old(pumpRunning))) || ((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((methaneLevelCritical == 0) && (1 <= \old(pumpRunning)))) || (((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 <= \old(pumpRunning)))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) && (((\old(pumpRunning) < 1) || ((pumpRunning == \old(pumpRunning)) && (1 == systemActive))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) && ((methAndRunningLastTime == 0) || (methaneLevelCritical != 0))) && (((\old(pumpRunning) != 0) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel))) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (\old(waterLevel) == waterLevel)))) - ProcedureContractResult [Line: 538]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: (((methaneLevelCritical <= \result) && ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)))) && ((methaneLevelCritical != 0) || (\result == 0))) - ProcedureContractResult [Line: 181]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 <= waterLevel)))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) - ProcedureContractResult [Line: 514]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((pumpRunning != 0) || (\old(waterLevel) != 1)) || (1 < waterLevel)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 02:58:45,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE