./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_product41.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e4978c2419e4c1644022dd229f44f68c9d14c10177af084ee11ac932b0c1016 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:19:02,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:19:02,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:19:02,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:19:02,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:19:02,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:19:02,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:19:02,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:19:02,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:19:02,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:19:02,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:19:02,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:19:02,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:19:02,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:19:02,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:19:02,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:19:02,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:19:02,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:19:02,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:19:02,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:19:02,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:19:02,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:19:02,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:19:02,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:19:02,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:19:02,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:19:02,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:19:02,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:19:02,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:19:02,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:19:02,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:19:02,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:19:02,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:19:02,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:19:02,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:19:02,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:19:02,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:19:02,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:19:02,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:19:02,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:19:02,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:19:02,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:19:02,943 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 -> 2e4978c2419e4c1644022dd229f44f68c9d14c10177af084ee11ac932b0c1016 [2024-11-18 14:19:03,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:19:03,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:19:03,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:19:03,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:19:03,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:19:03,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2024-11-18 14:19:04,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:19:04,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:19:04,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2024-11-18 14:19:05,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ff1ba06/9fbbf67151164fefbe10e518c9aa4425/FLAG9b44f7947 [2024-11-18 14:19:05,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ff1ba06/9fbbf67151164fefbe10e518c9aa4425 [2024-11-18 14:19:05,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:19:05,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:19:05,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:19:05,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:19:05,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:19:05,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261f5494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05, skipping insertion in model container [2024-11-18 14:19:05,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:19:05,398 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_product41.cil.c[17041,17054] [2024-11-18 14:19:05,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:05,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:19:05,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [49] [2024-11-18 14:19:05,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [91] [2024-11-18 14:19:05,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [457] [2024-11-18 14:19:05,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [634] [2024-11-18 14:19:05,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [731] [2024-11-18 14:19:05,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [797] [2024-11-18 14:19:05,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [835] [2024-11-18 14:19:05,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [844] [2024-11-18 14:19:05,501 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_product41.cil.c[17041,17054] [2024-11-18 14:19:05,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:05,534 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:19:05,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05 WrapperNode [2024-11-18 14:19:05,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:19:05,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:05,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:19:05,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:19:05,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,578 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 189 [2024-11-18 14:19:05,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:05,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:19:05,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:19:05,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:19:05,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,621 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-18 14:19:05,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:19:05,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:19:05,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:19:05,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:19:05,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (1/1) ... [2024-11-18 14:19:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:19:05,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:05,688 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-18 14:19:05,690 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-18 14:19:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:19:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:19:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:19:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:19:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:19:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:19:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:19:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-18 14:19:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-18 14:19:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:19:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:19:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:19:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:19:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:19:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:19:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:19:05,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:19:05,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:19:06,087 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-18 14:19:06,087 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:19:06,109 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:19:06,109 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:19:06,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:06 BoogieIcfgContainer [2024-11-18 14:19:06,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:19:06,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:19:06,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:19:06,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:19:06,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:19:05" (1/3) ... [2024-11-18 14:19:06,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1b15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:06, skipping insertion in model container [2024-11-18 14:19:06,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:05" (2/3) ... [2024-11-18 14:19:06,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1b15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:06, skipping insertion in model container [2024-11-18 14:19:06,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:06" (3/3) ... [2024-11-18 14:19:06,119 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product41.cil.c [2024-11-18 14:19:06,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:19:06,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:19:06,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:19:06,191 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;@498f712a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:19:06,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:19:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 14:19:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 14:19:06,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:06,205 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-18 14:19:06,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 728927255, now seen corresponding path program 1 times [2024-11-18 14:19:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120807657] [2024-11-18 14:19:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:06,453 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-18 14:19:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120807657] [2024-11-18 14:19:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120807657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:19:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88363087] [2024-11-18 14:19:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:06,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:19:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:06,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:19:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:19:06,489 INFO L87 Difference]: Start difference. First operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:06,513 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-11-18 14:19:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:19:06,516 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-18 14:19:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:06,526 INFO L225 Difference]: With dead ends: 153 [2024-11-18 14:19:06,526 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 14:19:06,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 14:19:06,534 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:06,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 14:19:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-18 14:19:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 14:19:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2024-11-18 14:19:06,571 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 25 [2024-11-18 14:19:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-18 14:19:06,571 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-18 14:19:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2024-11-18 14:19:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 14:19:06,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:06,573 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-18 14:19:06,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:19:06,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:06,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1592613902, now seen corresponding path program 1 times [2024-11-18 14:19:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:06,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225480655] [2024-11-18 14:19:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:06,706 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-18 14:19:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225480655] [2024-11-18 14:19:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225480655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:06,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486685774] [2024-11-18 14:19:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:06,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:06,714 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:06,730 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2024-11-18 14:19:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:06,733 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-18 14:19:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:06,734 INFO L225 Difference]: With dead ends: 109 [2024-11-18 14:19:06,736 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 14:19:06,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 14:19:06,737 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:06,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 14:19:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-18 14:19:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:19:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-18 14:19:06,754 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 26 [2024-11-18 14:19:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-18 14:19:06,757 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-18 14:19:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-18 14:19:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 14:19:06,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:06,759 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] [2024-11-18 14:19:06,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:19:06,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -140844723, now seen corresponding path program 1 times [2024-11-18 14:19:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335871344] [2024-11-18 14:19:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:06,913 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-18 14:19:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335871344] [2024-11-18 14:19:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335871344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:19:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486717736] [2024-11-18 14:19:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:19:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:19:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:19:06,919 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,025 INFO L93 Difference]: Finished difference Result 118 states and 155 transitions. [2024-11-18 14:19:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-18 14:19:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,030 INFO L225 Difference]: With dead ends: 118 [2024-11-18 14:19:07,030 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 14:19:07,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:19:07,032 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 199 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 14:19:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-18 14:19:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.32) internal successors, (66), 55 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:19:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-18 14:19:07,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 30 [2024-11-18 14:19:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-18 14:19:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-18 14:19:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 14:19:07,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,047 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] [2024-11-18 14:19:07,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:19:07,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 243646208, now seen corresponding path program 1 times [2024-11-18 14:19:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363881794] [2024-11-18 14:19:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,095 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-18 14:19:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363881794] [2024-11-18 14:19:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363881794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665556048] [2024-11-18 14:19:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:07,098 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,139 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2024-11-18 14:19:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:07,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-18 14:19:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,141 INFO L225 Difference]: With dead ends: 158 [2024-11-18 14:19:07,141 INFO L226 Difference]: Without dead ends: 103 [2024-11-18 14:19:07,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 14:19:07,143 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-18 14:19:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-11-18 14:19:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 86 states have internal predecessors, (104), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:19:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-18 14:19:07,165 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 35 [2024-11-18 14:19:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-18 14:19:07,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-18 14:19:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 14:19:07,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,167 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] [2024-11-18 14:19:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:19:07,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1746897546, now seen corresponding path program 1 times [2024-11-18 14:19:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992817094] [2024-11-18 14:19:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,294 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-18 14:19:07,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992817094] [2024-11-18 14:19:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992817094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:19:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948516550] [2024-11-18 14:19:07,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:19:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:19:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:19:07,296 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,327 INFO L93 Difference]: Finished difference Result 196 states and 255 transitions. [2024-11-18 14:19:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:19:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-18 14:19:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,332 INFO L225 Difference]: With dead ends: 196 [2024-11-18 14:19:07,332 INFO L226 Difference]: Without dead ends: 103 [2024-11-18 14:19:07,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:19:07,334 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-18 14:19:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-18 14:19:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.308641975308642) internal successors, (106), 88 states have internal predecessors, (106), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:19:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2024-11-18 14:19:07,360 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 41 [2024-11-18 14:19:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,360 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2024-11-18 14:19:07,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2024-11-18 14:19:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 14:19:07,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,362 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] [2024-11-18 14:19:07,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:19:07,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash -859126008, now seen corresponding path program 1 times [2024-11-18 14:19:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009612192] [2024-11-18 14:19:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,492 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-18 14:19:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009612192] [2024-11-18 14:19:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009612192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897978555] [2024-11-18 14:19:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:07,495 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,567 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2024-11-18 14:19:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-18 14:19:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,571 INFO L225 Difference]: With dead ends: 197 [2024-11-18 14:19:07,571 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 14:19:07,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 14:19:07,573 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 53 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 294 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 14:19:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 14:19:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2875) internal successors, (103), 87 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:19:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2024-11-18 14:19:07,584 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 41 [2024-11-18 14:19:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,585 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2024-11-18 14:19:07,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2024-11-18 14:19:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 14:19:07,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:19:07,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647987, now seen corresponding path program 1 times [2024-11-18 14:19:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251482795] [2024-11-18 14:19:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:19:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251482795] [2024-11-18 14:19:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251482795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761361662] [2024-11-18 14:19:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:07,670 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,695 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2024-11-18 14:19:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:07,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-18 14:19:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,698 INFO L225 Difference]: With dead ends: 199 [2024-11-18 14:19:07,699 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 14:19:07,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 14:19:07,700 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-18 14:19:07,701 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-18 14:19:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 14:19:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-18 14:19:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 90 states have internal predecessors, (106), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:19:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2024-11-18 14:19:07,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 47 [2024-11-18 14:19:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,717 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2024-11-18 14:19:07,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2024-11-18 14:19:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 14:19:07,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:19:07,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 971128657, now seen corresponding path program 1 times [2024-11-18 14:19:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989688263] [2024-11-18 14:19:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:19:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989688263] [2024-11-18 14:19:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989688263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21644023] [2024-11-18 14:19:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:07,815 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,835 INFO L93 Difference]: Finished difference Result 243 states and 305 transitions. [2024-11-18 14:19:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-18 14:19:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,837 INFO L225 Difference]: With dead ends: 243 [2024-11-18 14:19:07,837 INFO L226 Difference]: Without dead ends: 146 [2024-11-18 14:19:07,838 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-18 14:19:07,840 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 146 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-18 14:19:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-18 14:19:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 123 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-18 14:19:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-11-18 14:19:07,858 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 47 [2024-11-18 14:19:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,858 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-11-18 14:19:07,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-11-18 14:19:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-18 14:19:07,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:19:07,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1356661239, now seen corresponding path program 1 times [2024-11-18 14:19:07,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852296028] [2024-11-18 14:19:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:19:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852296028] [2024-11-18 14:19:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852296028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994235248] [2024-11-18 14:19:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:07,935 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 14:19:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,962 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2024-11-18 14:19:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-18 14:19:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,964 INFO L225 Difference]: With dead ends: 221 [2024-11-18 14:19:07,964 INFO L226 Difference]: Without dead ends: 219 [2024-11-18 14:19:07,965 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-18 14:19:07,965 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:07,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-18 14:19:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2024-11-18 14:19:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 182 states have internal predecessors, (213), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (30), 22 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-18 14:19:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2024-11-18 14:19:07,991 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 51 [2024-11-18 14:19:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,992 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2024-11-18 14:19:07,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 14:19:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2024-11-18 14:19:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 14:19:07,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,994 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:19:07,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash 490809610, now seen corresponding path program 1 times [2024-11-18 14:19:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528350319] [2024-11-18 14:19:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 14:19:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528350319] [2024-11-18 14:19:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528350319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668066869] [2024-11-18 14:19:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:19:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:08,179 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-18 14:19:08,180 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-18 14:19:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 14:19:08,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:19:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 14:19:08,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:19:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 14:19:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668066869] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 14:19:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 11 [2024-11-18 14:19:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431039488] [2024-11-18 14:19:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:08,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:19:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:08,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:19:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:19:08,618 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 14:19:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:08,726 INFO L93 Difference]: Finished difference Result 602 states and 766 transitions. [2024-11-18 14:19:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:19:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2024-11-18 14:19:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:08,730 INFO L225 Difference]: With dead ends: 602 [2024-11-18 14:19:08,730 INFO L226 Difference]: Without dead ends: 395 [2024-11-18 14:19:08,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 14:19:08,733 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:08,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 353 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-18 14:19:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 346. [2024-11-18 14:19:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 269 states have (on average 1.241635687732342) internal successors, (334), 290 states have internal predecessors, (334), 40 states have call successors, (40), 37 states have call predecessors, (40), 36 states have return successors, (52), 37 states have call predecessors, (52), 40 states have call successors, (52) [2024-11-18 14:19:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 426 transitions. [2024-11-18 14:19:08,770 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 426 transitions. Word has length 82 [2024-11-18 14:19:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:08,770 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 426 transitions. [2024-11-18 14:19:08,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 14:19:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 426 transitions. [2024-11-18 14:19:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 14:19:08,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:08,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:08,792 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-18 14:19:08,973 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-18 14:19:08,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:08,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash -501413274, now seen corresponding path program 1 times [2024-11-18 14:19:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816255293] [2024-11-18 14:19:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:08,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:19:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816255293] [2024-11-18 14:19:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816255293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994434239] [2024-11-18 14:19:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:19:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:09,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:19:09,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:19:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:19:09,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:19:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 14:19:09,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:19:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994434239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:09,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:19:09,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-18 14:19:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017230809] [2024-11-18 14:19:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:19:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:19:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:19:09,464 INFO L87 Difference]: Start difference. First operand 346 states and 426 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-18 14:19:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:09,599 INFO L93 Difference]: Finished difference Result 678 states and 843 transitions. [2024-11-18 14:19:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:19:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2024-11-18 14:19:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:09,602 INFO L225 Difference]: With dead ends: 678 [2024-11-18 14:19:09,604 INFO L226 Difference]: Without dead ends: 340 [2024-11-18 14:19:09,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:19:09,607 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 47 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:09,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 532 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-18 14:19:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 309. [2024-11-18 14:19:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.2333333333333334) internal successors, (296), 255 states have internal predecessors, (296), 36 states have call successors, (36), 34 states have call predecessors, (36), 32 states have return successors, (42), 34 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-18 14:19:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 374 transitions. [2024-11-18 14:19:09,636 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 374 transitions. Word has length 86 [2024-11-18 14:19:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:09,637 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 374 transitions. [2024-11-18 14:19:09,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-18 14:19:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2024-11-18 14:19:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-18 14:19:09,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:09,640 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:19:09,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 14:19:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 14:19:09,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1685387601, now seen corresponding path program 1 times [2024-11-18 14:19:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520507162] [2024-11-18 14:19:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:09,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:19:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:09,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:19:09,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:19:09,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:19:09,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:19:09,932 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:10,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:19:10,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:19:10 BoogieIcfgContainer [2024-11-18 14:19:10,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:19:10,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:19:10,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:19:10,040 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:19:10,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:06" (3/4) ... [2024-11-18 14:19:10,042 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:19:10,147 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:19:10,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:19:10,149 INFO L158 Benchmark]: Toolchain (without parser) took 5117.05ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.8MB in the beginning and 59.7MB in the end (delta: 70.0MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,149 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:19:10,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.11ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 108.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,149 INFO L158 Benchmark]: Boogie Preprocessor took 70.80ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,150 INFO L158 Benchmark]: RCFGBuilder took 458.84ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 86.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,151 INFO L158 Benchmark]: TraceAbstraction took 3925.23ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 85.8MB in the beginning and 69.2MB in the end (delta: 16.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,151 INFO L158 Benchmark]: Witness Printer took 108.64ms. Allocated memory is still 195.0MB. Free memory was 68.1MB in the beginning and 59.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 14:19:10,152 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.22ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.11ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 108.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.80ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.84ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 86.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3925.23ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 85.8MB in the beginning and 69.2MB in the end (delta: 16.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 108.64ms. Allocated memory is still 195.0MB. Free memory was 68.1MB in the beginning and 59.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [49] - GenericResultAtLocation [Line: 91]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [91] - GenericResultAtLocation [Line: 457]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [457] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [634] - GenericResultAtLocation [Line: 731]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [731] - GenericResultAtLocation [Line: 797]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [797] - GenericResultAtLocation [Line: 835]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [835] - GenericResultAtLocation [Line: 844]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [844] * 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: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L53] int methAndRunningLastTime ; [L261] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L465] int pumpRunning = 0; [L466] int systemActive = 1; [L638] int waterLevel = 1; [L639] int methaneLevelCritical = 0; [L845] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L919] int retValue_acc ; [L920] int tmp ; [L924] FCALL select_helpers() [L925] FCALL select_features() [L926] CALL, EXPR valid_product() [L827] int retValue_acc ; [L830] retValue_acc = 1 [L831] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L926] RET, EXPR valid_product() [L926] tmp = valid_product() [L928] COND TRUE \read(tmp) [L930] FCALL setup() [L931] CALL runTest() [L912] CALL __utac_acc__Specification2_spec__1() [L58] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L912] RET __utac_acc__Specification2_spec__1() [L913] CALL test() [L734] int splverifierCounter ; [L735] int tmp ; [L736] int tmp___0 ; [L737] int tmp___1 ; [L738] int tmp___2 ; [L741] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L743] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L745] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L751] tmp = __VERIFIER_nondet_int() [L753] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L755] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L656] COND TRUE waterLevel < 2 [L657] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L755] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L761] tmp___0 = __VERIFIER_nondet_int() [L763] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L771] tmp___2 = __VERIFIER_nondet_int() [L773] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L786] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L472] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L479] COND TRUE \read(systemActive) [L481] CALL processEnvironment() [L501] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L504] COND TRUE ! pumpRunning [L506] CALL, EXPR isHighWaterLevel() [L616] int retValue_acc ; [L617] int tmp ; [L618] int tmp___0 ; [L622] CALL, EXPR isHighWaterSensorDry() [L718] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L721] COND FALSE !(waterLevel < 2) [L725] retValue_acc = 0 [L726] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L622] RET, EXPR isHighWaterSensorDry() [L622] tmp = isHighWaterSensorDry() [L624] COND FALSE !(\read(tmp)) [L627] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L629] retValue_acc = tmp___0 [L630] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] RET, EXPR isHighWaterLevel() [L506] tmp = isHighWaterLevel() [L508] COND TRUE \read(tmp) [L510] CALL activatePump() [L535] int tmp ; [L539] CALL, EXPR isMethaneAlarm() [L560] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L677] int retValue_acc ; [L680] retValue_acc = methaneLevelCritical [L681] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] retValue_acc = isMethaneLevelCritical() [L566] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L539] RET, EXPR isMethaneAlarm() [L539] tmp = isMethaneAlarm() [L541] COND FALSE !(\read(tmp)) [L545] CALL activatePump__wrappee__highWaterSensor() [L529] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L545] RET activatePump__wrappee__highWaterSensor() [L510] RET activatePump() [L481] RET processEnvironment() [L487] CALL __utac_acc__Specification2_spec__2() [L63] int tmp ; [L64] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L68] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L677] int retValue_acc ; [L680] retValue_acc = methaneLevelCritical [L681] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L68] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L68] tmp = isMethaneLevelCritical() [L70] COND FALSE !(\read(tmp)) [L86] methAndRunningLastTime = 0 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L487] RET __utac_acc__Specification2_spec__2() [L786] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L743] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L745] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L751] tmp = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L761] tmp___0 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L765] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L668] COND FALSE !(\read(methaneLevelCritical)) [L671] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L765] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L771] tmp___2 = __VERIFIER_nondet_int() [L773] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L786] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L472] COND TRUE \read(pumpRunning) [L474] CALL lowerWaterLevel() [L644] COND TRUE waterLevel > 0 [L645] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L474] RET lowerWaterLevel() [L479] COND TRUE \read(systemActive) [L481] CALL processEnvironment() [L501] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L504] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L519] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] RET processEnvironment() [L487] CALL __utac_acc__Specification2_spec__2() [L63] int tmp ; [L64] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L68] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L677] int retValue_acc ; [L680] retValue_acc = methaneLevelCritical [L681] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L68] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L68] tmp = isMethaneLevelCritical() [L70] COND TRUE \read(tmp) [L72] CALL, EXPR isPumpRunning() [L571] int retValue_acc ; [L574] retValue_acc = pumpRunning [L575] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L72] RET, EXPR isPumpRunning() [L72] tmp___0 = isPumpRunning() [L74] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L75] COND FALSE !(\read(methAndRunningLastTime)) [L80] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L487] RET __utac_acc__Specification2_spec__2() [L786] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L743] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L745] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L751] tmp = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L761] tmp___0 = __VERIFIER_nondet_int() [L763] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L771] tmp___2 = __VERIFIER_nondet_int() [L773] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L786] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L472] COND TRUE \read(pumpRunning) [L474] CALL lowerWaterLevel() [L644] COND TRUE waterLevel > 0 [L645] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L474] RET lowerWaterLevel() [L479] COND TRUE \read(systemActive) [L481] CALL processEnvironment() [L501] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L504] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L519] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L481] RET processEnvironment() [L487] CALL __utac_acc__Specification2_spec__2() [L63] int tmp ; [L64] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L68] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L677] int retValue_acc ; [L680] retValue_acc = methaneLevelCritical [L681] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L68] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L68] tmp = isMethaneLevelCritical() [L70] COND TRUE \read(tmp) [L72] CALL, EXPR isPumpRunning() [L571] int retValue_acc ; [L574] retValue_acc = pumpRunning [L575] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L72] RET, EXPR isPumpRunning() [L72] tmp___0 = isPumpRunning() [L74] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L75] COND TRUE \read(methAndRunningLastTime) [L77] CALL __automaton_fail() [L840] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 2586 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1626 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 960 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 86 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 793 NumberOfCodeBlocks, 793 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1347 SizeOfPredicates, 1 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 144/154 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-18 14:19:10,184 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