./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_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_product50.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 0552f986eafe304f33f56d4376c7c6a56e2d691e1035259c5c13e13b2a7157c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:41:14,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:41:14,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:41:14,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:41:14,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:41:14,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:41:14,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:41:14,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:41:14,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:41:14,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:41:14,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:41:14,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:41:14,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:41:14,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:41:14,270 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:41:14,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:41:14,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:41:14,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:41:14,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:41:14,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:41:14,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:41:14,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:41:14,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:41:14,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:41:14,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:41:14,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:41:14,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:41:14,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:41:14,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:41:14,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:41:14,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:41:14,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:41:14,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:14,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:41:14,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:41:14,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:41:14,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:41:14,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:41:14,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:41:14,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:41:14,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:41:14,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:41:14,280 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 -> 0552f986eafe304f33f56d4376c7c6a56e2d691e1035259c5c13e13b2a7157c1 [2024-10-12 19:41:14,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:41:14,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:41:14,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:41:14,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:41:14,570 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:41:14,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product50.cil.c [2024-10-12 19:41:16,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:41:16,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:41:16,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product50.cil.c [2024-10-12 19:41:16,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5e38375/af0c6414de554a89bccacabf63efe79c/FLAGb365cf00a [2024-10-12 19:41:16,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5e38375/af0c6414de554a89bccacabf63efe79c [2024-10-12 19:41:16,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:41:16,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:41:16,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:16,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:41:16,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:41:16,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:16" (1/1) ... [2024-10-12 19:41:16,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1747afa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:16, skipping insertion in model container [2024-10-12 19:41:16,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:16" (1/1) ... [2024-10-12 19:41:16,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:41:16,998 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_product50.cil.c[15143,15156] [2024-10-12 19:41:17,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:17,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:41:17,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-12 19:41:17,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [415] [2024-10-12 19:41:17,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] [2024-10-12 19:41:17,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [562] [2024-10-12 19:41:17,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [664] [2024-10-12 19:41:17,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [699] [2024-10-12 19:41:17,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [708] [2024-10-12 19:41:17,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [776] [2024-10-12 19:41:17,098 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_product50.cil.c[15143,15156] [2024-10-12 19:41:17,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:17,132 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:41:17,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17 WrapperNode [2024-10-12 19:41:17,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:17,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:17,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:41:17,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:41:17,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,178 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 213 [2024-10-12 19:41:17,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:17,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:41:17,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:41:17,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:41:17,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,207 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-12 19:41:17,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:41:17,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:41:17,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:41:17,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:41:17,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (1/1) ... [2024-10-12 19:41:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:17,281 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-12 19:41:17,285 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-12 19:41:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:41:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:41:17,331 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:41:17,331 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:41:17,331 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:41:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:41:17,332 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:41:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:41:17,332 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:41:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:17,332 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:41:17,333 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:41:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:41:17,333 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:41:17,333 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:41:17,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:41:17,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:41:17,427 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:41:17,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:41:17,680 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-12 19:41:17,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:41:17,780 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:41:17,780 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:41:17,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:17 BoogieIcfgContainer [2024-10-12 19:41:17,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:41:17,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:41:17,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:41:17,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:41:17,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:41:16" (1/3) ... [2024-10-12 19:41:17,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b062de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:17, skipping insertion in model container [2024-10-12 19:41:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:17" (2/3) ... [2024-10-12 19:41:17,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b062de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:17, skipping insertion in model container [2024-10-12 19:41:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:17" (3/3) ... [2024-10-12 19:41:17,791 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product50.cil.c [2024-10-12 19:41:17,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:41:17,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:41:17,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:41:17,873 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;@5a8b4f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:41:17,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:41:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.5625) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 19:41:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:41:17,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:17,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:17,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash 732780293, now seen corresponding path program 1 times [2024-10-12 19:41:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685411446] [2024-10-12 19:41:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:41:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,090 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-12 19:41:18,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:18,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685411446] [2024-10-12 19:41:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685411446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:18,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:41:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358936597] [2024-10-12 19:41:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:18,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:41:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:18,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:41:18,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:41:18,119 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.5625) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) 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-12 19:41:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:18,179 INFO L93 Difference]: Finished difference Result 134 states and 195 transitions. [2024-10-12 19:41:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:41:18,181 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-12 19:41:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:18,188 INFO L225 Difference]: With dead ends: 134 [2024-10-12 19:41:18,189 INFO L226 Difference]: Without dead ends: 63 [2024-10-12 19:41:18,191 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-12 19:41:18,195 INFO L432 NwaCegarLoop]: 76 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, 76 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:18,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-12 19:41:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-12 19:41:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 52 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 19:41:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-10-12 19:41:18,240 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 17 [2024-10-12 19:41:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-10-12 19:41:18,241 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-12 19:41:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-10-12 19:41:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 19:41:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:18,245 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-12 19:41:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:41:18,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -676741546, now seen corresponding path program 1 times [2024-10-12 19:41:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094525144] [2024-10-12 19:41:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:41:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094525144] [2024-10-12 19:41:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094525144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:18,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:18,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361893361] [2024-10-12 19:41:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:18,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:18,383 INFO L87 Difference]: Start difference. First operand 63 states and 86 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-12 19:41:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:18,432 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-10-12 19:41:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:18,432 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-12 19:41:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:18,434 INFO L225 Difference]: With dead ends: 99 [2024-10-12 19:41:18,434 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 19:41:18,434 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-12 19:41:18,436 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:18,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 19:41:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 19:41:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:41:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-12 19:41:18,447 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 18 [2024-10-12 19:41:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-12 19:41:18,447 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-12 19:41:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-12 19:41:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:41:18,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:18,449 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-12 19:41:18,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:41:18,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 857570252, now seen corresponding path program 1 times [2024-10-12 19:41:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:18,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500758057] [2024-10-12 19:41:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,538 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-12 19:41:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500758057] [2024-10-12 19:41:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500758057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:18,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493378171] [2024-10-12 19:41:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:18,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:18,541 INFO L87 Difference]: Start difference. First operand 55 states and 75 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-12 19:41:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:18,593 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2024-10-12 19:41:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:18,594 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-12 19:41:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:18,597 INFO L225 Difference]: With dead ends: 108 [2024-10-12 19:41:18,597 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 19:41:18,598 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-12 19:41:18,599 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:18,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 60 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 19:41:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 19:41:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:41:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-12 19:41:18,612 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 21 [2024-10-12 19:41:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:18,612 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-12 19:41:18,612 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-12 19:41:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-12 19:41:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 19:41:18,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:18,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:18,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:41:18,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1782623785, now seen corresponding path program 1 times [2024-10-12 19:41:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242175658] [2024-10-12 19:41:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:41:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,721 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-12 19:41:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:18,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242175658] [2024-10-12 19:41:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242175658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243342250] [2024-10-12 19:41:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:18,724 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-12 19:41:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:18,804 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2024-10-12 19:41:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2024-10-12 19:41:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:18,808 INFO L225 Difference]: With dead ends: 147 [2024-10-12 19:41:18,808 INFO L226 Difference]: Without dead ends: 94 [2024-10-12 19:41:18,809 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-12 19:41:18,810 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:18,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-12 19:41:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-12 19:41:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 74 states have internal predecessors, (94), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-10-12 19:41:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-12 19:41:18,828 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 26 [2024-10-12 19:41:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:18,830 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-12 19:41:18,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-12 19:41:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2024-10-12 19:41:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:41:18,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:18,832 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] [2024-10-12 19:41:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:41:18,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1898366738, now seen corresponding path program 1 times [2024-10-12 19:41:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804568012] [2024-10-12 19:41:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:41:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:18,984 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-12 19:41:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:18,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804568012] [2024-10-12 19:41:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804568012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519851224] [2024-10-12 19:41:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:18,987 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:19,197 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-10-12 19:41:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:41:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-12 19:41:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:19,199 INFO L225 Difference]: With dead ends: 206 [2024-10-12 19:41:19,199 INFO L226 Difference]: Without dead ends: 116 [2024-10-12 19:41:19,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:41:19,200 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 107 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:19,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 170 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-12 19:41:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-10-12 19:41:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 91 states have internal predecessors, (117), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-12 19:41:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-10-12 19:41:19,216 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 33 [2024-10-12 19:41:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:19,216 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-10-12 19:41:19,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-10-12 19:41:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:41:19,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:19,218 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] [2024-10-12 19:41:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:41:19,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash -618503060, now seen corresponding path program 1 times [2024-10-12 19:41:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382557206] [2024-10-12 19:41:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:41:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,319 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-12 19:41:19,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:19,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382557206] [2024-10-12 19:41:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382557206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:19,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:19,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433941616] [2024-10-12 19:41:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:19,324 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:19,467 INFO L93 Difference]: Finished difference Result 230 states and 310 transitions. [2024-10-12 19:41:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:41:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-12 19:41:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:19,469 INFO L225 Difference]: With dead ends: 230 [2024-10-12 19:41:19,469 INFO L226 Difference]: Without dead ends: 118 [2024-10-12 19:41:19,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:41:19,471 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:19,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 179 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-12 19:41:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-12 19:41:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 93 states have internal predecessors, (119), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-12 19:41:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-10-12 19:41:19,496 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 33 [2024-10-12 19:41:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:19,497 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-10-12 19:41:19,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-10-12 19:41:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:41:19,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:19,500 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] [2024-10-12 19:41:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:41:19,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 808252656, now seen corresponding path program 1 times [2024-10-12 19:41:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875428711] [2024-10-12 19:41:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:41:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,601 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-12 19:41:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875428711] [2024-10-12 19:41:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875428711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:19,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016312305] [2024-10-12 19:41:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:19,603 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:19,843 INFO L93 Difference]: Finished difference Result 343 states and 469 transitions. [2024-10-12 19:41:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-12 19:41:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:19,846 INFO L225 Difference]: With dead ends: 343 [2024-10-12 19:41:19,846 INFO L226 Difference]: Without dead ends: 229 [2024-10-12 19:41:19,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-12 19:41:19,849 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 179 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:19,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 189 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-12 19:41:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2024-10-12 19:41:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 173 states have internal predecessors, (217), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-10-12 19:41:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 294 transitions. [2024-10-12 19:41:19,877 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 294 transitions. Word has length 33 [2024-10-12 19:41:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:19,877 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 294 transitions. [2024-10-12 19:41:19,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 294 transitions. [2024-10-12 19:41:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 19:41:19,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:19,879 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] [2024-10-12 19:41:19,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:41:19,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:19,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1641981339, now seen corresponding path program 1 times [2024-10-12 19:41:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150732190] [2024-10-12 19:41:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:41:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,977 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-12 19:41:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150732190] [2024-10-12 19:41:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150732190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:19,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968616755] [2024-10-12 19:41:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:19,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:19,979 INFO L87 Difference]: Start difference. First operand 221 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,147 INFO L93 Difference]: Finished difference Result 441 states and 586 transitions. [2024-10-12 19:41:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:41:20,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-12 19:41:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,150 INFO L225 Difference]: With dead ends: 441 [2024-10-12 19:41:20,150 INFO L226 Difference]: Without dead ends: 222 [2024-10-12 19:41:20,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-12 19:41:20,156 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 90 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 156 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-12 19:41:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-10-12 19:41:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 161 states have (on average 1.329192546583851) internal successors, (214), 172 states have internal predecessors, (214), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-10-12 19:41:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 291 transitions. [2024-10-12 19:41:20,197 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 291 transitions. Word has length 36 [2024-10-12 19:41:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,197 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 291 transitions. [2024-10-12 19:41:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 291 transitions. [2024-10-12 19:41:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:41:20,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,199 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] [2024-10-12 19:41:20,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:41:20,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1398682678, now seen corresponding path program 1 times [2024-10-12 19:41:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574962311] [2024-10-12 19:41:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:41:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,280 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-12 19:41:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574962311] [2024-10-12 19:41:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574962311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:20,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432306240] [2024-10-12 19:41:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:20,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:20,282 INFO L87 Difference]: Start difference. First operand 220 states and 291 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,603 INFO L93 Difference]: Finished difference Result 428 states and 575 transitions. [2024-10-12 19:41:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:41:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-12 19:41:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,606 INFO L225 Difference]: With dead ends: 428 [2024-10-12 19:41:20,606 INFO L226 Difference]: Without dead ends: 251 [2024-10-12 19:41:20,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:41:20,608 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 164 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 232 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-12 19:41:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2024-10-12 19:41:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 196 states have internal predecessors, (236), 32 states have call successors, (32), 28 states have call predecessors, (32), 32 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2024-10-12 19:41:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 312 transitions. [2024-10-12 19:41:20,634 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 312 transitions. Word has length 37 [2024-10-12 19:41:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,634 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 312 transitions. [2024-10-12 19:41:20,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 312 transitions. [2024-10-12 19:41:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 19:41:20,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:20,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:41:20,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -620979843, now seen corresponding path program 1 times [2024-10-12 19:41:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668032912] [2024-10-12 19:41:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:41:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,708 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-12 19:41:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668032912] [2024-10-12 19:41:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668032912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:20,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:20,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:41:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045814579] [2024-10-12 19:41:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:41:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:41:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:41:20,725 INFO L87 Difference]: Start difference. First operand 247 states and 312 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 4 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-12 19:41:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,960 INFO L93 Difference]: Finished difference Result 453 states and 579 transitions. [2024-10-12 19:41:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:41:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 4 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 40 [2024-10-12 19:41:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,962 INFO L225 Difference]: With dead ends: 453 [2024-10-12 19:41:20,962 INFO L226 Difference]: Without dead ends: 251 [2024-10-12 19:41:20,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:41:20,963 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 183 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 156 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-12 19:41:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2024-10-12 19:41:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 182 states have (on average 1.2912087912087913) internal successors, (235), 196 states have internal predecessors, (235), 32 states have call successors, (32), 28 states have call predecessors, (32), 32 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2024-10-12 19:41:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 311 transitions. [2024-10-12 19:41:20,987 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 311 transitions. Word has length 40 [2024-10-12 19:41:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,987 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 311 transitions. [2024-10-12 19:41:20,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 4 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-12 19:41:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 311 transitions. [2024-10-12 19:41:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 19:41:20,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:20,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:41:20,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1373164863, now seen corresponding path program 1 times [2024-10-12 19:41:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104774386] [2024-10-12 19:41:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:41:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,070 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-12 19:41:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104774386] [2024-10-12 19:41:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104774386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839147344] [2024-10-12 19:41:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:21,073 INFO L87 Difference]: Start difference. First operand 247 states and 311 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-12 19:41:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:21,260 INFO L93 Difference]: Finished difference Result 430 states and 547 transitions. [2024-10-12 19:41:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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 40 [2024-10-12 19:41:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:21,263 INFO L225 Difference]: With dead ends: 430 [2024-10-12 19:41:21,263 INFO L226 Difference]: Without dead ends: 228 [2024-10-12 19:41:21,264 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-12 19:41:21,265 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:21,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 169 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-12 19:41:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2024-10-12 19:41:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 179 states have internal predecessors, (214), 29 states have call successors, (29), 25 states have call predecessors, (29), 28 states have return successors, (37), 28 states have call predecessors, (37), 29 states have call successors, (37) [2024-10-12 19:41:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 280 transitions. [2024-10-12 19:41:21,286 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 280 transitions. Word has length 40 [2024-10-12 19:41:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:21,287 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 280 transitions. [2024-10-12 19:41:21,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-12 19:41:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2024-10-12 19:41:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 19:41:21,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:21,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:41:21,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -136694335, now seen corresponding path program 1 times [2024-10-12 19:41:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224423240] [2024-10-12 19:41:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:41:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:41:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:41:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:41:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224423240] [2024-10-12 19:41:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224423240] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:41:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480659320] [2024-10-12 19:41:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:41:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:21,405 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-12 19:41:21,406 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-12 19:41:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:41:21,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:41:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 19:41:21,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:41:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:41:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480659320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:41:21,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:41:21,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2024-10-12 19:41:21,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646699132] [2024-10-12 19:41:21,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:41:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 19:41:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 19:41:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:41:21,940 INFO L87 Difference]: Start difference. First operand 224 states and 280 transitions. Second operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (17), 9 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-12 19:41:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:22,380 INFO L93 Difference]: Finished difference Result 427 states and 564 transitions. [2024-10-12 19:41:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:41:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (17), 9 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 62 [2024-10-12 19:41:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:22,382 INFO L225 Difference]: With dead ends: 427 [2024-10-12 19:41:22,383 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:41:22,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2024-10-12 19:41:22,385 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 261 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:22,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 214 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:41:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:41:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:41:22,386 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-12 19:41:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:41:22,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-10-12 19:41:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:22,387 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:41:22,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (17), 9 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-12 19:41:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:41:22,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:41:22,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:41:22,408 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-12 19:41:22,591 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-12 19:41:22,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:22,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:41:24,277 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:41:24,320 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-12 19:41:24,334 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:41:24,346 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-12 19:41:24,350 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:41:24,352 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-12 19:41:24,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:41:24 BoogieIcfgContainer [2024-10-12 19:41:24,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:41:24,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:41:24,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:41:24,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:41:24,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:17" (3/4) ... [2024-10-12 19:41:24,361 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:41:24,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:41:24,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:41:24,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:41:24,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:41:24,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:41:24,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:24,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:41:24,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-12 19:41:24,380 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:41:24,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:41:24,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:41:24,381 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:41:24,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:41:24,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:41:24,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:41:24,496 INFO L158 Benchmark]: Toolchain (without parser) took 7866.14ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 118.5MB in the beginning and 143.8MB in the end (delta: -25.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,499 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:41:24,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.83ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 97.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.31ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,500 INFO L158 Benchmark]: Boogie Preprocessor took 56.74ms. Allocated memory is still 176.2MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,500 INFO L158 Benchmark]: RCFGBuilder took 543.91ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 92.3MB in the beginning and 195.3MB in the end (delta: -103.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,500 INFO L158 Benchmark]: TraceAbstraction took 6574.65ms. Allocated memory is still 230.7MB. Free memory was 195.3MB in the beginning and 152.2MB in the end (delta: 43.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,500 INFO L158 Benchmark]: Witness Printer took 137.68ms. Allocated memory is still 230.7MB. Free memory was 152.2MB in the beginning and 143.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:41:24,501 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.17ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.83ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 97.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.31ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.74ms. Allocated memory is still 176.2MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.91ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 92.3MB in the beginning and 195.3MB in the end (delta: -103.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6574.65ms. Allocated memory is still 230.7MB. Free memory was 195.3MB in the beginning and 152.2MB in the end (delta: 43.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. * Witness Printer took 137.68ms. Allocated memory is still 230.7MB. Free memory was 152.2MB in the beginning and 143.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [415] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] - GenericResultAtLocation [Line: 562]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [562] - GenericResultAtLocation [Line: 664]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [664] - GenericResultAtLocation [Line: 699]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [699] - GenericResultAtLocation [Line: 708]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [708] - GenericResultAtLocation [Line: 776]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [776] - 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: 704]: 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 8 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1291 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1259 mSDsluCounter, 1831 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1138 mSDsCounter, 294 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1630 IncrementalHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 294 mSolverCounterUnsat, 693 mSDtfsCounter, 1630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 201 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 28 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 944 SizeOfPredicates, 2 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 39/54 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: 720]: Loop Invariant Derived loop invariant: ((((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 719]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 806]: 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: 486]: 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: 782]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((waterLevel <= 1) && (waterLevel <= \old(waterLevel))) && (pumpRunning == 1)) || (\old(pumpRunning) != 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (waterLevel <= \old(waterLevel)))) && (((((pumpRunning == 0) && (waterLevel <= 1)) && (\old(waterLevel) == waterLevel)) || (\old(pumpRunning) != 0)) || (((2 == waterLevel) && (\old(waterLevel) == 2)) && (pumpRunning == 1)))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || (((1 == systemActive) && (\old(pumpRunning) == 1)) && (\old(waterLevel) <= 2)))) - ProcedureContractResult [Line: 565]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 498]: 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: 814]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Ensures: ((((\old(pumpRunning) != 1) || (pumpRunning == 1)) && ((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (((2 == waterLevel) && (1 == systemActive)) && (pumpRunning == 1))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)))) - ProcedureContractResult [Line: 474]: 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) || (2 == waterLevel)) || (\old(waterLevel) != 1)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((1 == systemActive) && (\old(waterLevel) <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:41:24,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE