./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.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 e1c4d106eb612b91999bdca4bb49f57df1223b70f35ecd881d6daa6062cb1b0b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:09:16,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:09:16,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:09:16,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:09:16,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:09:16,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:09:16,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:09:16,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:09:16,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:09:16,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:09:16,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:09:16,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:09:16,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:09:16,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:09:16,960 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:09:16,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:09:16,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:09:16,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:09:16,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:09:16,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:09:16,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:09:16,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:09:16,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:09:16,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:09:16,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:09:16,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:09:16,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:09:16,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:09:16,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:09:16,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:09:16,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:09:16,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:09:16,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:16,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:09:16,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:09:16,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:09:16,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:09:16,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:09:16,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:09:16,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:09:16,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:09:16,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:09:16,972 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 -> e1c4d106eb612b91999bdca4bb49f57df1223b70f35ecd881d6daa6062cb1b0b [2024-10-14 03:09:17,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:09:17,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:09:17,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:09:17,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:09:17,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:09:17,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c [2024-10-14 03:09:18,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:09:18,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:09:18,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c [2024-10-14 03:09:18,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb5b6267/f498020b251347df8c6077a77bf6b57a/FLAGa5eb1de95 [2024-10-14 03:09:19,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb5b6267/f498020b251347df8c6077a77bf6b57a [2024-10-14 03:09:19,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:09:19,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:09:19,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:19,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:09:19,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:09:19,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d654760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19, skipping insertion in model container [2024-10-14 03:09:19,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:09:19,290 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c[1605,1618] [2024-10-14 03:09:19,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:19,429 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:09:19,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-14 03:09:19,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] [2024-10-14 03:09:19,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [96] [2024-10-14 03:09:19,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [165] [2024-10-14 03:09:19,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [398] [2024-10-14 03:09:19,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [502] [2024-10-14 03:09:19,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [536] [2024-10-14 03:09:19,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] [2024-10-14 03:09:19,444 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c[1605,1618] [2024-10-14 03:09:19,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:19,541 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:09:19,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19 WrapperNode [2024-10-14 03:09:19,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:19,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:19,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:09:19,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:09:19,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,599 INFO L138 Inliner]: procedures = 56, calls = 103, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 228 [2024-10-14 03:09:19,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:19,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:09:19,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:09:19,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:09:19,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,635 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-10-14 03:09:19,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:09:19,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:09:19,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:09:19,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:09:19,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (1/1) ... [2024-10-14 03:09:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:19,684 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-10-14 03:09:19,687 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-10-14 03:09:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:09:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:09:19,727 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:09:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:09:19,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:09:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:09:19,728 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:09:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:09:19,728 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:09:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:19,729 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:09:19,729 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-14 03:09:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-14 03:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-14 03:09:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-14 03:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:09:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:09:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:09:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:09:19,811 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:09:19,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:09:20,099 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-14 03:09:20,100 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:09:20,160 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:09:20,160 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:09:20,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:20 BoogieIcfgContainer [2024-10-14 03:09:20,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:09:20,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:09:20,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:09:20,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:09:20,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:09:19" (1/3) ... [2024-10-14 03:09:20,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d6886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:20, skipping insertion in model container [2024-10-14 03:09:20,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:19" (2/3) ... [2024-10-14 03:09:20,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d6886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:20, skipping insertion in model container [2024-10-14 03:09:20,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:20" (3/3) ... [2024-10-14 03:09:20,168 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product53.cil.c [2024-10-14 03:09:20,180 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:09:20,181 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:09:20,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:09:20,238 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;@2331851b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:09:20,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:09:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 64 states have internal predecessors, (83), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 03:09:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:09:20,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:20,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:20,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1207189717, now seen corresponding path program 1 times [2024-10-14 03:09:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326243510] [2024-10-14 03:09:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:09:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:20,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326243510] [2024-10-14 03:09:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326243510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:20,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:20,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596685919] [2024-10-14 03:09:20,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:09:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:09:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:20,466 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 64 states have internal predecessors, (83), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-14 03:09:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:20,546 INFO L93 Difference]: Finished difference Result 160 states and 231 transitions. [2024-10-14 03:09:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:09:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2024-10-14 03:09:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:20,556 INFO L225 Difference]: With dead ends: 160 [2024-10-14 03:09:20,558 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 03:09:20,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:20,569 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:20,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 03:09:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 03:09:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 60 states have internal predecessors, (73), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 03:09:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-14 03:09:20,619 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 17 [2024-10-14 03:09:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:20,620 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-14 03:09:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-14 03:09:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-14 03:09:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:09:20,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:20,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:20,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:09:20,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -848471436, now seen corresponding path program 1 times [2024-10-14 03:09:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609746023] [2024-10-14 03:09:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:09:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609746023] [2024-10-14 03:09:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609746023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349218579] [2024-10-14 03:09:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:20,692 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-14 03:09:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:20,734 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2024-10-14 03:09:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2024-10-14 03:09:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:20,735 INFO L225 Difference]: With dead ends: 125 [2024-10-14 03:09:20,735 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 03:09:20,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:20,737 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:20,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 03:09:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 03:09:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 55 states have internal predecessors, (67), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 03:09:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-10-14 03:09:20,746 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 18 [2024-10-14 03:09:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-10-14 03:09:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-14 03:09:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-10-14 03:09:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:09:20,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:20,747 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] [2024-10-14 03:09:20,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:09:20,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:20,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 126584986, now seen corresponding path program 1 times [2024-10-14 03:09:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815380801] [2024-10-14 03:09:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815380801] [2024-10-14 03:09:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815380801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:20,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836936206] [2024-10-14 03:09:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:20,837 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 03:09:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:20,882 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2024-10-14 03:09:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2024-10-14 03:09:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:20,884 INFO L225 Difference]: With dead ends: 134 [2024-10-14 03:09:20,884 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 03:09:20,886 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-10-14 03:09:20,887 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:20,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 78 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 03:09:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 03:09:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.434782608695652) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 03:09:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-14 03:09:20,903 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 21 [2024-10-14 03:09:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-14 03:09:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 03:09:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-14 03:09:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:09:20,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:20,906 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:09:20,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:09:20,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:20,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1271791400, now seen corresponding path program 1 times [2024-10-14 03:09:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074830840] [2024-10-14 03:09:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:09:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:09:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:09:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074830840] [2024-10-14 03:09:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074830840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291347505] [2024-10-14 03:09:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:20,996 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:09:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:21,231 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2024-10-14 03:09:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:09:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 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 31 [2024-10-14 03:09:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:21,233 INFO L225 Difference]: With dead ends: 205 [2024-10-14 03:09:21,233 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 03:09:21,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:21,235 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 134 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:21,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 151 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 03:09:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-10-14 03:09:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 101 states have internal predecessors, (128), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-14 03:09:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-10-14 03:09:21,253 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 31 [2024-10-14 03:09:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:21,253 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-10-14 03:09:21,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:09:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-10-14 03:09:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:09:21,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:21,254 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] [2024-10-14 03:09:21,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:09:21,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2139911118, now seen corresponding path program 1 times [2024-10-14 03:09:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698380485] [2024-10-14 03:09:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:09:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698380485] [2024-10-14 03:09:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698380485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:21,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190971469] [2024-10-14 03:09:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:21,367 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:09:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:21,562 INFO L93 Difference]: Finished difference Result 351 states and 492 transitions. [2024-10-14 03:09:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-14 03:09:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:21,565 INFO L225 Difference]: With dead ends: 351 [2024-10-14 03:09:21,565 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 03:09:21,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:09:21,571 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 127 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:21,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 280 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 03:09:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2024-10-14 03:09:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 152 states have (on average 1.355263157894737) internal successors, (206), 162 states have internal predecessors, (206), 30 states have call successors, (30), 26 states have call predecessors, (30), 31 states have return successors, (49), 32 states have call predecessors, (49), 30 states have call successors, (49) [2024-10-14 03:09:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2024-10-14 03:09:21,595 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 38 [2024-10-14 03:09:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2024-10-14 03:09:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:09:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2024-10-14 03:09:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:09:21,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:21,597 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] [2024-10-14 03:09:21,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:09:21,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:21,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash -466112436, now seen corresponding path program 1 times [2024-10-14 03:09:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784581388] [2024-10-14 03:09:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:09:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:21,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784581388] [2024-10-14 03:09:21,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784581388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:21,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:21,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:21,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980248216] [2024-10-14 03:09:21,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:21,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:21,671 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:09:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:21,806 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2024-10-14 03:09:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:09:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 03:09:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:21,808 INFO L225 Difference]: With dead ends: 432 [2024-10-14 03:09:21,808 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 03:09:21,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:21,810 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:21,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 226 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 03:09:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2024-10-14 03:09:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 166 states have internal predecessors, (210), 30 states have call successors, (30), 26 states have call predecessors, (30), 31 states have return successors, (49), 32 states have call predecessors, (49), 30 states have call successors, (49) [2024-10-14 03:09:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2024-10-14 03:09:21,865 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 38 [2024-10-14 03:09:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2024-10-14 03:09:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:09:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2024-10-14 03:09:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:09:21,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:21,867 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] [2024-10-14 03:09:21,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:09:21,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2054460338, now seen corresponding path program 1 times [2024-10-14 03:09:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957098282] [2024-10-14 03:09:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:09:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957098282] [2024-10-14 03:09:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957098282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260354816] [2024-10-14 03:09:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:21,975 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:09:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:22,105 INFO L93 Difference]: Finished difference Result 402 states and 544 transitions. [2024-10-14 03:09:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:09:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 03:09:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:22,107 INFO L225 Difference]: With dead ends: 402 [2024-10-14 03:09:22,108 INFO L226 Difference]: Without dead ends: 186 [2024-10-14 03:09:22,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:09:22,109 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 131 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:22,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 170 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-14 03:09:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-10-14 03:09:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 140 states have internal predecessors, (173), 26 states have call successors, (26), 22 states have call predecessors, (26), 26 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2024-10-14 03:09:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2024-10-14 03:09:22,123 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 38 [2024-10-14 03:09:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2024-10-14 03:09:22,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:09:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2024-10-14 03:09:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 03:09:22,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:22,124 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-10-14 03:09:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:09:22,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:22,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1953805507, now seen corresponding path program 1 times [2024-10-14 03:09:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:22,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363453161] [2024-10-14 03:09:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:09:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:09:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363453161] [2024-10-14 03:09:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363453161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848351244] [2024-10-14 03:09:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:22,195 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:22,336 INFO L93 Difference]: Finished difference Result 367 states and 470 transitions. [2024-10-14 03:09:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:09:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-14 03:09:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:22,338 INFO L225 Difference]: With dead ends: 367 [2024-10-14 03:09:22,338 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 03:09:22,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:22,340 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 104 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:22,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 199 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 03:09:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-10-14 03:09:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 139 states have internal predecessors, (170), 26 states have call successors, (26), 22 states have call predecessors, (26), 26 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2024-10-14 03:09:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2024-10-14 03:09:22,362 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 41 [2024-10-14 03:09:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:22,363 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2024-10-14 03:09:22,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2024-10-14 03:09:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 03:09:22,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:22,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:22,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:09:22,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -360772938, now seen corresponding path program 1 times [2024-10-14 03:09:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014931171] [2024-10-14 03:09:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:09:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:09:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014931171] [2024-10-14 03:09:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014931171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115640825] [2024-10-14 03:09:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:22,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:22,444 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:22,709 INFO L93 Difference]: Finished difference Result 352 states and 459 transitions. [2024-10-14 03:09:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:09:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-14 03:09:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:22,712 INFO L225 Difference]: With dead ends: 352 [2024-10-14 03:09:22,712 INFO L226 Difference]: Without dead ends: 217 [2024-10-14 03:09:22,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:09:22,715 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 187 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:22,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 244 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-14 03:09:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2024-10-14 03:09:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 141 states have internal predecessors, (165), 26 states have call successors, (26), 22 states have call predecessors, (26), 27 states have return successors, (32), 27 states have call predecessors, (32), 26 states have call successors, (32) [2024-10-14 03:09:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2024-10-14 03:09:22,754 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 42 [2024-10-14 03:09:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2024-10-14 03:09:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2024-10-14 03:09:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 03:09:22,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:22,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:22,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:09:22,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:22,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 889053331, now seen corresponding path program 1 times [2024-10-14 03:09:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:22,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353510932] [2024-10-14 03:09:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:09:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:09:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:09:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353510932] [2024-10-14 03:09:22,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353510932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:22,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686484641] [2024-10-14 03:09:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:22,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:22,845 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:09:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:23,029 INFO L93 Difference]: Finished difference Result 354 states and 436 transitions. [2024-10-14 03:09:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-14 03:09:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:23,032 INFO L225 Difference]: With dead ends: 354 [2024-10-14 03:09:23,032 INFO L226 Difference]: Without dead ends: 217 [2024-10-14 03:09:23,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:09:23,033 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 124 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:23,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 156 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-14 03:09:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2024-10-14 03:09:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 131 states have (on average 1.251908396946565) internal successors, (164), 141 states have internal predecessors, (164), 26 states have call successors, (26), 22 states have call predecessors, (26), 27 states have return successors, (32), 27 states have call predecessors, (32), 26 states have call successors, (32) [2024-10-14 03:09:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2024-10-14 03:09:23,046 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 45 [2024-10-14 03:09:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:23,047 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2024-10-14 03:09:23,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:09:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2024-10-14 03:09:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 03:09:23,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:23,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:23,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:09:23,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1487847063, now seen corresponding path program 1 times [2024-10-14 03:09:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186374864] [2024-10-14 03:09:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:09:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:09:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:09:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186374864] [2024-10-14 03:09:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186374864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330504245] [2024-10-14 03:09:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:23,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:23,101 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:09:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:23,375 INFO L93 Difference]: Finished difference Result 437 states and 555 transitions. [2024-10-14 03:09:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:09:23,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-14 03:09:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:23,379 INFO L225 Difference]: With dead ends: 437 [2024-10-14 03:09:23,379 INFO L226 Difference]: Without dead ends: 300 [2024-10-14 03:09:23,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:09:23,380 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:23,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 168 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-14 03:09:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2024-10-14 03:09:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 210 states have (on average 1.2380952380952381) internal successors, (260), 226 states have internal predecessors, (260), 46 states have call successors, (46), 35 states have call predecessors, (46), 41 states have return successors, (60), 44 states have call predecessors, (60), 46 states have call successors, (60) [2024-10-14 03:09:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 366 transitions. [2024-10-14 03:09:23,395 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 366 transitions. Word has length 45 [2024-10-14 03:09:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:23,396 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 366 transitions. [2024-10-14 03:09:23,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:09:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 366 transitions. [2024-10-14 03:09:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:09:23,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:23,397 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 03:09:23,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:09:23,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 690075150, now seen corresponding path program 1 times [2024-10-14 03:09:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800239705] [2024-10-14 03:09:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:09:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:09:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 03:09:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:09:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:09:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:09:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800239705] [2024-10-14 03:09:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800239705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:09:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670793687] [2024-10-14 03:09:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:09:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:23,582 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-10-14 03:09:23,586 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-10-14 03:09:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:23,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 03:09:23,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:09:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 03:09:23,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:09:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:09:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670793687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:09:24,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:09:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 14 [2024-10-14 03:09:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175226635] [2024-10-14 03:09:24,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:09:24,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:09:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:24,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:09:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:09:24,016 INFO L87 Difference]: Start difference. First operand 298 states and 366 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-14 03:09:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:24,395 INFO L93 Difference]: Finished difference Result 585 states and 744 transitions. [2024-10-14 03:09:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:09:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 72 [2024-10-14 03:09:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:24,397 INFO L225 Difference]: With dead ends: 585 [2024-10-14 03:09:24,397 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:09:24,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=457, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:09:24,399 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 314 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:24,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 196 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:09:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:09:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:09:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:09:24,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-14 03:09:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:09:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-14 03:09:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:09:24,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:09:24,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:09:24,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:09:24,606 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,SelfDestructingSolverStorable11 [2024-10-14 03:09:24,609 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:24,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:09:26,130 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:09:26,143 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 1) (= ~pumpRunning~0 1)) Eliminated clause: (and (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (= ~pumpRunning~0 1)) [2024-10-14 03:09:26,154 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1)))))) [2024-10-14 03:09:26,167 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 03:09:26,172 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int)) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1))))) [2024-10-14 03:09:26,174 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 03:09:26,176 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= |old(~waterLevel~0)| 2) (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) .cse0 (<= |old(~waterLevel~0)| 1))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= ~waterLevel~0 2) (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 1) .cse0))) [2024-10-14 03:09:26,180 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__lowWaterSensor contained old-variable. Original clause: (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int)) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1))))) [2024-10-14 03:09:26,183 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 03:09:26,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:09:26 BoogieIcfgContainer [2024-10-14 03:09:26,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:09:26,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:09:26,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:09:26,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:09:26,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:20" (3/4) ... [2024-10-14 03:09:26,186 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-14 03:09:26,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:26,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-14 03:09:26,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2024-10-14 03:09:26,195 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-14 03:09:26,195 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 03:09:26,195 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 03:09:26,196 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:09:26,196 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:09:26,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:09:26,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 03:09:26,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:09:26,296 INFO L158 Benchmark]: Toolchain (without parser) took 7160.59ms. Allocated memory was 153.1MB in the beginning and 297.8MB in the end (delta: 144.7MB). Free memory was 80.3MB in the beginning and 264.2MB in the end (delta: -184.0MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,297 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:09:26,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.81ms. Allocated memory was 153.1MB in the beginning and 243.3MB in the end (delta: 90.2MB). Free memory was 80.1MB in the beginning and 213.6MB in the end (delta: -133.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.81ms. Allocated memory is still 243.3MB. Free memory was 213.6MB in the beginning and 211.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,297 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 243.3MB. Free memory was 211.5MB in the beginning and 209.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,298 INFO L158 Benchmark]: RCFGBuilder took 510.16ms. Allocated memory is still 243.3MB. Free memory was 209.4MB in the beginning and 183.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,298 INFO L158 Benchmark]: TraceAbstraction took 6021.23ms. Allocated memory was 243.3MB in the beginning and 297.8MB in the end (delta: 54.5MB). Free memory was 182.1MB in the beginning and 99.1MB in the end (delta: 83.0MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,298 INFO L158 Benchmark]: Witness Printer took 109.45ms. Allocated memory is still 297.8MB. Free memory was 99.1MB in the beginning and 264.2MB in the end (delta: -165.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-14 03:09:26,299 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.14ms. Allocated memory is still 153.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.81ms. Allocated memory was 153.1MB in the beginning and 243.3MB in the end (delta: 90.2MB). Free memory was 80.1MB in the beginning and 213.6MB in the end (delta: -133.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.81ms. Allocated memory is still 243.3MB. Free memory was 213.6MB in the beginning and 211.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 243.3MB. Free memory was 211.5MB in the beginning and 209.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.16ms. Allocated memory is still 243.3MB. Free memory was 209.4MB in the beginning and 183.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6021.23ms. Allocated memory was 243.3MB in the beginning and 297.8MB in the end (delta: 54.5MB). Free memory was 182.1MB in the beginning and 99.1MB in the end (delta: 83.0MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. * Witness Printer took 109.45ms. Allocated memory is still 297.8MB. Free memory was 99.1MB in the beginning and 264.2MB in the end (delta: -165.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [96] - GenericResultAtLocation [Line: 165]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [165] - GenericResultAtLocation [Line: 398]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [398] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [502] - GenericResultAtLocation [Line: 536]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [536] - GenericResultAtLocation [Line: 902]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1532 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1491 mSDsluCounter, 2108 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1353 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1985 IncrementalHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 755 mSDtfsCounter, 1985 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 252 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=11, InterpolantAutomatonStates: 87, 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, 12 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 1182 SizeOfPredicates, 2 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 43/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((1 == systemActive) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 296]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1)) Ensures: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (\old(pumpRunning) == 1)) - ProcedureContractResult [Line: 203]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) Ensures: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) - ProcedureContractResult [Line: 426]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) - ProcedureContractResult [Line: 438]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) - ProcedureContractResult [Line: 904]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 179]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel)) || (1 < \old(waterLevel))) || (\old(pumpRunning) != 0)) && ((((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel)) || (\old(pumpRunning) != 0)) || ((\old(waterLevel) == waterLevel) && (pumpRunning == 1)))) && (((\old(pumpRunning) == 1) && (\old(waterLevel) <= 2)) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2)))) && ((((((waterLevel <= 1) && (1 == systemActive)) && (waterLevel <= \old(waterLevel))) && (pumpRunning == 1)) || (\old(pumpRunning) != 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (waterLevel <= \old(waterLevel))))) - ProcedureContractResult [Line: 211]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Ensures: (((((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (waterLevel <= 2))) && ((\old(pumpRunning) != 1) || (pumpRunning == 1))) && (((pumpRunning == 0) && (waterLevel <= 1)) || (pumpRunning == 1))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (1 < waterLevel))) - ProcedureContractResult [Line: 414]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (\old(waterLevel) <= 1)) || ((\old(waterLevel) <= 2) && (pumpRunning == 1))) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && (1 == systemActive)) && (waterLevel <= 2)) - ProcedureContractResult [Line: 237]: Procedure Contract for processEnvironment__wrappee__lowWaterSensor Derived contract for procedure processEnvironment__wrappee__lowWaterSensor. Ensures: (((((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (waterLevel <= 2))) && (((\old(pumpRunning) != 0) || ((pumpRunning == 0) && (waterLevel <= 1))) || (pumpRunning == 1))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (1 < waterLevel))) && ((pumpRunning == 0) || (pumpRunning == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-14 03:09:26,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE