./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80b4c453e300455caffbcb636daccd3af095acb6ed433fb3111a61f5db77a0b9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:53:29,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:53:29,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:53:29,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:53:29,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:53:29,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:53:29,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:53:29,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:53:29,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:53:29,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:53:29,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:53:29,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:53:29,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:53:29,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:53:29,639 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:53:29,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:53:29,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:53:29,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:53:29,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:53:29,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:53:29,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:53:29,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:53:29,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:53:29,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:53:29,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:53:29,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:53:29,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:53:29,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:53:29,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:53:29,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:53:29,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:53:29,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:53:29,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:29,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:53:29,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:53:29,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:53:29,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:53:29,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:53:29,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:53:29,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:53:29,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:53:29,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:53:29,650 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80b4c453e300455caffbcb636daccd3af095acb6ed433fb3111a61f5db77a0b9 [2024-11-11 20:53:29,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:53:29,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:53:29,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:53:29,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:53:29,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:53:29,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c [2024-11-11 20:53:31,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:53:31,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:53:31,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c [2024-11-11 20:53:31,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86c68e0/c18fdd95520f45d6a34f0a5cb6691174/FLAG103c67fcc [2024-11-11 20:53:31,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86c68e0/c18fdd95520f45d6a34f0a5cb6691174 [2024-11-11 20:53:31,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:53:31,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:53:31,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:31,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:53:31,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:53:31,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cccafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31, skipping insertion in model container [2024-11-11 20:53:31,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:53:32,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c[1605,1618] [2024-11-11 20:53:32,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:32,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:53:32,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-11 20:53:32,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2024-11-11 20:53:32,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [300] [2024-11-11 20:53:32,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [370] [2024-11-11 20:53:32,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [409] [2024-11-11 20:53:32,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] [2024-11-11 20:53:32,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] [2024-11-11 20:53:32,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [910] [2024-11-11 20:53:32,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c[1605,1618] [2024-11-11 20:53:32,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:32,311 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:53:32,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32 WrapperNode [2024-11-11 20:53:32,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:32,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:32,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:53:32,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:53:32,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,361 INFO L138 Inliner]: procedures = 58, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 226 [2024-11-11 20:53:32,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:32,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:53:32,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:53:32,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:53:32,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,398 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:53:32,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:53:32,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:53:32,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:53:32,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:53:32,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (1/1) ... [2024-11-11 20:53:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:32,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:32,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:53:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:53:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:53:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:53:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:53:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:53:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:53:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:53:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:53:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:53:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:53:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:53:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:53:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:53:32,512 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:53:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:53:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:53:32,512 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:53:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:53:32,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:53:32,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:53:32,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:53:32,927 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-11 20:53:32,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:53:32,950 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:53:32,950 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:53:32,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:32 BoogieIcfgContainer [2024-11-11 20:53:32,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:53:32,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:53:32,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:53:32,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:53:32,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:53:31" (1/3) ... [2024-11-11 20:53:32,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97b5c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:32, skipping insertion in model container [2024-11-11 20:53:32,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:32" (2/3) ... [2024-11-11 20:53:32,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97b5c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:32, skipping insertion in model container [2024-11-11 20:53:32,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:32" (3/3) ... [2024-11-11 20:53:32,961 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product59.cil.c [2024-11-11 20:53:32,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:53:32,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:53:33,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:53:33,071 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;@41c90834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:53:33,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:53:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 20:53:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:53:33,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -13342285, now seen corresponding path program 1 times [2024-11-11 20:53:33,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793120479] [2024-11-11 20:53:33,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:53:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793120479] [2024-11-11 20:53:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793120479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640182634] [2024-11-11 20:53:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:53:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:53:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:33,350 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,379 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2024-11-11 20:53:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:53:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:53:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,390 INFO L225 Difference]: With dead ends: 191 [2024-11-11 20:53:33,390 INFO L226 Difference]: Without dead ends: 91 [2024-11-11 20:53:33,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:33,398 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-11 20:53:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-11 20:53:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:53:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2024-11-11 20:53:33,445 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 25 [2024-11-11 20:53:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2024-11-11 20:53:33,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2024-11-11 20:53:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:53:33,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:53:33,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1348159518, now seen corresponding path program 1 times [2024-11-11 20:53:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585607945] [2024-11-11 20:53:33,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:53:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585607945] [2024-11-11 20:53:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585607945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181067590] [2024-11-11 20:53:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:33,616 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,643 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2024-11-11 20:53:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:53:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,648 INFO L225 Difference]: With dead ends: 143 [2024-11-11 20:53:33,648 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 20:53:33,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:33,651 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 20:53:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-11 20:53:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:53:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2024-11-11 20:53:33,665 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2024-11-11 20:53:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,665 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2024-11-11 20:53:33,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2024-11-11 20:53:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:53:33,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:53:33,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1571393351, now seen corresponding path program 1 times [2024-11-11 20:53:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911319161] [2024-11-11 20:53:33,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911319161] [2024-11-11 20:53:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911319161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093091583] [2024-11-11 20:53:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:33,834 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,881 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2024-11-11 20:53:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-11 20:53:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,884 INFO L225 Difference]: With dead ends: 229 [2024-11-11 20:53:33,884 INFO L226 Difference]: Without dead ends: 155 [2024-11-11 20:53:33,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:33,886 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 85 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-11 20:53:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-11 20:53:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 130 states have internal predecessors, (156), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-11 20:53:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 200 transitions. [2024-11-11 20:53:33,908 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 200 transitions. Word has length 30 [2024-11-11 20:53:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,909 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 200 transitions. [2024-11-11 20:53:33,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2024-11-11 20:53:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:53:33,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:53:33,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1136396561, now seen corresponding path program 1 times [2024-11-11 20:53:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246662457] [2024-11-11 20:53:33,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246662457] [2024-11-11 20:53:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246662457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518974908] [2024-11-11 20:53:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:34,105 INFO L87 Difference]: Start difference. First operand 152 states and 200 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:34,237 INFO L93 Difference]: Finished difference Result 380 states and 511 transitions. [2024-11-11 20:53:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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 34 [2024-11-11 20:53:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:34,241 INFO L225 Difference]: With dead ends: 380 [2024-11-11 20:53:34,241 INFO L226 Difference]: Without dead ends: 236 [2024-11-11 20:53:34,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:34,247 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 55 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:34,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 362 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-11 20:53:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2024-11-11 20:53:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.3146067415730338) internal successors, (234), 195 states have internal predecessors, (234), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2024-11-11 20:53:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 302 transitions. [2024-11-11 20:53:34,282 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 302 transitions. Word has length 34 [2024-11-11 20:53:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,282 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 302 transitions. [2024-11-11 20:53:34,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 302 transitions. [2024-11-11 20:53:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:53:34,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:34,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:53:34,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:34,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash 571922311, now seen corresponding path program 1 times [2024-11-11 20:53:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706872598] [2024-11-11 20:53:34,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:53:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:34,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706872598] [2024-11-11 20:53:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706872598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:34,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:34,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196208141] [2024-11-11 20:53:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:34,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:34,441 INFO L87 Difference]: Start difference. First operand 235 states and 302 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:34,664 INFO L93 Difference]: Finished difference Result 516 states and 679 transitions. [2024-11-11 20:53:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:34,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-11 20:53:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:34,668 INFO L225 Difference]: With dead ends: 516 [2024-11-11 20:53:34,668 INFO L226 Difference]: Without dead ends: 289 [2024-11-11 20:53:34,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:34,672 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 58 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:34,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 369 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-11 20:53:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2024-11-11 20:53:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 220 states have (on average 1.290909090909091) internal successors, (284), 237 states have internal predecessors, (284), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-11 20:53:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 366 transitions. [2024-11-11 20:53:34,726 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 366 transitions. Word has length 52 [2024-11-11 20:53:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,727 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 366 transitions. [2024-11-11 20:53:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2024-11-11 20:53:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:53:34,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:34,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:53:34,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1799816951, now seen corresponding path program 1 times [2024-11-11 20:53:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466811738] [2024-11-11 20:53:34,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:53:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:34,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466811738] [2024-11-11 20:53:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466811738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:34,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864451481] [2024-11-11 20:53:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:34,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:34,890 INFO L87 Difference]: Start difference. First operand 287 states and 366 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:35,164 INFO L93 Difference]: Finished difference Result 578 states and 751 transitions. [2024-11-11 20:53:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-11 20:53:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:35,168 INFO L225 Difference]: With dead ends: 578 [2024-11-11 20:53:35,168 INFO L226 Difference]: Without dead ends: 299 [2024-11-11 20:53:35,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:53:35,172 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 182 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:35,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 409 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-11 20:53:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2024-11-11 20:53:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 224 states have (on average 1.2857142857142858) internal successors, (288), 241 states have internal predecessors, (288), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-11 20:53:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 370 transitions. [2024-11-11 20:53:35,202 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 370 transitions. Word has length 52 [2024-11-11 20:53:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:35,202 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 370 transitions. [2024-11-11 20:53:35,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 370 transitions. [2024-11-11 20:53:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:53:35,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:35,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:35,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:53:35,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:35,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash -413613557, now seen corresponding path program 1 times [2024-11-11 20:53:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179596005] [2024-11-11 20:53:35,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:53:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179596005] [2024-11-11 20:53:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179596005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594513054] [2024-11-11 20:53:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:35,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:35,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:35,368 INFO L87 Difference]: Start difference. First operand 291 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:35,630 INFO L93 Difference]: Finished difference Result 822 states and 1083 transitions. [2024-11-11 20:53:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-11-11 20:53:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:35,638 INFO L225 Difference]: With dead ends: 822 [2024-11-11 20:53:35,639 INFO L226 Difference]: Without dead ends: 539 [2024-11-11 20:53:35,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:35,643 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 221 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:35,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 308 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-11 20:53:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 532. [2024-11-11 20:53:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 405 states have (on average 1.254320987654321) internal successors, (508), 431 states have internal predecessors, (508), 65 states have call successors, (65), 59 states have call predecessors, (65), 61 states have return successors, (103), 64 states have call predecessors, (103), 65 states have call successors, (103) [2024-11-11 20:53:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 676 transitions. [2024-11-11 20:53:35,698 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 676 transitions. Word has length 52 [2024-11-11 20:53:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 676 transitions. [2024-11-11 20:53:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 676 transitions. [2024-11-11 20:53:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 20:53:35,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:35,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:53:35,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:35,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1362264357, now seen corresponding path program 1 times [2024-11-11 20:53:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000587966] [2024-11-11 20:53:35,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:53:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000587966] [2024-11-11 20:53:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000587966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:53:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113694776] [2024-11-11 20:53:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:53:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:35,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:53:35,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:53:35,907 INFO L87 Difference]: Start difference. First operand 532 states and 676 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:53:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:36,630 INFO L93 Difference]: Finished difference Result 1718 states and 2288 transitions. [2024-11-11 20:53:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:53:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2024-11-11 20:53:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:36,638 INFO L225 Difference]: With dead ends: 1718 [2024-11-11 20:53:36,638 INFO L226 Difference]: Without dead ends: 1194 [2024-11-11 20:53:36,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2024-11-11 20:53:36,644 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 407 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:36,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 528 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:53:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-11 20:53:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1156. [2024-11-11 20:53:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 869 states have (on average 1.2209436133486766) internal successors, (1061), 934 states have internal predecessors, (1061), 152 states have call successors, (152), 114 states have call predecessors, (152), 134 states have return successors, (278), 150 states have call predecessors, (278), 152 states have call successors, (278) [2024-11-11 20:53:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1491 transitions. [2024-11-11 20:53:36,729 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1491 transitions. Word has length 56 [2024-11-11 20:53:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:36,729 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1491 transitions. [2024-11-11 20:53:36,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:53:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1491 transitions. [2024-11-11 20:53:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 20:53:36,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:36,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:53:36,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -313330645, now seen corresponding path program 1 times [2024-11-11 20:53:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215116577] [2024-11-11 20:53:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:53:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:53:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:53:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215116577] [2024-11-11 20:53:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215116577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:53:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663425354] [2024-11-11 20:53:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:36,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:53:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:53:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:53:36,857 INFO L87 Difference]: Start difference. First operand 1156 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 20:53:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:37,380 INFO L93 Difference]: Finished difference Result 1404 states and 1799 transitions. [2024-11-11 20:53:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:53:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-11-11 20:53:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:37,386 INFO L225 Difference]: With dead ends: 1404 [2024-11-11 20:53:37,386 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 20:53:37,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:53:37,390 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 432 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:37,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 207 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:53:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 20:53:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 565. [2024-11-11 20:53:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 425 states have (on average 1.183529411764706) internal successors, (503), 455 states have internal predecessors, (503), 73 states have call successors, (73), 56 states have call predecessors, (73), 66 states have return successors, (136), 73 states have call predecessors, (136), 73 states have call successors, (136) [2024-11-11 20:53:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 712 transitions. [2024-11-11 20:53:37,473 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 712 transitions. Word has length 91 [2024-11-11 20:53:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 712 transitions. [2024-11-11 20:53:37,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 20:53:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 712 transitions. [2024-11-11 20:53:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:53:37,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:37,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:37,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:53:37,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:37,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash -188705161, now seen corresponding path program 1 times [2024-11-11 20:53:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:37,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927909089] [2024-11-11 20:53:37,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:53:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:53:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:53:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:53:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927909089] [2024-11-11 20:53:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927909089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086936613] [2024-11-11 20:53:37,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:37,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:37,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:53:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:53:37,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:53:37,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086936613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-11 20:53:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457595400] [2024-11-11 20:53:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:37,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:37,868 INFO L87 Difference]: Start difference. First operand 565 states and 712 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:53:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:37,932 INFO L93 Difference]: Finished difference Result 1040 states and 1353 transitions. [2024-11-11 20:53:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-11 20:53:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:37,936 INFO L225 Difference]: With dead ends: 1040 [2024-11-11 20:53:37,936 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 20:53:37,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:37,938 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:37,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 20:53:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2024-11-11 20:53:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 437 states have (on average 1.1784897025171626) internal successors, (515), 467 states have internal predecessors, (515), 73 states have call successors, (73), 56 states have call predecessors, (73), 66 states have return successors, (136), 73 states have call predecessors, (136), 73 states have call successors, (136) [2024-11-11 20:53:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 724 transitions. [2024-11-11 20:53:38,016 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 724 transitions. Word has length 98 [2024-11-11 20:53:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 724 transitions. [2024-11-11 20:53:38,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:53:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 724 transitions. [2024-11-11 20:53:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:53:38,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:38,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:38,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:53:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 20:53:38,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:38,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash -54691655, now seen corresponding path program 1 times [2024-11-11 20:53:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:38,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474690745] [2024-11-11 20:53:38,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:38,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:53:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:53:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:53:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:53:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474690745] [2024-11-11 20:53:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474690745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330686101] [2024-11-11 20:53:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:38,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:53:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:38,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:53:38,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:38,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330686101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:38,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-11-11 20:53:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784109537] [2024-11-11 20:53:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:38,534 INFO L87 Difference]: Start difference. First operand 577 states and 724 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:53:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:38,598 INFO L93 Difference]: Finished difference Result 910 states and 1177 transitions. [2024-11-11 20:53:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-11 20:53:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:38,604 INFO L225 Difference]: With dead ends: 910 [2024-11-11 20:53:38,604 INFO L226 Difference]: Without dead ends: 908 [2024-11-11 20:53:38,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:38,606 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 47 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:38,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-11 20:53:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 806. [2024-11-11 20:53:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 611 states have (on average 1.1963993453355155) internal successors, (731), 656 states have internal predecessors, (731), 104 states have call successors, (104), 78 states have call predecessors, (104), 90 states have return successors, (224), 96 states have call predecessors, (224), 104 states have call successors, (224) [2024-11-11 20:53:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1059 transitions. [2024-11-11 20:53:38,683 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1059 transitions. Word has length 98 [2024-11-11 20:53:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:38,683 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1059 transitions. [2024-11-11 20:53:38,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:53:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1059 transitions. [2024-11-11 20:53:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-11 20:53:38,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:38,688 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 20:53:38,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:38,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 20:53:38,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:38,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash 295004921, now seen corresponding path program 1 times [2024-11-11 20:53:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655783358] [2024-11-11 20:53:38,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:53:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:53:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:53:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:53:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:53:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 46 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 20:53:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655783358] [2024-11-11 20:53:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655783358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641202199] [2024-11-11 20:53:39,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:39,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:39,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:53:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:53:39,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 20:53:39,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641202199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:39,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:39,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-11-11 20:53:39,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527809961] [2024-11-11 20:53:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:39,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:53:39,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:39,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:53:39,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:53:39,464 INFO L87 Difference]: Start difference. First operand 806 states and 1059 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:53:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:39,612 INFO L93 Difference]: Finished difference Result 1600 states and 2108 transitions. [2024-11-11 20:53:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-11-11 20:53:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:39,617 INFO L225 Difference]: With dead ends: 1600 [2024-11-11 20:53:39,618 INFO L226 Difference]: Without dead ends: 802 [2024-11-11 20:53:39,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:53:39,621 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 62 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:39,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 501 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-11-11 20:53:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 703. [2024-11-11 20:53:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 535 states have (on average 1.1775700934579438) internal successors, (630), 571 states have internal predecessors, (630), 89 states have call successors, (89), 67 states have call predecessors, (89), 78 states have return successors, (158), 86 states have call predecessors, (158), 89 states have call successors, (158) [2024-11-11 20:53:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 877 transitions. [2024-11-11 20:53:39,672 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 877 transitions. Word has length 143 [2024-11-11 20:53:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:39,672 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 877 transitions. [2024-11-11 20:53:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:53:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 877 transitions. [2024-11-11 20:53:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:53:39,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:39,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:39,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:53:39,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:39,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:39,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1162464621, now seen corresponding path program 1 times [2024-11-11 20:53:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74310624] [2024-11-11 20:53:39,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:53:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:53:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:53:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:53:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:53:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:53:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74310624] [2024-11-11 20:53:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74310624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178230512] [2024-11-11 20:53:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:40,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:40,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:53:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:40,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:40,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 79 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:40,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 20:53:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178230512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:53:40,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:53:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 18 [2024-11-11 20:53:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773481408] [2024-11-11 20:53:40,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:53:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:53:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:53:40,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:53:40,834 INFO L87 Difference]: Start difference. First operand 703 states and 877 transitions. Second operand has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-11 20:53:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:41,921 INFO L93 Difference]: Finished difference Result 1222 states and 1500 transitions. [2024-11-11 20:53:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 20:53:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 139 [2024-11-11 20:53:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:41,923 INFO L225 Difference]: With dead ends: 1222 [2024-11-11 20:53:41,923 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:53:41,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 298 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 20:53:41,927 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 395 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:41,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 291 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:53:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:53:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:53:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:53:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:53:41,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2024-11-11 20:53:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:41,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:53:41,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-11 20:53:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:53:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:53:41,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:53:41,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:42,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:42,136 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:42,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:53:46,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:53:46,597 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0))) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0)) [2024-11-11 20:53:46,631 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= |old(~methaneLevelCritical~0)| 0)) (.cse3 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 |old(~methaneLevelCritical~0)|) .cse3) (and .cse1 .cse2 (<= 2 ~waterLevel~0) .cse3) (and .cse0 (= 0 ~systemActive~0))))) Eliminated clause: (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse1 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse1 .cse3 .cse2) (and .cse0 (= 0 ~systemActive~0)))) [2024-11-11 20:53:46,660 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse6 (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse4 (= ~methaneLevelCritical~0 0)) (.cse3 (<= 2 |old(~waterLevel~0)|)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse1 (= |old(~methAndRunningLastTime~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse5 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) .cse6 (and .cse4 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse5))) (or (= ~pumpRunning~0 0) (not .cse6)) (= |old(~waterLevel~0)| ~waterLevel~0) (= |old(~methAndRunningLastTime~0)| ~methAndRunningLastTime~0))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse6 (= 0 ~systemActive~0))) (and (let ((.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse4 (<= 2 ~waterLevel~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) .cse6 (and .cse0 .cse1 .cse5 .cse3))) (or .cse0 (not .cse6)))) [2024-11-11 20:53:46,683 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse3 (= ~methAndRunningLastTime~0 0)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= ~waterLevel~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 1 ~systemActive~0)) (.cse5 (= ~waterLevel~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5) (and .cse0 .cse4 .cse3) (and .cse1 .cse2 .cse3 .cse5))) [2024-11-11 20:53:46,692 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= ~methAndRunningLastTime~0 0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 .cse2 (<= 2 |old(~waterLevel~0)|)) (and .cse3 .cse0 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse3 .cse0 .cse1 .cse2) (and .cse3 (= 0 ~systemActive~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and .cse1 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse1 .cse3 .cse2) (and .cse0 (= 0 ~systemActive~0)))) [2024-11-11 20:53:46,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:53:46 BoogieIcfgContainer [2024-11-11 20:53:46,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:53:46,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:53:46,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:53:46,703 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:53:46,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:32" (3/4) ... [2024-11-11 20:53:46,710 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:53:46,714 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-11 20:53:46,714 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:46,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:53:46,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:53:46,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:53:46,724 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:53:46,724 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:46,725 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:46,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:53:46,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:53:46,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:53:46,833 INFO L158 Benchmark]: Toolchain (without parser) took 15062.16ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 124.1MB in the beginning and 206.5MB in the end (delta: -82.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,833 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 111.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:53:46,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.06ms. Allocated memory is still 151.0MB. Free memory was 124.1MB in the beginning and 102.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 151.0MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,834 INFO L158 Benchmark]: Boogie Preprocessor took 51.02ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,834 INFO L158 Benchmark]: RCFGBuilder took 536.49ms. Allocated memory is still 151.0MB. Free memory was 97.3MB in the beginning and 77.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,835 INFO L158 Benchmark]: TraceAbstraction took 13748.91ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 76.9MB in the beginning and 214.9MB in the end (delta: -138.1MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,835 INFO L158 Benchmark]: Witness Printer took 129.74ms. Allocated memory is still 283.1MB. Free memory was 214.9MB in the beginning and 206.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:46,836 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.19ms. Allocated memory is still 111.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.06ms. Allocated memory is still 151.0MB. Free memory was 124.1MB in the beginning and 102.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 151.0MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.02ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.49ms. Allocated memory is still 151.0MB. Free memory was 97.3MB in the beginning and 77.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13748.91ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 76.9MB in the beginning and 214.9MB in the end (delta: -138.1MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 129.74ms. Allocated memory is still 283.1MB. Free memory was 214.9MB in the beginning and 206.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] - GenericResultAtLocation [Line: 300]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [300] - GenericResultAtLocation [Line: 370]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [370] - GenericResultAtLocation [Line: 409]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [409] - GenericResultAtLocation [Line: 509]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] - GenericResultAtLocation [Line: 544]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] - GenericResultAtLocation [Line: 910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [910] * 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 9 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1999 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1960 mSDsluCounter, 4065 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2764 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2563 IncrementalHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 1301 mSDtfsCounter, 2563 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 755 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=8, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 280 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1374 NumberOfCodeBlocks, 1374 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 2764 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 586/658 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: 421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 313]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (0 == systemActive))) - ProcedureContractResult [Line: 183]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive)) Ensures: (((pumpRunning == 0) && (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive))) && ((((((systemActive == \old(systemActive)) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 98]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: ((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 938]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1)) || (0 == systemActive)) && (((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical)) || (0 == systemActive))) && (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (\old(methaneLevelCritical) == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel)))) - ProcedureContractResult [Line: 411]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 950]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((\result == methaneLevelCritical) && ((1 == systemActive) || (0 == systemActive))) && (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || (((methaneLevelCritical == 0) && (waterLevel == 0)) && (0 != systemActive))) || ((pumpRunning == 0) && (methaneLevelCritical == 0))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) || ((pumpRunning == 0) && (0 == systemActive)))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 74]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive))) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || (0 == systemActive)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && ((pumpRunning == 0) || (0 != systemActive))) Ensures: ((((((((\old(pumpRunning) != 0) || (\old(methAndRunningLastTime) != 0)) || (\old(waterLevel) == waterLevel)) && ((((((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (2 <= \old(waterLevel))) || ((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((\old(pumpRunning) == 0) && (0 == systemActive))) || (((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (\old(pumpRunning) == 0))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel))))) && (((0 == systemActive) || ((pumpRunning == 0) && (1 == systemActive))) || (methaneLevelCritical < 1))) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) <= ((long long) waterLevel + 1))) || (((methAndRunningLastTime == 0) && (2 <= waterLevel)) && (\old(waterLevel) <= ((long long) waterLevel + 1)))) || (0 == systemActive))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 106]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: (((((pumpRunning == \old(pumpRunning)) || (waterLevel != 0)) && ((((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (\old(pumpRunning) == 0)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 0))) || ((methaneLevelCritical == 0) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0)))) && (((\old(pumpRunning) != 0) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (1 == systemActive)))) && ((((((systemActive == \old(systemActive)) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 926]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (2 <= \old(waterLevel))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive)))) && ((0 == systemActive) || (\old(waterLevel) < ((long long) waterLevel + 1)))) && ((\old(waterLevel) != 1) || (1 < waterLevel))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:53:46,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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