./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product42.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_product42.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 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:54:10,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:54:10,734 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,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:54:10,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:54:10,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:54:10,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:54:10,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:54:10,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:54:10,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:54:10,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:54:10,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:54:10,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:54:10,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:54:10,773 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:54:10,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:54:10,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:54:10,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:54:10,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:54:10,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:54:10,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:54:10,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:54:10,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:54:10,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:54:10,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:54:10,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:54:10,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:54:10,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:54:10,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:54:10,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:54:10,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:54:10,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:54:10,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:10,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:54:10,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:54:10,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:54:10,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:54:10,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:54:10,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:54:10,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:54:10,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:54:10,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:54:10,785 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 -> 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf [2024-11-11 20:54:10,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:54:10,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:54:11,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:54:11,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:54:11,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:54:11,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2024-11-11 20:54:12,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:54:12,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:54:12,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2024-11-11 20:54:12,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988815186/4c413e69b4a94e5685a2b1aa54e8d44c/FLAG2a1b7db5f [2024-11-11 20:54:12,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988815186/4c413e69b4a94e5685a2b1aa54e8d44c [2024-11-11 20:54:12,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:54:12,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:54:12,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:12,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:54:12,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:54:12,975 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,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e51dd0 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,977 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:13,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:54:13,286 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_product42.cil.c[7477,7490] [2024-11-11 20:54:13,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:13,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:54:13,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-11-11 20:54:13,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] [2024-11-11 20:54:13,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] [2024-11-11 20:54:13,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] [2024-11-11 20:54:13,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] [2024-11-11 20:54:13,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] [2024-11-11 20:54:13,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] [2024-11-11 20:54:13,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] [2024-11-11 20:54:13,416 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_product42.cil.c[7477,7490] [2024-11-11 20:54:13,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:13,468 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:54:13,468 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,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:13,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:13,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:54:13,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:54:13,475 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,491 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,513 INFO L138 Inliner]: procedures = 54, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 196 [2024-11-11 20:54:13,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:13,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:54:13,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:54:13,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:54:13,525 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,525 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,527 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,539 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,540 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,540 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,543 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,546 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,547 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,548 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,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:54:13,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:54:13,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:54:13,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:54:13,553 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,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:13,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:13,586 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,590 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,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:54:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:54:13,631 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:54:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:54:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:54:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:54:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:54:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:54:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:54:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:54:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:54:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:54:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:54:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:54:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:54:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:54:13,709 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:54:13,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:54:13,925 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-11 20:54:13,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:54:13,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:54:13,941 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:54:13,941 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,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:54:13,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:54:13,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:54:13,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:54:13,945 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,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4153e1 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,946 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,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4153e1 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,946 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,947 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product42.cil.c [2024-11-11 20:54:13,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:54:13,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:54:14,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:54:14,008 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;@2c60ba01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:54:14,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:54:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 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:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:54:14,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,021 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:14,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1617756963, now seen corresponding path program 1 times [2024-11-11 20:54:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676604638] [2024-11-11 20:54:14,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:54:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,168 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,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676604638] [2024-11-11 20:54:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676604638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:54:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823438222] [2024-11-11 20:54:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:54:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:54:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:14,194 INFO L87 Difference]: Start difference. First operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 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:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,217 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2024-11-11 20:54:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:54:14,238 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:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,254 INFO L225 Difference]: With dead ends: 156 [2024-11-11 20:54:14,257 INFO L226 Difference]: Without dead ends: 73 [2024-11-11 20:54:14,264 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:14,269 INFO L435 NwaCegarLoop]: 103 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, 103 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:14,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 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:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-11 20:54:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-11 20:54:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 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:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-11-11 20:54:14,354 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 25 [2024-11-11 20:54:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,356 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-11-11 20:54:14,357 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:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-11-11 20:54:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:54:14,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,359 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:14,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:54:14,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1176803179, now seen corresponding path program 1 times [2024-11-11 20:54:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178942965] [2024-11-11 20:54:14,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:54:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,497 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,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178942965] [2024-11-11 20:54:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178942965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578934698] [2024-11-11 20:54:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,507 INFO L87 Difference]: Start difference. First operand 73 states and 94 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,525 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2024-11-11 20:54:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:14,527 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,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,528 INFO L225 Difference]: With dead ends: 111 [2024-11-11 20:54:14,528 INFO L226 Difference]: Without dead ends: 64 [2024-11-11 20:54:14,529 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,530 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 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,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 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,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-11 20:54:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-11 20:54:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 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,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-11-11 20:54:14,538 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 26 [2024-11-11 20:54:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-11-11 20:54:14,539 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,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-11 20:54:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:54:14,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,543 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] [2024-11-11 20:54:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:54:14,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 414343402, now seen corresponding path program 1 times [2024-11-11 20:54:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466544831] [2024-11-11 20:54:14,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,669 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,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466544831] [2024-11-11 20:54:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466544831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605057543] [2024-11-11 20:54:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:14,672 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,716 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2024-11-11 20:54:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-11 20:54:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,717 INFO L225 Difference]: With dead ends: 121 [2024-11-11 20:54:14,718 INFO L226 Difference]: Without dead ends: 64 [2024-11-11 20:54:14,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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,719 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-11 20:54:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-11 20:54:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 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,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-11-11 20:54:14,726 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 31 [2024-11-11 20:54:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,727 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-11-11 20:54:14,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-11-11 20:54:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 20:54:14,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,728 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] [2024-11-11 20:54:14,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:54:14,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash 808202887, now seen corresponding path program 1 times [2024-11-11 20:54:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890612238] [2024-11-11 20:54:14,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:54:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,766 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,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890612238] [2024-11-11 20:54:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890612238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184609181] [2024-11-11 20:54:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:14,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:14,773 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,797 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2024-11-11 20:54:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 36 [2024-11-11 20:54:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,799 INFO L225 Difference]: With dead ends: 163 [2024-11-11 20:54:14,799 INFO L226 Difference]: Without dead ends: 106 [2024-11-11 20:54:14,800 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,800 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 144 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,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 144 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,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-11 20:54:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-11 20:54:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 89 states have internal predecessors, (107), 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,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-11-11 20:54:14,816 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 36 [2024-11-11 20:54:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-11-11 20:54:14,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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,817 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-11-11 20:54:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:54:14,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,818 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] [2024-11-11 20:54:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:54:14,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 165647039, now seen corresponding path program 1 times [2024-11-11 20:54:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599270942] [2024-11-11 20:54:14,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:54:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:54:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,952 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,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599270942] [2024-11-11 20:54:14,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599270942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:14,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725098971] [2024-11-11 20:54:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:14,956 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,027 INFO L93 Difference]: Finished difference Result 282 states and 371 transitions. [2024-11-11 20:54:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 42 [2024-11-11 20:54:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,029 INFO L225 Difference]: With dead ends: 282 [2024-11-11 20:54:15,029 INFO L226 Difference]: Without dead ends: 185 [2024-11-11 20:54:15,030 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:15,033 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 290 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:15,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 290 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:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-11 20:54:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-11 20:54:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 156 states have internal predecessors, (187), 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:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-11 20:54:15,061 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 42 [2024-11-11 20:54:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-11 20:54:15,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-11 20:54:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:15,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,063 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, 1] [2024-11-11 20:54:15,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:54:15,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1345519451, now seen corresponding path program 1 times [2024-11-11 20:54:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551900974] [2024-11-11 20:54:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,156 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551900974] [2024-11-11 20:54:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551900974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665860572] [2024-11-11 20:54:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:15,158 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,326 INFO L93 Difference]: Finished difference Result 451 states and 601 transitions. [2024-11-11 20:54:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 46 [2024-11-11 20:54:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,331 INFO L225 Difference]: With dead ends: 451 [2024-11-11 20:54:15,333 INFO L226 Difference]: Without dead ends: 354 [2024-11-11 20:54:15,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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,335 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 150 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-11 20:54:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-11-11 20:54:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 277 states have (on average 1.2707581227436824) internal successors, (352), 300 states have internal predecessors, (352), 39 states have call successors, (39), 27 states have call predecessors, (39), 31 states have return successors, (59), 37 states have call predecessors, (59), 39 states have call successors, (59) [2024-11-11 20:54:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2024-11-11 20:54:15,380 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 46 [2024-11-11 20:54:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,382 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2024-11-11 20:54:15,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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,382 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2024-11-11 20:54:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:15,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,387 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, 1] [2024-11-11 20:54:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:54:15,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1126664733, now seen corresponding path program 1 times [2024-11-11 20:54:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350123677] [2024-11-11 20:54:15,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,513 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,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350123677] [2024-11-11 20:54:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350123677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198045461] [2024-11-11 20:54:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:15,516 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,620 INFO L93 Difference]: Finished difference Result 614 states and 802 transitions. [2024-11-11 20:54:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 46 [2024-11-11 20:54:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,624 INFO L225 Difference]: With dead ends: 614 [2024-11-11 20:54:15,626 INFO L226 Difference]: Without dead ends: 350 [2024-11-11 20:54:15,627 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,627 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 251 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,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 251 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,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-11 20:54:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2024-11-11 20:54:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 277 states have (on average 1.263537906137184) internal successors, (350), 300 states have internal predecessors, (350), 39 states have call successors, (39), 27 states have call predecessors, (39), 31 states have return successors, (59), 37 states have call predecessors, (59), 39 states have call successors, (59) [2024-11-11 20:54:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 448 transitions. [2024-11-11 20:54:15,657 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 448 transitions. Word has length 46 [2024-11-11 20:54:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,657 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 448 transitions. [2024-11-11 20:54:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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,658 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 448 transitions. [2024-11-11 20:54:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:15,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,660 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, 1] [2024-11-11 20:54:15,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:54:15,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1944313183, now seen corresponding path program 1 times [2024-11-11 20:54:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599403155] [2024-11-11 20:54:15,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,747 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,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599403155] [2024-11-11 20:54:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599403155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603829067] [2024-11-11 20:54:15,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:15,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:15,750 INFO L87 Difference]: Start difference. First operand 348 states and 448 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:15,875 INFO L93 Difference]: Finished difference Result 696 states and 909 transitions. [2024-11-11 20:54:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 46 [2024-11-11 20:54:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:15,881 INFO L225 Difference]: With dead ends: 696 [2024-11-11 20:54:15,881 INFO L226 Difference]: Without dead ends: 355 [2024-11-11 20:54:15,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:15,882 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:15,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 313 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-11 20:54:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-11-11 20:54:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.249122807017544) internal successors, (356), 306 states have internal predecessors, (356), 37 states have call successors, (37), 26 states have call predecessors, (37), 30 states have return successors, (57), 35 states have call predecessors, (57), 37 states have call successors, (57) [2024-11-11 20:54:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 450 transitions. [2024-11-11 20:54:15,908 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 450 transitions. Word has length 46 [2024-11-11 20:54:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:15,909 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 450 transitions. [2024-11-11 20:54:15,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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,909 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 450 transitions. [2024-11-11 20:54:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:54:15,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:15,910 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:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:54:15,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:15,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:15,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1025339665, now seen corresponding path program 1 times [2024-11-11 20:54:15,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:15,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506795550] [2024-11-11 20:54:15,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:54:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,006 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:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506795550] [2024-11-11 20:54:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506795550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:54:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173221718] [2024-11-11 20:54:16,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:54:16,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:16,009 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:16,026 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:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 20:54:16,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:54:16,246 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:16,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:54:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173221718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:16,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:54:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-11-11 20:54:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545774335] [2024-11-11 20:54:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:54:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:54:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:16,249 INFO L87 Difference]: Start difference. First operand 353 states and 450 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 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:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:16,337 INFO L93 Difference]: Finished difference Result 1008 states and 1311 transitions. [2024-11-11 20:54:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 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 51 [2024-11-11 20:54:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:16,340 INFO L225 Difference]: With dead ends: 1008 [2024-11-11 20:54:16,341 INFO L226 Difference]: Without dead ends: 662 [2024-11-11 20:54:16,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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:16,343 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 43 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 440 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:16,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 440 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:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-11 20:54:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-11-11 20:54:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 531 states have (on average 1.231638418079096) internal successors, (654), 566 states have internal predecessors, (654), 71 states have call successors, (71), 51 states have call predecessors, (71), 57 states have return successors, (113), 67 states have call predecessors, (113), 71 states have call successors, (113) [2024-11-11 20:54:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 838 transitions. [2024-11-11 20:54:16,393 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 838 transitions. Word has length 51 [2024-11-11 20:54:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 838 transitions. [2024-11-11 20:54:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 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:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 838 transitions. [2024-11-11 20:54:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:54:16,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:16,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:16,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:54:16,596 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,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:16,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 468700430, now seen corresponding path program 1 times [2024-11-11 20:54:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487211678] [2024-11-11 20:54:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:54:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,679 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,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487211678] [2024-11-11 20:54:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487211678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:16,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:54:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356068857] [2024-11-11 20:54:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:16,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:54:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:54:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:16,682 INFO L87 Difference]: Start difference. First operand 660 states and 838 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:16,881 INFO L93 Difference]: Finished difference Result 1223 states and 1570 transitions. [2024-11-11 20:54:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:54:16,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 52 [2024-11-11 20:54:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:16,883 INFO L225 Difference]: With dead ends: 1223 [2024-11-11 20:54:16,883 INFO L226 Difference]: Without dead ends: 256 [2024-11-11 20:54:16,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:54:16,887 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 108 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:16,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 527 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-11 20:54:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 247. [2024-11-11 20:54:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 197 states have (on average 1.1878172588832487) internal successors, (234), 208 states have internal predecessors, (234), 26 states have call successors, (26), 23 states have call predecessors, (26), 23 states have return successors, (31), 24 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-11 20:54:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2024-11-11 20:54:16,900 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 52 [2024-11-11 20:54:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2024-11-11 20:54:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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,900 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2024-11-11 20:54:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 20:54:16,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:16,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:54:16,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1675825877, now seen corresponding path program 1 times [2024-11-11 20:54:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169652011] [2024-11-11 20:54:16,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:54:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:54:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:54:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:16,997 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,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:16,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169652011] [2024-11-11 20:54:16,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169652011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:16,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:16,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:54:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453196727] [2024-11-11 20:54:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:16,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:54:16,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:16,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:54:16,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:16,999 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:17,327 INFO L93 Difference]: Finished difference Result 477 states and 568 transitions. [2024-11-11 20:54:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:54:17,328 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-11 20:54:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:17,329 INFO L225 Difference]: With dead ends: 477 [2024-11-11 20:54:17,329 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:54:17,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:54:17,330 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 114 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:17,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 338 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:54:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:54:17,331 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:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:54:17,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2024-11-11 20:54:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:54:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:54:17,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:54:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:54:17,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:54:17,337 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:17,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:54:19,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:54:19,149 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or .cse0 (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) (let ((.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 1 |old(~methaneLevelCritical~0)|) .cse1) (and .cse0 .cse1) (and .cse2 .cse1))) (or (not .cse2) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or .cse0 (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) (let ((.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 1 |old(~methaneLevelCritical~0)|) .cse1) (and .cse0 .cse1) (and .cse2 .cse1))) (or (not .cse2) (= ~methaneLevelCritical~0 0))))) [2024-11-11 20:54:19,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:19,159 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse3 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse2 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse0 (not .cse3))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and (not .cse1) .cse2)) (let ((.cse4 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse4) (and .cse0 .cse4) (and (<= 1 ~methaneLevelCritical~0) .cse4)))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse3 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse2 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse0 (not .cse3))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and (not .cse1) .cse2)) (let ((.cse4 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse4) (and .cse0 .cse4) (and (<= 1 ~methaneLevelCritical~0) .cse4))))))) [2024-11-11 20:54:19,162 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:19,164 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (not (= ~pumpRunning~0 0)) .cse0) (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) (<= |old(~waterLevel~0)| 1) .cse0))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0) (and (not (= ~pumpRunning~0 0)) .cse0) (and (<= 1 ~methaneLevelCritical~0) .cse0))) [2024-11-11 20:54:19,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:54:19 BoogieIcfgContainer [2024-11-11 20:54:19,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:54:19,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:54:19,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:54:19,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:54:19,167 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:19,169 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:54:19,172 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:54:19,177 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:54:19,177 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:54:19,177 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:54:19,177 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:19,177 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:19,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:54:19,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:54:19,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:54:19,247 INFO L158 Benchmark]: Toolchain (without parser) took 6297.90ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 105.8MB in the beginning and 189.9MB in the end (delta: -84.1MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,248 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:54:19,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.15ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 143.3MB in the end (delta: -37.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 180.4MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,248 INFO L158 Benchmark]: Boogie Preprocessor took 36.15ms. Allocated memory is still 180.4MB. Free memory was 141.2MB in the beginning and 138.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,248 INFO L158 Benchmark]: RCFGBuilder took 390.98ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 121.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,249 INFO L158 Benchmark]: TraceAbstraction took 5223.72ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 120.2MB in the beginning and 198.2MB in the end (delta: -78.0MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,249 INFO L158 Benchmark]: Witness Printer took 80.43ms. Allocated memory is still 331.4MB. Free memory was 198.2MB in the beginning and 189.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:54:19,250 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.15ms. Allocated memory is still 180.4MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.15ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 143.3MB in the end (delta: -37.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 180.4MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.15ms. Allocated memory is still 180.4MB. Free memory was 141.2MB in the beginning and 138.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.98ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 121.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5223.72ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 120.2MB in the beginning and 198.2MB in the end (delta: -78.0MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. * Witness Printer took 80.43ms. Allocated memory is still 331.4MB. Free memory was 198.2MB in the beginning and 189.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] - GenericResultAtLocation [Line: 407]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] - GenericResultAtLocation [Line: 511]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] - GenericResultAtLocation [Line: 546]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] - GenericResultAtLocation [Line: 912]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] - 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: 507]: 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, 82 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, 722 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 3078 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1126 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 844 mSDtfsCounter, 1126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 1 NumberOfNonLiveVariables, 218 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: 164]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((pumpRunning != 0) && (splverifierCounter == 0)) && (0 != systemActive)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (splverifierCounter == 0)) && (0 != systemActive))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 257]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (waterLevel <= 1)) && (0 != systemActive))) Ensures: ((((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (waterLevel <= 1)) && (0 != systemActive))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 435]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((((\old(methaneLevelCritical) != 0) || (pumpRunning != 0)) || (0 < methaneLevelCritical)) && (((pumpRunning != 0) || (methaneLevelCritical == 0)) || (\old(methaneLevelCritical) < 1))) && ((((1 <= \old(methaneLevelCritical)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((\old(methaneLevelCritical) == 0) && (0 != systemActive)))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 447]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive))) Ensures: (((((pumpRunning != 0) || (\result == methaneLevelCritical)) && ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive)))) && ((methaneLevelCritical != 0) || (\result == 0))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 233]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((1 < \old(waterLevel)) || (waterLevel < 2)) && (((pumpRunning != 0) || (methaneLevelCritical != 0)) || (waterLevel < 2))) && ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((\old(pumpRunning) != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) && ((pumpRunning != 0) || (\old(pumpRunning) == 0))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 52]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 423]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive))) Ensures: (((((pumpRunning != 0) && (0 != systemActive)) || ((1 <= methaneLevelCritical) && (0 != systemActive))) || (((methaneLevelCritical == 0) && (\old(waterLevel) <= 1)) && (0 != systemActive))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:54:19,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE