./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product41.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_spec3_product41.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 0cfed743c16ce3c8683c42b92f2e032d4ce7b489a9d3a5e140ec6101c472b3cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:54:10,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:54:10,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:54:10,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:54:10,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:54:10,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:54:10,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:54:10,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:54:10,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:54:10,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:54:10,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:54:10,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:54:10,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:54:10,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:54:10,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:54:10,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:54:10,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:54:10,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:54:10,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:54:10,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:54:10,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:54:10,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:54:10,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:54:10,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:54:10,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:54:10,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:54:10,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:54:10,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:54:10,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:54:10,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:54:10,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:54:10,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:54:10,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:10,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:54:10,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:54:10,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:54:10,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:54:10,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:54:10,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:54:10,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:54:10,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:54:10,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:54:10,571 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 -> 0cfed743c16ce3c8683c42b92f2e032d4ce7b489a9d3a5e140ec6101c472b3cb [2024-11-11 20:54:10,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:54:10,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:54:10,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:54:10,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:54:10,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:54:10,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c [2024-11-11 20:54:12,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:54:12,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:54:12,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c [2024-11-11 20:54:12,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10b88821/26d49bf4bf144cd4ae9a5e3597ba5503/FLAG667c0916b [2024-11-11 20:54:12,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10b88821/26d49bf4bf144cd4ae9a5e3597ba5503 [2024-11-11 20:54:12,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:54:12,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:54:12,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:12,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:54:12,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:54:12,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:12" (1/1) ... [2024-11-11 20:54:12,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520362f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:12, skipping insertion in model container [2024-11-11 20:54:12,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:12" (1/1) ... [2024-11-11 20:54:12,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:54:12,954 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_spec3_product41.cil.c[17978,17991] [2024-11-11 20:54:12,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:12,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:54:12,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-11 20:54:12,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [87] [2024-11-11 20:54:12,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [267] [2024-11-11 20:54:12,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [335] [2024-11-11 20:54:12,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] [2024-11-11 20:54:12,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [465] [2024-11-11 20:54:12,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [561] [2024-11-11 20:54:12,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [927] [2024-11-11 20:54:13,048 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_spec3_product41.cil.c[17978,17991] [2024-11-11 20:54:13,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:13,076 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:54:13,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13 WrapperNode [2024-11-11 20:54:13,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:13,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:13,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:54:13,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:54:13,083 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:54:13" (1/1) ... [2024-11-11 20:54:13,095 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:54:13" (1/1) ... [2024-11-11 20:54:13,122 INFO L138 Inliner]: procedures = 53, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 193 [2024-11-11 20:54:13,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:13,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:54:13,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:54:13,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:54:13,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,162 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:54:13,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:54:13,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:54:13,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:54:13,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:54:13,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (1/1) ... [2024-11-11 20:54:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:13,215 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:54:13,217 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:54:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:54:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:54:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:54:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:54:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:54:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:54:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:54:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:54:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:54:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:54:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:54:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:54:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:54:13,260 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:54:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:54:13,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:54:13,324 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:54:13,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:54:13,510 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-11 20:54:13,510 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:54:13,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:54:13,525 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:54:13,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:13 BoogieIcfgContainer [2024-11-11 20:54:13,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:54:13,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:54:13,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:54:13,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:54:13,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:54:12" (1/3) ... [2024-11-11 20:54:13,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141d313e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:13, skipping insertion in model container [2024-11-11 20:54:13,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:13" (2/3) ... [2024-11-11 20:54:13,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141d313e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:13, skipping insertion in model container [2024-11-11 20:54:13,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:13" (3/3) ... [2024-11-11 20:54:13,533 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product41.cil.c [2024-11-11 20:54:13,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:54:13,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:54:13,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:54:13,615 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;@5124a9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:54:13,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:54:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 20:54:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:54:13,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,641 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:54:13,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash -310918915, now seen corresponding path program 1 times [2024-11-11 20:54:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949338515] [2024-11-11 20:54:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:54:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,858 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:54:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949338515] [2024-11-11 20:54:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949338515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:54:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005710672] [2024-11-11 20:54:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:54:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:54:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:13,895 INFO L87 Difference]: Start difference. First operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 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:54:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:13,927 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2024-11-11 20:54:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:54:13,929 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:54:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:13,938 INFO L225 Difference]: With dead ends: 154 [2024-11-11 20:54:13,939 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 20:54:13,943 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:54:13,948 INFO L435 NwaCegarLoop]: 102 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, 102 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:54:13,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 20:54:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-11 20:54:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:54:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2024-11-11 20:54:13,987 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 25 [2024-11-11 20:54:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:13,988 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-11 20:54:13,988 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:54:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2024-11-11 20:54:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:54:13,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,990 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:54:13,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:54:13,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1548949891, now seen corresponding path program 1 times [2024-11-11 20:54:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131955435] [2024-11-11 20:54:13,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:54:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,089 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:54:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131955435] [2024-11-11 20:54:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131955435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739651644] [2024-11-11 20:54:14,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:14,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,096 INFO L87 Difference]: Start difference. First operand 72 states and 93 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:54:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,115 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2024-11-11 20:54:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:14,116 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:54:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,117 INFO L225 Difference]: With dead ends: 110 [2024-11-11 20:54:14,118 INFO L226 Difference]: Without dead ends: 63 [2024-11-11 20:54:14,118 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:54:14,119 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 144 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:54:14,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-11 20:54:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-11 20:54:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:54:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-11 20:54:14,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 26 [2024-11-11 20:54:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,133 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-11 20:54:14,133 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:54:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-11 20:54:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:54:14,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,134 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:54:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:54:14,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917381, now seen corresponding path program 1 times [2024-11-11 20:54:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159831537] [2024-11-11 20:54:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:54:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,248 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:54:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159831537] [2024-11-11 20:54:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159831537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301080911] [2024-11-11 20:54:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,250 INFO L87 Difference]: Start difference. First operand 63 states and 81 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:54:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,267 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-11 20:54:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:14,268 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:54:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,269 INFO L225 Difference]: With dead ends: 119 [2024-11-11 20:54:14,269 INFO L226 Difference]: Without dead ends: 63 [2024-11-11 20:54:14,270 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:54:14,272 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 79 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:54:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-11 20:54:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-11 20:54:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.32) internal successors, (66), 55 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:54:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-11 20:54:14,284 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 30 [2024-11-11 20:54:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,284 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-11 20:54:14,284 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:54:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-11 20:54:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 20:54:14,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,285 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, 1] [2024-11-11 20:54:14,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:54:14,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash -199527812, now seen corresponding path program 1 times [2024-11-11 20:54:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755244174] [2024-11-11 20:54:14,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:54:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,339 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:54:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755244174] [2024-11-11 20:54:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755244174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526667322] [2024-11-11 20:54:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,345 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,387 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2024-11-11 20:54:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:14,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-11 20:54:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,389 INFO L225 Difference]: With dead ends: 160 [2024-11-11 20:54:14,389 INFO L226 Difference]: Without dead ends: 104 [2024-11-11 20:54:14,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,390 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 69 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-11 20:54:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-11 20:54:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3125) internal successors, (105), 87 states have internal predecessors, (105), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-11 20:54:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2024-11-11 20:54:14,411 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 35 [2024-11-11 20:54:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,413 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2024-11-11 20:54:14,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2024-11-11 20:54:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 20:54:14,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,415 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:54:14,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2013550284, now seen corresponding path program 1 times [2024-11-11 20:54:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566783341] [2024-11-11 20:54:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:54:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,550 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:54:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566783341] [2024-11-11 20:54:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566783341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846829096] [2024-11-11 20:54:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:14,555 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,644 INFO L93 Difference]: Finished difference Result 276 states and 365 transitions. [2024-11-11 20:54:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:14,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-11 20:54:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,650 INFO L225 Difference]: With dead ends: 276 [2024-11-11 20:54:14,651 INFO L226 Difference]: Without dead ends: 181 [2024-11-11 20:54:14,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:14,654 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 34 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 286 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-11 20:54:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-11 20:54:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 152 states have internal predecessors, (183), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (27), 19 states have call predecessors, (27), 21 states have call successors, (27) [2024-11-11 20:54:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2024-11-11 20:54:14,679 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 41 [2024-11-11 20:54:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,680 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2024-11-11 20:54:14,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2024-11-11 20:54:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:54:14,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:14,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:54:14,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -583739890, now seen corresponding path program 1 times [2024-11-11 20:54:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792183556] [2024-11-11 20:54:14,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:54:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,790 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:54:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792183556] [2024-11-11 20:54:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792183556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573775237] [2024-11-11 20:54:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:14,793 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,022 INFO L93 Difference]: Finished difference Result 442 states and 591 transitions. [2024-11-11 20:54:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-11 20:54:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,027 INFO L225 Difference]: With dead ends: 442 [2024-11-11 20:54:15,027 INFO L226 Difference]: Without dead ends: 347 [2024-11-11 20:54:15,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:15,028 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 151 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 297 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-11 20:54:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2024-11-11 20:54:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2814814814814814) internal successors, (346), 294 states have internal predecessors, (346), 40 states have call successors, (40), 29 states have call predecessors, (40), 33 states have return successors, (66), 38 states have call predecessors, (66), 40 states have call successors, (66) [2024-11-11 20:54:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 452 transitions. [2024-11-11 20:54:15,069 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 452 transitions. Word has length 45 [2024-11-11 20:54:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 452 transitions. [2024-11-11 20:54:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 452 transitions. [2024-11-11 20:54:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:54:15,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:15,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:54:15,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -364885172, now seen corresponding path program 1 times [2024-11-11 20:54:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976045022] [2024-11-11 20:54:15,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:54:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,140 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:54:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976045022] [2024-11-11 20:54:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976045022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751053499] [2024-11-11 20:54:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:15,143 INFO L87 Difference]: Start difference. First operand 344 states and 452 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,241 INFO L93 Difference]: Finished difference Result 606 states and 813 transitions. [2024-11-11 20:54:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-11 20:54:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,246 INFO L225 Difference]: With dead ends: 606 [2024-11-11 20:54:15,247 INFO L226 Difference]: Without dead ends: 348 [2024-11-11 20:54:15,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:15,249 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-11 20:54:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-11-11 20:54:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 272 states have (on average 1.2720588235294117) internal successors, (346), 296 states have internal predecessors, (346), 40 states have call successors, (40), 29 states have call predecessors, (40), 33 states have return successors, (66), 38 states have call predecessors, (66), 40 states have call successors, (66) [2024-11-11 20:54:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 452 transitions. [2024-11-11 20:54:15,282 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 452 transitions. Word has length 45 [2024-11-11 20:54:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,282 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 452 transitions. [2024-11-11 20:54:15,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 452 transitions. [2024-11-11 20:54:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:54:15,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:15,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:54:15,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1182533622, now seen corresponding path program 1 times [2024-11-11 20:54:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391157420] [2024-11-11 20:54:15,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:54:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,379 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:54:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391157420] [2024-11-11 20:54:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391157420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:54:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878201331] [2024-11-11 20:54:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:54:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:54:15,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:15,383 INFO L87 Difference]: Start difference. First operand 346 states and 452 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,538 INFO L93 Difference]: Finished difference Result 692 states and 919 transitions. [2024-11-11 20:54:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:54:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-11 20:54:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,542 INFO L225 Difference]: With dead ends: 692 [2024-11-11 20:54:15,542 INFO L226 Difference]: Without dead ends: 353 [2024-11-11 20:54:15,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:54:15,545 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 132 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 304 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-11 20:54:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2024-11-11 20:54:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 280 states have (on average 1.2571428571428571) internal successors, (352), 302 states have internal predecessors, (352), 38 states have call successors, (38), 28 states have call predecessors, (38), 32 states have return successors, (64), 36 states have call predecessors, (64), 38 states have call successors, (64) [2024-11-11 20:54:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 454 transitions. [2024-11-11 20:54:15,582 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 454 transitions. Word has length 45 [2024-11-11 20:54:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,583 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 454 transitions. [2024-11-11 20:54:15,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 454 transitions. [2024-11-11 20:54:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:54:15,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,585 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] [2024-11-11 20:54:15,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:54:15,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 987986838, now seen corresponding path program 1 times [2024-11-11 20:54:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242333402] [2024-11-11 20:54:15,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:54:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:54:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242333402] [2024-11-11 20:54:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242333402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:54:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654384792] [2024-11-11 20:54:15,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:54:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:15,713 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:54:15,714 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:54:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 20:54:15,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:54:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:15,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:54:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654384792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:54:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-11-11 20:54:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069763155] [2024-11-11 20:54:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:54:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:54:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:15,865 INFO L87 Difference]: Start difference. First operand 351 states and 454 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,949 INFO L93 Difference]: Finished difference Result 1002 states and 1323 transitions. [2024-11-11 20:54:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-11 20:54:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,952 INFO L225 Difference]: With dead ends: 1002 [2024-11-11 20:54:15,953 INFO L226 Difference]: Without dead ends: 658 [2024-11-11 20:54:15,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:54:15,954 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 43 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 434 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-11 20:54:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2024-11-11 20:54:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 521 states have (on average 1.2399232245681382) internal successors, (646), 558 states have internal predecessors, (646), 73 states have call successors, (73), 55 states have call predecessors, (73), 61 states have return successors, (125), 69 states have call predecessors, (125), 73 states have call successors, (125) [2024-11-11 20:54:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 844 transitions. [2024-11-11 20:54:15,992 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 844 transitions. Word has length 50 [2024-11-11 20:54:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 844 transitions. [2024-11-11 20:54:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 844 transitions. [2024-11-11 20:54:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:54:15,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,993 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] [2024-11-11 20:54:16,012 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:54:16,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:54:16,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:16,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1869519007, now seen corresponding path program 1 times [2024-11-11 20:54:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572731332] [2024-11-11 20:54:16,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:54:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,264 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:54:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572731332] [2024-11-11 20:54:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572731332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:16,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:16,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911699053] [2024-11-11 20:54:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:16,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:16,266 INFO L87 Difference]: Start difference. First operand 656 states and 844 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:16,448 INFO L93 Difference]: Finished difference Result 1197 states and 1562 transitions. [2024-11-11 20:54:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:16,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:54:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:16,451 INFO L225 Difference]: With dead ends: 1197 [2024-11-11 20:54:16,451 INFO L226 Difference]: Without dead ends: 260 [2024-11-11 20:54:16,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:54:16,454 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 107 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:16,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 358 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-11 20:54:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2024-11-11 20:54:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 198 states have (on average 1.202020202020202) internal successors, (238), 211 states have internal predecessors, (238), 28 states have call successors, (28), 25 states have call predecessors, (28), 25 states have return successors, (35), 26 states have call predecessors, (35), 28 states have call successors, (35) [2024-11-11 20:54:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2024-11-11 20:54:16,468 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 51 [2024-11-11 20:54:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2024-11-11 20:54:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2024-11-11 20:54:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 20:54:16,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:16,470 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] [2024-11-11 20:54:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:54:16,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -400361830, now seen corresponding path program 1 times [2024-11-11 20:54:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549091581] [2024-11-11 20:54:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:54:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:54:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:54:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:54:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549091581] [2024-11-11 20:54:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549091581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:54:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719195845] [2024-11-11 20:54:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:54:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:54:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:16,577 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 4 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:54:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:16,907 INFO L93 Difference]: Finished difference Result 487 states and 588 transitions. [2024-11-11 20:54:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:54:16,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 4 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 54 [2024-11-11 20:54:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:16,909 INFO L225 Difference]: With dead ends: 487 [2024-11-11 20:54:16,909 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:54:16,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:54:16,910 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 196 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 283 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:54:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:54:16,911 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:54:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:54:16,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2024-11-11 20:54:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:16,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:54:16,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 4 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:54:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:54:16,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:54:16,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:54:16,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:54:16,917 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:16,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:54:18,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:54:18,626 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= |old(~methaneLevelCritical~0)| 1)) (.cse3 (= |old(~methaneLevelCritical~0)| 0))) (and (or (not .cse0) (= ~methaneLevelCritical~0 1) (not .cse1)) (let ((.cse2 (= 1 ~systemActive~0))) (or (and .cse2 (= ~pumpRunning~0 1)) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 .cse2))) (or (not .cse3) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= |old(~methaneLevelCritical~0)| 1)) (.cse3 (= |old(~methaneLevelCritical~0)| 0))) (and (or (not .cse0) (= ~methaneLevelCritical~0 1) (not .cse1)) (let ((.cse2 (= 1 ~systemActive~0))) (or (and .cse2 (= ~pumpRunning~0 1)) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 .cse2))) (or (not .cse3) (= ~methaneLevelCritical~0 0))))) [2024-11-11 20:54:18,633 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:18,643 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0))) (or (and .cse2 .cse3) (and (= ~methaneLevelCritical~0 0) .cse2 .cse0) (and .cse2 .cse0 (= ~methaneLevelCritical~0 1)))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0))) (or (and .cse2 .cse3) (and (= ~methaneLevelCritical~0 0) .cse2 .cse0) (and .cse2 .cse0 (= ~methaneLevelCritical~0 1)))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1)))))) [2024-11-11 20:54:18,647 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:18,649 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (= ~pumpRunning~0 1)) (and .cse1 .cse0 (= ~methaneLevelCritical~0 1)) (and .cse1 (= ~methaneLevelCritical~0 0) .cse0 (not (= |old(~waterLevel~0)| 2)))))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= 1 ~systemActive~0))) (or (and .cse0 (= ~methaneLevelCritical~0 0) (not (= 2 ~waterLevel~0)) .cse1) (and .cse1 (= ~pumpRunning~0 1)) (and .cse0 .cse1 (= ~methaneLevelCritical~0 1)))) [2024-11-11 20:54:18,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:54:18 BoogieIcfgContainer [2024-11-11 20:54:18,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:54:18,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:54:18,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:54:18,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:54:18,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:13" (3/4) ... [2024-11-11 20:54:18,656 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:54:18,663 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:54:18,663 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:54:18,663 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:54:18,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:54:18,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:54:18,665 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:54:18,670 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-11 20:54:18,670 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:54:18,671 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:54:18,671 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:18,671 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:18,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:54:18,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:54:18,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:54:18,769 INFO L158 Benchmark]: Toolchain (without parser) took 6157.19ms. Allocated memory was 136.3MB in the beginning and 255.9MB in the end (delta: 119.5MB). Free memory was 79.7MB in the beginning and 185.2MB in the end (delta: -105.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,769 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 136.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:54:18,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 58.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.58ms. Allocated memory is still 136.3MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,769 INFO L158 Benchmark]: Boogie Preprocessor took 51.70ms. Allocated memory is still 136.3MB. Free memory was 55.9MB in the beginning and 107.0MB in the end (delta: -51.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,770 INFO L158 Benchmark]: RCFGBuilder took 348.93ms. Allocated memory was 136.3MB in the beginning and 211.8MB in the end (delta: 75.5MB). Free memory was 107.0MB in the beginning and 167.5MB in the end (delta: -60.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,770 INFO L158 Benchmark]: TraceAbstraction took 5124.60ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 166.4MB in the beginning and 192.6MB in the end (delta: -26.1MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,770 INFO L158 Benchmark]: Witness Printer took 115.98ms. Allocated memory is still 255.9MB. Free memory was 192.6MB in the beginning and 185.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:54:18,771 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.48ms. Allocated memory is still 136.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 58.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.58ms. Allocated memory is still 136.3MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.70ms. Allocated memory is still 136.3MB. Free memory was 55.9MB in the beginning and 107.0MB in the end (delta: -51.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * RCFGBuilder took 348.93ms. Allocated memory was 136.3MB in the beginning and 211.8MB in the end (delta: 75.5MB). Free memory was 107.0MB in the beginning and 167.5MB in the end (delta: -60.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5124.60ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 166.4MB in the beginning and 192.6MB in the end (delta: -26.1MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. * Witness Printer took 115.98ms. Allocated memory is still 255.9MB. Free memory was 192.6MB in the beginning and 185.2MB in the end (delta: 7.3MB). 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [87] - GenericResultAtLocation [Line: 267]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [267] - GenericResultAtLocation [Line: 335]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [335] - GenericResultAtLocation [Line: 371]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] - GenericResultAtLocation [Line: 465]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [465] - GenericResultAtLocation [Line: 561]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [561] - GenericResultAtLocation [Line: 927]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [927] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 932]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 2676 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1840 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 950 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 836 mSDtfsCounter, 950 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=656occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 1 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 10/12 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: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1)) && (splverifierCounter == 0)) || (((1 == systemActive) && (splverifierCounter == 0)) && (pumpRunning == 1))) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (2 != waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) - ProcedureContractResult [Line: 125]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (2 != waterLevel)) && (1 == systemActive)) || ((1 == systemActive) && (pumpRunning == 1))) || ((((pumpRunning == 0) && (2 != waterLevel)) && (1 == systemActive)) && (methaneLevelCritical == 1))) Ensures: (((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (2 != waterLevel)) && (1 == systemActive)) || ((1 == systemActive) && (pumpRunning == 1))) || ((((pumpRunning == 0) && (2 != waterLevel)) && (1 == systemActive)) && (methaneLevelCritical == 1))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 398]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: (((((((1 == systemActive) && (pumpRunning == 1)) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive))) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 1)) && (1 == systemActive))) && (((pumpRunning != 0) || (methaneLevelCritical == 0)) || (\old(methaneLevelCritical) != 1))) && (((\old(methaneLevelCritical) != 0) || (pumpRunning != 0)) || (methaneLevelCritical == 1))) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 467]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 410]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((1 == systemActive) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((1 == systemActive) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) && (((pumpRunning != 0) || (methaneLevelCritical != 1)) || (\result == 1))) && ((methaneLevelCritical != 0) || (\result == 0))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 101]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((\old(pumpRunning) == 1) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (methaneLevelCritical == 1))) && (((1 == systemActive) && (pumpRunning == 1)) || (\old(pumpRunning) != 1))) && (((\old(pumpRunning) != 0) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel))) || ((\old(waterLevel) == waterLevel) && (pumpRunning == 1)))) && (((\old(pumpRunning) != 0) || (2 != waterLevel)) || (methaneLevelCritical != 0))) && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 386]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (2 != waterLevel)) && (1 == systemActive)) || ((1 == systemActive) && (pumpRunning == 1))) || (((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1))) Ensures: (((((1 == systemActive) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) != 2))) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:54:18,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE