./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product36.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 1849026681bb840017399851b7fbd7074a9bb56e2104927ac4a62c52d8de2e86 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:14:01,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:14:01,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:14:01,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:14:01,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:14:01,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:14:01,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:14:01,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:14:01,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:14:01,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:14:01,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:14:01,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:14:01,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:14:01,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:14:01,672 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:14:01,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:14:01,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:14:01,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:14:01,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:14:01,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:14:01,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:14:01,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:14:01,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:14:01,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:14:01,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:14:01,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:14:01,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:14:01,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:14:01,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:14:01,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:14:01,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:14:01,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:14:01,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:01,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:14:01,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:14:01,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:14:01,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:14:01,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:14:01,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:14:01,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:14:01,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:14:01,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:14:01,682 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 -> 1849026681bb840017399851b7fbd7074a9bb56e2104927ac4a62c52d8de2e86 [2024-11-08 15:14:01,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:14:01,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:14:01,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:14:01,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:14:01,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:14:01,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2024-11-08 15:14:03,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:14:03,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:14:03,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2024-11-08 15:14:03,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e04feec/737c73ea15b941d7865c9e993b14c655/FLAG0e5778f11 [2024-11-08 15:14:03,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e04feec/737c73ea15b941d7865c9e993b14c655 [2024-11-08 15:14:03,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:14:03,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:14:03,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:03,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:14:03,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:14:03,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38efd4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03, skipping insertion in model container [2024-11-08 15:14:03,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:14:04,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c[17676,17689] [2024-11-08 15:14:04,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:04,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:14:04,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-08 15:14:04,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] [2024-11-08 15:14:04,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] [2024-11-08 15:14:04,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [554] [2024-11-08 15:14:04,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [655] [2024-11-08 15:14:04,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [836] [2024-11-08 15:14:04,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [905] [2024-11-08 15:14:04,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [914] [2024-11-08 15:14:04,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c[17676,17689] [2024-11-08 15:14:04,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:04,236 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:14:04,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04 WrapperNode [2024-11-08 15:14:04,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:04,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:04,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:14:04,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:14:04,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,289 INFO L138 Inliner]: procedures = 55, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 182 [2024-11-08 15:14:04,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:04,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:14:04,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:14:04,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:14:04,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:14:04,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:14:04,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:14:04,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:14:04,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:14:04,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (1/1) ... [2024-11-08 15:14:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:04,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:14:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:14:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:14:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:14:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:14:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:14:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:14:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:14:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:14:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:14:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:14:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:14:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:14:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:14:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:14:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:14:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:14:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:14:04,529 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:14:04,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:14:04,791 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-08 15:14:04,791 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:14:04,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:14:04,814 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:14:04,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:04 BoogieIcfgContainer [2024-11-08 15:14:04,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:14:04,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:14:04,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:14:04,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:14:04,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:14:03" (1/3) ... [2024-11-08 15:14:04,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e247cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:04, skipping insertion in model container [2024-11-08 15:14:04,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:04" (2/3) ... [2024-11-08 15:14:04,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e247cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:04, skipping insertion in model container [2024-11-08 15:14:04,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:04" (3/3) ... [2024-11-08 15:14:04,843 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product36.cil.c [2024-11-08 15:14:04,857 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:14:04,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:14:04,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:14:04,939 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;@7609bdc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:14:04,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:14:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:14:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:14:04,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash 715093165, now seen corresponding path program 1 times [2024-11-08 15:14:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739168541] [2024-11-08 15:14:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:14:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739168541] [2024-11-08 15:14:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739168541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:14:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038158993] [2024-11-08 15:14:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:14:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:14:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:05,256 INFO L87 Difference]: Start difference. First operand has 81 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,281 INFO L93 Difference]: Finished difference Result 153 states and 208 transitions. [2024-11-08 15:14:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:14:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-08 15:14:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,290 INFO L225 Difference]: With dead ends: 153 [2024-11-08 15:14:05,290 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 15:14:05,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:05,297 INFO L432 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 15:14:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 15:14:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:14:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-08 15:14:05,335 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 25 [2024-11-08 15:14:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:05,335 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-08 15:14:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-08 15:14:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 15:14:05,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:05,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:05,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:14:05,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 793385251, now seen corresponding path program 1 times [2024-11-08 15:14:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578762973] [2024-11-08 15:14:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:14:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578762973] [2024-11-08 15:14:05,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578762973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:05,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:05,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243036035] [2024-11-08 15:14:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:05,513 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,538 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2024-11-08 15:14:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-08 15:14:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,540 INFO L225 Difference]: With dead ends: 104 [2024-11-08 15:14:05,541 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 15:14:05,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:05,543 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 15:14:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 15:14:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 15:14:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-08 15:14:05,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 26 [2024-11-08 15:14:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:05,553 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-08 15:14:05,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-08 15:14:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 15:14:05,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:05,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:14:05,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1810241430, now seen corresponding path program 1 times [2024-11-08 15:14:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735950396] [2024-11-08 15:14:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735950396] [2024-11-08 15:14:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735950396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327807874] [2024-11-08 15:14:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:05,667 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,688 INFO L93 Difference]: Finished difference Result 171 states and 223 transitions. [2024-11-08 15:14:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-08 15:14:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,691 INFO L225 Difference]: With dead ends: 171 [2024-11-08 15:14:05,691 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 15:14:05,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:05,692 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 15:14:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-08 15:14:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 97 states have internal predecessors, (120), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 15:14:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2024-11-08 15:14:05,708 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 31 [2024-11-08 15:14:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2024-11-08 15:14:05,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2024-11-08 15:14:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:14:05,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:05,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:14:05,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 423901217, now seen corresponding path program 1 times [2024-11-08 15:14:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072505222] [2024-11-08 15:14:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:14:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072505222] [2024-11-08 15:14:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072505222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:05,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892626237] [2024-11-08 15:14:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:05,868 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,986 INFO L93 Difference]: Finished difference Result 288 states and 382 transitions. [2024-11-08 15:14:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-08 15:14:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,991 INFO L225 Difference]: With dead ends: 288 [2024-11-08 15:14:05,991 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 15:14:05,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:14:05,997 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 273 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 15:14:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-08 15:14:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 155 states have internal predecessors, (191), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-08 15:14:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-08 15:14:06,026 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 34 [2024-11-08 15:14:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,027 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-08 15:14:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-08 15:14:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:14:06,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:14:06,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash 152019940, now seen corresponding path program 1 times [2024-11-08 15:14:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473287201] [2024-11-08 15:14:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:14:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473287201] [2024-11-08 15:14:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473287201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435841496] [2024-11-08 15:14:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:06,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:06,165 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:06,211 INFO L93 Difference]: Finished difference Result 519 states and 686 transitions. [2024-11-08 15:14:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:06,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 40 [2024-11-08 15:14:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:06,216 INFO L225 Difference]: With dead ends: 519 [2024-11-08 15:14:06,216 INFO L226 Difference]: Without dead ends: 342 [2024-11-08 15:14:06,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:06,220 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:06,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 144 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-08 15:14:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2024-11-08 15:14:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 267 states have (on average 1.3108614232209739) internal successors, (350), 282 states have internal predecessors, (350), 38 states have call successors, (38), 38 states have call predecessors, (38), 34 states have return successors, (50), 34 states have call predecessors, (50), 38 states have call successors, (50) [2024-11-08 15:14:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 438 transitions. [2024-11-08 15:14:06,282 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 438 transitions. Word has length 40 [2024-11-08 15:14:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,283 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 438 transitions. [2024-11-08 15:14:06,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 438 transitions. [2024-11-08 15:14:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:14:06,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:14:06,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1840963682, now seen corresponding path program 1 times [2024-11-08 15:14:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563089984] [2024-11-08 15:14:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:14:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563089984] [2024-11-08 15:14:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563089984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979251599] [2024-11-08 15:14:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:06,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:06,378 INFO L87 Difference]: Start difference. First operand 340 states and 438 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:06,463 INFO L93 Difference]: Finished difference Result 684 states and 894 transitions. [2024-11-08 15:14:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:06,464 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), 2 states have call successors, (2), 1 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 40 [2024-11-08 15:14:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:06,473 INFO L225 Difference]: With dead ends: 684 [2024-11-08 15:14:06,473 INFO L226 Difference]: Without dead ends: 352 [2024-11-08 15:14:06,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:06,479 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:06,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-08 15:14:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-08 15:14:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 294 states have internal predecessors, (362), 38 states have call successors, (38), 38 states have call predecessors, (38), 34 states have return successors, (50), 34 states have call predecessors, (50), 38 states have call successors, (50) [2024-11-08 15:14:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 450 transitions. [2024-11-08 15:14:06,563 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 450 transitions. Word has length 40 [2024-11-08 15:14:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,565 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 450 transitions. [2024-11-08 15:14:06,566 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 450 transitions. [2024-11-08 15:14:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:14:06,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:14:06,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 252615780, now seen corresponding path program 1 times [2024-11-08 15:14:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642660483] [2024-11-08 15:14:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:14:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642660483] [2024-11-08 15:14:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642660483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682691147] [2024-11-08 15:14:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:06,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:06,648 INFO L87 Difference]: Start difference. First operand 352 states and 450 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:06,697 INFO L93 Difference]: Finished difference Result 633 states and 812 transitions. [2024-11-08 15:14:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:06,698 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), 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 40 [2024-11-08 15:14:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:06,700 INFO L225 Difference]: With dead ends: 633 [2024-11-08 15:14:06,700 INFO L226 Difference]: Without dead ends: 289 [2024-11-08 15:14:06,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:14:06,701 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 59 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:06,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 332 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-08 15:14:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 281. [2024-11-08 15:14:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 235 states have internal predecessors, (282), 30 states have call successors, (30), 30 states have call predecessors, (30), 28 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2024-11-08 15:14:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 346 transitions. [2024-11-08 15:14:06,717 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 346 transitions. Word has length 40 [2024-11-08 15:14:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 346 transitions. [2024-11-08 15:14:06,717 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 346 transitions. [2024-11-08 15:14:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 15:14:06,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:14:06,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -812942464, now seen corresponding path program 1 times [2024-11-08 15:14:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631429329] [2024-11-08 15:14:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:14:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631429329] [2024-11-08 15:14:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631429329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:14:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534576161] [2024-11-08 15:14:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:14:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:14:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:14:06,774 INFO L87 Difference]: Start difference. First operand 281 states and 346 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 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-08 15:14:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:06,927 INFO L93 Difference]: Finished difference Result 584 states and 749 transitions. [2024-11-08 15:14:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 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 44 [2024-11-08 15:14:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:06,933 INFO L225 Difference]: With dead ends: 584 [2024-11-08 15:14:06,934 INFO L226 Difference]: Without dead ends: 582 [2024-11-08 15:14:06,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:06,936 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 123 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:06,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 187 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-08 15:14:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 510. [2024-11-08 15:14:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 410 states have (on average 1.2951219512195122) internal successors, (531), 441 states have internal predecessors, (531), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (81), 50 states have call predecessors, (81), 53 states have call successors, (81) [2024-11-08 15:14:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 665 transitions. [2024-11-08 15:14:06,980 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 665 transitions. Word has length 44 [2024-11-08 15:14:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,982 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 665 transitions. [2024-11-08 15:14:06,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 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-08 15:14:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 665 transitions. [2024-11-08 15:14:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 15:14:06,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:14:06,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1757301241, now seen corresponding path program 1 times [2024-11-08 15:14:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789328251] [2024-11-08 15:14:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:14:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:14:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:14:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789328251] [2024-11-08 15:14:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789328251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:14:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96134399] [2024-11-08 15:14:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:14:07,113 INFO L87 Difference]: Start difference. First operand 510 states and 665 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:14:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:07,374 INFO L93 Difference]: Finished difference Result 864 states and 1122 transitions. [2024-11-08 15:14:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:14:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 74 [2024-11-08 15:14:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:07,378 INFO L225 Difference]: With dead ends: 864 [2024-11-08 15:14:07,378 INFO L226 Difference]: Without dead ends: 362 [2024-11-08 15:14:07,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:14:07,382 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 205 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:07,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 243 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:14:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-08 15:14:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 327. [2024-11-08 15:14:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 261 states have (on average 1.2681992337164751) internal successors, (331), 281 states have internal predecessors, (331), 34 states have call successors, (34), 28 states have call predecessors, (34), 31 states have return successors, (48), 32 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-08 15:14:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2024-11-08 15:14:07,415 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 74 [2024-11-08 15:14:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2024-11-08 15:14:07,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:14:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2024-11-08 15:14:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:14:07,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:07,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:07,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:14:07,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:07,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -835138969, now seen corresponding path program 1 times [2024-11-08 15:14:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:07,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854233762] [2024-11-08 15:14:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:14:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:14:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 15:14:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:14:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854233762] [2024-11-08 15:14:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854233762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298048575] [2024-11-08 15:14:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:07,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:07,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:07,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:14:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:07,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:14:07,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 15:14:07,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:14:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:14:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298048575] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:14:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 13 [2024-11-08 15:14:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809115572] [2024-11-08 15:14:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:08,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:14:08,109 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:14:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:08,240 INFO L93 Difference]: Finished difference Result 923 states and 1197 transitions. [2024-11-08 15:14:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 76 [2024-11-08 15:14:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:08,244 INFO L225 Difference]: With dead ends: 923 [2024-11-08 15:14:08,245 INFO L226 Difference]: Without dead ends: 604 [2024-11-08 15:14:08,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:14:08,247 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:08,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 356 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-08 15:14:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 558. [2024-11-08 15:14:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 439 states have (on average 1.2369020501138952) internal successors, (543), 474 states have internal predecessors, (543), 61 states have call successors, (61), 51 states have call predecessors, (61), 57 states have return successors, (87), 57 states have call predecessors, (87), 61 states have call successors, (87) [2024-11-08 15:14:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 691 transitions. [2024-11-08 15:14:08,317 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 691 transitions. Word has length 76 [2024-11-08 15:14:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:08,318 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 691 transitions. [2024-11-08 15:14:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:14:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 691 transitions. [2024-11-08 15:14:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:14:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:08,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:08,341 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-08 15:14:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:14:08,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1210131555, now seen corresponding path program 1 times [2024-11-08 15:14:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:08,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952940653] [2024-11-08 15:14:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:08,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:14:08,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:14:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:14:08,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:14:08,597 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:14:08,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:14:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:14:08,604 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:08,684 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:14:08,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:14:08 BoogieIcfgContainer [2024-11-08 15:14:08,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:14:08,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:14:08,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:14:08,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:14:08,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:04" (3/4) ... [2024-11-08 15:14:08,689 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:14:08,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:14:08,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:14:08,760 INFO L158 Benchmark]: Toolchain (without parser) took 4991.37ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 106.9MB in the beginning and 133.0MB in the end (delta: -26.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,761 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 163.6MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:14:08,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.65ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 85.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 83.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,762 INFO L158 Benchmark]: Boogie Preprocessor took 63.89ms. Allocated memory is still 163.6MB. Free memory was 83.3MB in the beginning and 80.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,762 INFO L158 Benchmark]: RCFGBuilder took 459.16ms. Allocated memory is still 163.6MB. Free memory was 80.9MB in the beginning and 63.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,762 INFO L158 Benchmark]: TraceAbstraction took 3852.24ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 131.6MB in the beginning and 140.3MB in the end (delta: -8.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,763 INFO L158 Benchmark]: Witness Printer took 69.12ms. Allocated memory is still 203.4MB. Free memory was 139.3MB in the beginning and 133.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:14:08,764 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.25ms. Allocated memory is still 163.6MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.65ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 85.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 83.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.89ms. Allocated memory is still 163.6MB. Free memory was 83.3MB in the beginning and 80.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.16ms. Allocated memory is still 163.6MB. Free memory was 80.9MB in the beginning and 63.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3852.24ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 131.6MB in the beginning and 140.3MB in the end (delta: -8.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 69.12ms. Allocated memory is still 203.4MB. Free memory was 139.3MB in the beginning and 133.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] - GenericResultAtLocation [Line: 516]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [554] - GenericResultAtLocation [Line: 655]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [655] - GenericResultAtLocation [Line: 836]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [836] - GenericResultAtLocation [Line: 905]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [905] - GenericResultAtLocation [Line: 914]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [914] * 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 - CounterExampleResult [Line: 910]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L320] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int cleanupTimeShifts = 4; [L661] int pumpRunning = 0; [L662] int systemActive = 1; [L915] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L633] int retValue_acc ; [L634] int tmp ; [L638] FCALL select_helpers() [L639] FCALL select_features() [L640] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L640] RET, EXPR valid_product() [L640] tmp = valid_product() [L642] COND TRUE \read(tmp) [L644] FCALL setup() [L645] CALL runTest() [L626] CALL __utac_acc__Specification2_spec__1() [L920] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L626] RET __utac_acc__Specification2_spec__1() [L627] CALL test() [L838] int splverifierCounter ; [L839] int tmp ; [L840] int tmp___0 ; [L841] int tmp___1 ; [L842] int tmp___2 ; [L845] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L847] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L849] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L855] tmp = __VERIFIER_nondet_int() [L857] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L859] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L75] COND TRUE waterLevel < 2 [L76] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L859] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L865] tmp___0 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L869] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L87] COND FALSE !(\read(methaneLevelCritical)) [L90] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L869] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L875] tmp___2 = __VERIFIER_nondet_int() [L877] COND FALSE !(\read(tmp___2)) [L883] tmp___1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L894] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L669] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L676] COND TRUE \read(systemActive) [L678] CALL processEnvironment() [L698] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L701] COND TRUE ! pumpRunning [L703] CALL, EXPR isHighWaterLevel() [L795] int retValue_acc ; [L796] int tmp ; [L797] int tmp___0 ; [L801] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(waterLevel < 2) [L144] retValue_acc = 0 [L145] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L801] RET, EXPR isHighWaterSensorDry() [L801] tmp = isHighWaterSensorDry() [L803] COND FALSE !(\read(tmp)) [L806] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L808] retValue_acc = tmp___0 [L809] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L703] RET, EXPR isHighWaterLevel() [L703] tmp = isHighWaterLevel() [L705] COND TRUE \read(tmp) [L707] CALL activatePump() [L726] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L707] RET activatePump() [L678] RET processEnvironment() [L684] CALL __utac_acc__Specification2_spec__2() [L925] int tmp ; [L926] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L930] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L930] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L930] tmp = isMethaneLevelCritical() [L932] COND TRUE \read(tmp) [L934] CALL, EXPR isPumpRunning() [L750] int retValue_acc ; [L753] retValue_acc = pumpRunning [L754] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L934] RET, EXPR isPumpRunning() [L934] tmp___0 = isPumpRunning() [L936] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L937] COND FALSE !(\read(methAndRunningLastTime)) [L942] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L684] RET __utac_acc__Specification2_spec__2() [L894] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L847] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L849] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L855] tmp = __VERIFIER_nondet_int() [L857] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L865] tmp___0 = __VERIFIER_nondet_int() [L867] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L875] tmp___2 = __VERIFIER_nondet_int() [L877] COND FALSE !(\read(tmp___2)) [L883] tmp___1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L894] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L669] COND TRUE \read(pumpRunning) [L671] CALL lowerWaterLevel() [L63] COND TRUE waterLevel > 0 [L64] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L671] RET lowerWaterLevel() [L676] COND TRUE \read(systemActive) [L678] CALL processEnvironment() [L698] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L701] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L716] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L678] RET processEnvironment() [L684] CALL __utac_acc__Specification2_spec__2() [L925] int tmp ; [L926] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L930] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L930] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L930] tmp = isMethaneLevelCritical() [L932] COND TRUE \read(tmp) [L934] CALL, EXPR isPumpRunning() [L750] int retValue_acc ; [L753] retValue_acc = pumpRunning [L754] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L934] RET, EXPR isPumpRunning() [L934] tmp___0 = isPumpRunning() [L936] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L937] COND TRUE \read(methAndRunningLastTime) [L939] CALL __automaton_fail() [L910] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 2236 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1398 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 838 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558occurred in iteration=10, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 168 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 SizeOfPredicates, 1 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 90/94 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:14:08,805 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE