./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product59.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 68cd47586ea836a40d34f69dc7bca714ffc0af5c5bf2f7fbd8cfbbd6f1019685 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:55:17,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:55:17,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:55:17,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:55:17,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:55:17,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:55:17,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:55:17,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:55:17,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:55:17,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:55:17,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:55:17,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:55:17,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:55:17,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:55:17,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:55:17,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:55:17,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:55:17,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:55:17,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:55:17,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:55:17,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:55:17,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:55:17,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:55:17,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:55:17,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:55:17,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:55:17,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:55:17,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:55:17,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:55:17,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:55:17,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:55:17,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:55:17,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:17,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:55:17,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:55:17,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:55:17,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:55:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:55:17,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:55:17,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:55:17,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:55:17,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:55:17,560 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 -> 68cd47586ea836a40d34f69dc7bca714ffc0af5c5bf2f7fbd8cfbbd6f1019685 [2024-11-11 20:55:17,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:55:17,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:55:17,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:55:17,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:55:17,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:55:17,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c [2024-11-11 20:55:19,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:55:19,602 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:55:19,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c [2024-11-11 20:55:19,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/761343a5e/b8da767cd59c47e8b34d61d61bf52aeb/FLAG271e8db52 [2024-11-11 20:55:19,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/761343a5e/b8da767cd59c47e8b34d61d61bf52aeb [2024-11-11 20:55:19,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:55:19,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:55:19,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:19,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:55:19,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:55:19,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:19" (1/1) ... [2024-11-11 20:55:19,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe5c019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:19, skipping insertion in model container [2024-11-11 20:55:19,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:19" (1/1) ... [2024-11-11 20:55:19,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:55:19,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c[9171,9184] [2024-11-11 20:55:19,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:20,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:55:20,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-11 20:55:20,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [87] [2024-11-11 20:55:20,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [116] [2024-11-11 20:55:20,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [188] [2024-11-11 20:55:20,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [426] [2024-11-11 20:55:20,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [522] [2024-11-11 20:55:20,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [625] [2024-11-11 20:55:20,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-11 20:55:20,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c[9171,9184] [2024-11-11 20:55:20,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:20,126 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:55:20,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20 WrapperNode [2024-11-11 20:55:20,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:20,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:20,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:55:20,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:55:20,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,195 INFO L138 Inliner]: procedures = 57, calls = 102, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 230 [2024-11-11 20:55:20,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:20,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:55:20,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:55:20,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:55:20,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:55:20,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:55:20,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:55:20,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:55:20,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:55:20,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (1/1) ... [2024-11-11 20:55:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:20,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:55:20,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:55:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:55:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:55:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:55:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:55:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:55:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:55:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:55:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:55:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:55:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:55:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:55:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:55:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:55:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:55:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:55:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:55:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:55:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:55:20,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:55:20,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:55:20,781 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-11 20:55:20,781 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:55:20,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:55:20,798 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:55:20,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:20 BoogieIcfgContainer [2024-11-11 20:55:20,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:55:20,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:55:20,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:55:20,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:55:20,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:55:19" (1/3) ... [2024-11-11 20:55:20,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6106e516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:20, skipping insertion in model container [2024-11-11 20:55:20,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:20" (2/3) ... [2024-11-11 20:55:20,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6106e516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:20, skipping insertion in model container [2024-11-11 20:55:20,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:20" (3/3) ... [2024-11-11 20:55:20,806 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product59.cil.c [2024-11-11 20:55:20,821 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:55:20,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:55:20,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:55:20,878 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;@39a8e3fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:55:20,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:55:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:55:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:55:20,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:20,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:20,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:20,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1328460563, now seen corresponding path program 1 times [2024-11-11 20:55:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061597280] [2024-11-11 20:55:20,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061597280] [2024-11-11 20:55:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061597280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:21,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124839089] [2024-11-11 20:55:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:55:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:21,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:55:21,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:21,100 INFO L87 Difference]: Start difference. First operand has 93 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:21,127 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-11 20:55:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:55:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-11 20:55:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:21,136 INFO L225 Difference]: With dead ends: 178 [2024-11-11 20:55:21,136 INFO L226 Difference]: Without dead ends: 84 [2024-11-11 20:55:21,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:21,142 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:21,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-11 20:55:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-11 20:55:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.323076923076923) internal successors, (86), 73 states have internal predecessors, (86), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:55:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-11-11 20:55:21,190 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 19 [2024-11-11 20:55:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:21,190 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-11-11 20:55:21,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-11-11 20:55:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 20:55:21,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:21,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:21,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:55:21,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1880549764, now seen corresponding path program 1 times [2024-11-11 20:55:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:21,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686208007] [2024-11-11 20:55:21,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686208007] [2024-11-11 20:55:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686208007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122385601] [2024-11-11 20:55:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:21,306 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:21,327 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2024-11-11 20:55:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:21,328 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 20:55:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:21,330 INFO L225 Difference]: With dead ends: 130 [2024-11-11 20:55:21,331 INFO L226 Difference]: Without dead ends: 75 [2024-11-11 20:55:21,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:21,333 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:21,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-11 20:55:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-11 20:55:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 67 states have internal predecessors, (79), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2024-11-11 20:55:21,349 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 20 [2024-11-11 20:55:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2024-11-11 20:55:21,349 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2024-11-11 20:55:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 20:55:21,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:21,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:21,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:55:21,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 612415945, now seen corresponding path program 1 times [2024-11-11 20:55:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241958836] [2024-11-11 20:55:21,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:21,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241958836] [2024-11-11 20:55:21,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241958836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:21,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:21,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:55:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339668845] [2024-11-11 20:55:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:21,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:21,568 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:21,780 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2024-11-11 20:55:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:55:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 20:55:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:21,783 INFO L225 Difference]: With dead ends: 248 [2024-11-11 20:55:21,783 INFO L226 Difference]: Without dead ends: 180 [2024-11-11 20:55:21,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:21,785 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 229 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:21,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 387 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-11 20:55:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2024-11-11 20:55:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 153 states have internal predecessors, (185), 22 states have call successors, (22), 16 states have call predecessors, (22), 16 states have return successors, (23), 14 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-11 20:55:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2024-11-11 20:55:21,807 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 24 [2024-11-11 20:55:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2024-11-11 20:55:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2024-11-11 20:55:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:55:21,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:21,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:55:21,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:21,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1477369919, now seen corresponding path program 1 times [2024-11-11 20:55:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052567365] [2024-11-11 20:55:21,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052567365] [2024-11-11 20:55:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052567365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:55:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586884879] [2024-11-11 20:55:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:55:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:55:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:55:21,927 INFO L87 Difference]: Start difference. First operand 174 states and 230 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:22,022 INFO L93 Difference]: Finished difference Result 491 states and 675 transitions. [2024-11-11 20:55:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:55:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 20:55:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:22,028 INFO L225 Difference]: With dead ends: 491 [2024-11-11 20:55:22,028 INFO L226 Difference]: Without dead ends: 324 [2024-11-11 20:55:22,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:22,031 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:22,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 350 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-11 20:55:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-11 20:55:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 250 states have (on average 1.344) internal successors, (336), 282 states have internal predecessors, (336), 44 states have call successors, (44), 32 states have call predecessors, (44), 29 states have return successors, (50), 25 states have call predecessors, (50), 44 states have call successors, (50) [2024-11-11 20:55:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 430 transitions. [2024-11-11 20:55:22,087 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 430 transitions. Word has length 28 [2024-11-11 20:55:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:22,088 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 430 transitions. [2024-11-11 20:55:22,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 430 transitions. [2024-11-11 20:55:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:55:22,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:22,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:22,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:55:22,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:22,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -30603644, now seen corresponding path program 1 times [2024-11-11 20:55:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114991452] [2024-11-11 20:55:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114991452] [2024-11-11 20:55:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114991452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151229985] [2024-11-11 20:55:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:22,191 INFO L87 Difference]: Start difference. First operand 324 states and 430 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:22,272 INFO L93 Difference]: Finished difference Result 748 states and 1019 transitions. [2024-11-11 20:55:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-11 20:55:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:22,277 INFO L225 Difference]: With dead ends: 748 [2024-11-11 20:55:22,277 INFO L226 Difference]: Without dead ends: 431 [2024-11-11 20:55:22,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:22,279 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 56 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:22,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 151 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-11 20:55:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 420. [2024-11-11 20:55:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 330 states have (on average 1.2969696969696969) internal successors, (428), 357 states have internal predecessors, (428), 47 states have call successors, (47), 45 states have call predecessors, (47), 42 states have return successors, (69), 41 states have call predecessors, (69), 47 states have call successors, (69) [2024-11-11 20:55:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 544 transitions. [2024-11-11 20:55:22,325 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 544 transitions. Word has length 30 [2024-11-11 20:55:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:22,327 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 544 transitions. [2024-11-11 20:55:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 544 transitions. [2024-11-11 20:55:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 20:55:22,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:22,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:22,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:55:22,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:22,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1736818085, now seen corresponding path program 1 times [2024-11-11 20:55:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411557068] [2024-11-11 20:55:22,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411557068] [2024-11-11 20:55:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411557068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67089943] [2024-11-11 20:55:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:22,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:22,460 INFO L87 Difference]: Start difference. First operand 420 states and 544 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:55:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:22,726 INFO L93 Difference]: Finished difference Result 492 states and 638 transitions. [2024-11-11 20:55:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:55:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-11 20:55:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:22,731 INFO L225 Difference]: With dead ends: 492 [2024-11-11 20:55:22,732 INFO L226 Difference]: Without dead ends: 490 [2024-11-11 20:55:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:22,734 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 124 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 296 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-11 20:55:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2024-11-11 20:55:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 383 states have (on average 1.279373368146214) internal successors, (490), 421 states have internal predecessors, (490), 53 states have call successors, (53), 45 states have call predecessors, (53), 51 states have return successors, (88), 45 states have call predecessors, (88), 53 states have call successors, (88) [2024-11-11 20:55:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 631 transitions. [2024-11-11 20:55:22,786 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 631 transitions. Word has length 32 [2024-11-11 20:55:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:22,786 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 631 transitions. [2024-11-11 20:55:22,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:55:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 631 transitions. [2024-11-11 20:55:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:22,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:22,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:55:22,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2119024627, now seen corresponding path program 1 times [2024-11-11 20:55:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139503144] [2024-11-11 20:55:22,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139503144] [2024-11-11 20:55:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139503144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:55:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523449021] [2024-11-11 20:55:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:22,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:55:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:55:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:22,941 INFO L87 Difference]: Start difference. First operand 488 states and 631 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:23,263 INFO L93 Difference]: Finished difference Result 1055 states and 1406 transitions. [2024-11-11 20:55:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:55:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-11 20:55:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:23,268 INFO L225 Difference]: With dead ends: 1055 [2024-11-11 20:55:23,268 INFO L226 Difference]: Without dead ends: 574 [2024-11-11 20:55:23,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:23,270 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 130 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:23,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 384 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-11 20:55:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 532. [2024-11-11 20:55:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 421 states have (on average 1.2636579572446556) internal successors, (532), 459 states have internal predecessors, (532), 53 states have call successors, (53), 45 states have call predecessors, (53), 57 states have return successors, (96), 49 states have call predecessors, (96), 53 states have call successors, (96) [2024-11-11 20:55:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 681 transitions. [2024-11-11 20:55:23,308 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 681 transitions. Word has length 46 [2024-11-11 20:55:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:23,309 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 681 transitions. [2024-11-11 20:55:23,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 681 transitions. [2024-11-11 20:55:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:23,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:23,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:23,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:55:23,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:23,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash -124879921, now seen corresponding path program 1 times [2024-11-11 20:55:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:23,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774718544] [2024-11-11 20:55:23,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:23,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774718544] [2024-11-11 20:55:23,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774718544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:23,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:23,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943061181] [2024-11-11 20:55:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:23,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:23,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:23,403 INFO L87 Difference]: Start difference. First operand 532 states and 681 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:23,650 INFO L93 Difference]: Finished difference Result 1034 states and 1351 transitions. [2024-11-11 20:55:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:55:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-11 20:55:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:23,654 INFO L225 Difference]: With dead ends: 1034 [2024-11-11 20:55:23,655 INFO L226 Difference]: Without dead ends: 509 [2024-11-11 20:55:23,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:23,658 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 132 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:23,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 336 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-11 20:55:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 425. [2024-11-11 20:55:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 336 states have (on average 1.2619047619047619) internal successors, (424), 365 states have internal predecessors, (424), 44 states have call successors, (44), 38 states have call predecessors, (44), 44 states have return successors, (70), 38 states have call predecessors, (70), 44 states have call successors, (70) [2024-11-11 20:55:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 538 transitions. [2024-11-11 20:55:23,692 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 538 transitions. Word has length 46 [2024-11-11 20:55:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:23,693 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 538 transitions. [2024-11-11 20:55:23,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2024-11-11 20:55:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:23,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:23,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:23,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:55:23,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:23,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1358294219, now seen corresponding path program 1 times [2024-11-11 20:55:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:23,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231506515] [2024-11-11 20:55:23,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231506515] [2024-11-11 20:55:23,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231506515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:23,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:23,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709774591] [2024-11-11 20:55:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:23,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:23,823 INFO L87 Difference]: Start difference. First operand 425 states and 538 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:24,289 INFO L93 Difference]: Finished difference Result 971 states and 1304 transitions. [2024-11-11 20:55:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:55:24,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-11 20:55:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:24,294 INFO L225 Difference]: With dead ends: 971 [2024-11-11 20:55:24,294 INFO L226 Difference]: Without dead ends: 660 [2024-11-11 20:55:24,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:55:24,296 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:24,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 437 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:55:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-11 20:55:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 635. [2024-11-11 20:55:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 501 states have (on average 1.2375249500998005) internal successors, (620), 538 states have internal predecessors, (620), 66 states have call successors, (66), 58 states have call predecessors, (66), 67 states have return successors, (131), 66 states have call predecessors, (131), 66 states have call successors, (131) [2024-11-11 20:55:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 817 transitions. [2024-11-11 20:55:24,360 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 817 transitions. Word has length 46 [2024-11-11 20:55:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:24,361 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 817 transitions. [2024-11-11 20:55:24,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 817 transitions. [2024-11-11 20:55:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 20:55:24,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:24,365 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:55:24,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:24,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash -572504429, now seen corresponding path program 1 times [2024-11-11 20:55:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:24,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949547337] [2024-11-11 20:55:24,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:55:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:55:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949547337] [2024-11-11 20:55:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949547337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:55:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752869569] [2024-11-11 20:55:24,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:55:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:24,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:55:24,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:55:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:24,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:55:24,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:55:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:24,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:55:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:55:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752869569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:55:24,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:55:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2024-11-11 20:55:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051814576] [2024-11-11 20:55:24,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:55:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:55:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:55:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:24,969 INFO L87 Difference]: Start difference. First operand 635 states and 817 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:55:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:25,617 INFO L93 Difference]: Finished difference Result 1512 states and 2051 transitions. [2024-11-11 20:55:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 20:55:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-11 20:55:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:25,625 INFO L225 Difference]: With dead ends: 1512 [2024-11-11 20:55:25,625 INFO L226 Difference]: Without dead ends: 991 [2024-11-11 20:55:25,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2024-11-11 20:55:25,628 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 243 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:25,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 545 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:55:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-11 20:55:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 862. [2024-11-11 20:55:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 672 states have (on average 1.244047619047619) internal successors, (836), 725 states have internal predecessors, (836), 95 states have call successors, (95), 83 states have call predecessors, (95), 94 states have return successors, (198), 87 states have call predecessors, (198), 95 states have call successors, (198) [2024-11-11 20:55:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1129 transitions. [2024-11-11 20:55:25,692 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1129 transitions. Word has length 80 [2024-11-11 20:55:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:25,693 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1129 transitions. [2024-11-11 20:55:25,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:55:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1129 transitions. [2024-11-11 20:55:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:55:25,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:25,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 20:55:25,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:55:25,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 20:55:25,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1682583131, now seen corresponding path program 2 times [2024-11-11 20:55:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:25,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650990105] [2024-11-11 20:55:25,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:55:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:55:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:55:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 51 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:55:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650990105] [2024-11-11 20:55:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650990105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:55:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469260591] [2024-11-11 20:55:26,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:55:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:55:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:26,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:55:26,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:55:26,447 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:55:26,447 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:55:26,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 20:55:26,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:55:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:55:26,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:55:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469260591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:26,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:55:26,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-11 20:55:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573288406] [2024-11-11 20:55:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:26,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:55:26,575 INFO L87 Difference]: Start difference. First operand 862 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:55:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:26,832 INFO L93 Difference]: Finished difference Result 2267 states and 3101 transitions. [2024-11-11 20:55:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:55:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 114 [2024-11-11 20:55:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:26,841 INFO L225 Difference]: With dead ends: 2267 [2024-11-11 20:55:26,841 INFO L226 Difference]: Without dead ends: 1517 [2024-11-11 20:55:26,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:55:26,846 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 121 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:26,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 616 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-11 20:55:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1493. [2024-11-11 20:55:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1166 states have (on average 1.2435677530017153) internal successors, (1450), 1246 states have internal predecessors, (1450), 166 states have call successors, (166), 148 states have call predecessors, (166), 160 states have return successors, (308), 150 states have call predecessors, (308), 166 states have call successors, (308) [2024-11-11 20:55:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1924 transitions. [2024-11-11 20:55:26,936 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1924 transitions. Word has length 114 [2024-11-11 20:55:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:26,937 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1924 transitions. [2024-11-11 20:55:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:55:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1924 transitions. [2024-11-11 20:55:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:55:26,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:26,941 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 20:55:26,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:55:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 20:55:27,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2126483805, now seen corresponding path program 1 times [2024-11-11 20:55:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817541812] [2024-11-11 20:55:27,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:55:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:55:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:55:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:55:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817541812] [2024-11-11 20:55:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817541812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:55:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272163878] [2024-11-11 20:55:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:27,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:55:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:27,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:55:27,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:27,327 INFO L87 Difference]: Start difference. First operand 1493 states and 1924 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 20:55:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:27,545 INFO L93 Difference]: Finished difference Result 2099 states and 2666 transitions. [2024-11-11 20:55:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:55:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 114 [2024-11-11 20:55:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:27,547 INFO L225 Difference]: With dead ends: 2099 [2024-11-11 20:55:27,547 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:55:27,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:27,552 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 133 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:27,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 250 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:55:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:55:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:55:27,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2024-11-11 20:55:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:27,555 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:55:27,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 20:55:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:55:27,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:55:27,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:55:27,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:55:27,560 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:27,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:55:29,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:55:29,552 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) Eliminated clause: (and (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2024-11-11 20:55:29,562 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|)) (and (<= 2 |old(~waterLevel~0)|) (not (= 0 ~systemActive~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 0) (<= 1 ~waterLevel~0))) [2024-11-11 20:55:29,568 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and .cse0 (= ~waterLevel~0 1) .cse1)))) Eliminated clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~waterLevel~0 1) .cse0) (and (<= 2 ~waterLevel~0) .cse0)))) [2024-11-11 20:55:29,572 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (or (and (<= 2 |old(~waterLevel~0)|) (not (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 0) (<= 1 |old(~waterLevel~0)|))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 0) (<= 1 ~waterLevel~0))) [2024-11-11 20:55:29,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:55:29 BoogieIcfgContainer [2024-11-11 20:55:29,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:55:29,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:55:29,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:55:29,576 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:55:29,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:20" (3/4) ... [2024-11-11 20:55:29,579 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:55:29,583 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-11 20:55:29,583 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:55:29,583 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:55:29,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:55:29,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:55:29,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:55:29,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:55:29,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:55:29,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:55:29,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:55:29,595 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:55:29,595 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:55:29,723 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:55:29,723 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:55:29,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:55:29,724 INFO L158 Benchmark]: Toolchain (without parser) took 10092.69ms. Allocated memory was 216.0MB in the beginning and 343.9MB in the end (delta: 127.9MB). Free memory was 159.6MB in the beginning and 160.0MB in the end (delta: -364.2kB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,724 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:55:29,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.55ms. Allocated memory is still 216.0MB. Free memory was 159.2MB in the beginning and 137.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 216.0MB. Free memory was 137.7MB in the beginning and 135.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,725 INFO L158 Benchmark]: Boogie Preprocessor took 58.47ms. Allocated memory is still 216.0MB. Free memory was 135.3MB in the beginning and 132.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,725 INFO L158 Benchmark]: RCFGBuilder took 543.12ms. Allocated memory is still 216.0MB. Free memory was 132.8MB in the beginning and 179.3MB in the end (delta: -46.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,726 INFO L158 Benchmark]: TraceAbstraction took 8774.26ms. Allocated memory was 216.0MB in the beginning and 343.9MB in the end (delta: 127.9MB). Free memory was 178.3MB in the beginning and 167.3MB in the end (delta: 11.0MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,726 INFO L158 Benchmark]: Witness Printer took 148.11ms. Allocated memory is still 343.9MB. Free memory was 167.3MB in the beginning and 160.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 20:55:29,727 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.23ms. Allocated memory is still 142.6MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.55ms. Allocated memory is still 216.0MB. Free memory was 159.2MB in the beginning and 137.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 216.0MB. Free memory was 137.7MB in the beginning and 135.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.47ms. Allocated memory is still 216.0MB. Free memory was 135.3MB in the beginning and 132.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.12ms. Allocated memory is still 216.0MB. Free memory was 132.8MB in the beginning and 179.3MB in the end (delta: -46.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8774.26ms. Allocated memory was 216.0MB in the beginning and 343.9MB in the end (delta: 127.9MB). Free memory was 178.3MB in the beginning and 167.3MB in the end (delta: 11.0MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. * Witness Printer took 148.11ms. Allocated memory is still 343.9MB. Free memory was 167.3MB in the beginning and 160.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [87] - GenericResultAtLocation [Line: 116]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [116] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [188] - GenericResultAtLocation [Line: 426]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [426] - GenericResultAtLocation [Line: 522]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [522] - GenericResultAtLocation [Line: 625]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [625] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] * 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: 630]: 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, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1461 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1443 mSDsluCounter, 4041 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2948 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1969 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 1093 mSDtfsCounter, 1969 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 340 SyntacticMatches, 10 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1493occurred in iteration=11, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 323 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 793 NumberOfCodeBlocks, 793 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 1667 SizeOfPredicates, 3 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 252/282 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: 131]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((2 <= waterLevel) && (splverifierCounter == 0)) && (0 != systemActive))) || (((pumpRunning == 0) && (2 <= waterLevel)) && (splverifierCounter == 0))) - ProcedureContractResult [Line: 309]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((1 <= waterLevel) && (0 != systemActive)) Ensures: ((((pumpRunning == 0) && (1 <= waterLevel)) && (0 != systemActive)) && (((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 224]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((pumpRunning == 0) && (1 <= waterLevel)) && (0 != systemActive)) Ensures: ((((pumpRunning == 0) && (1 <= waterLevel)) && (0 != systemActive)) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 549]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((2 <= waterLevel) && (0 != systemActive)) || ((pumpRunning == 0) && (1 <= waterLevel))) Ensures: ((((2 <= waterLevel) && (0 != systemActive)) || ((pumpRunning == 0) && (1 <= waterLevel))) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 428]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 200]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((2 <= waterLevel) && (0 != systemActive)) || ((pumpRunning == 0) && (1 <= waterLevel))) Ensures: (((((\old(pumpRunning) == 0) || ((2 <= \old(waterLevel)) && (0 != systemActive))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && (((\old(pumpRunning) != 0) || ((\old(waterLevel) == waterLevel) && (0 != systemActive))) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 232]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((pumpRunning == 0) && (((waterLevel == 1) && (0 != systemActive)) || ((2 <= waterLevel) && (0 != systemActive)))) Ensures: ((((waterLevel != 1) || (pumpRunning == 0)) && ((((2 <= waterLevel) && (\old(pumpRunning) == 0)) && (0 != systemActive)) || (((\old(pumpRunning) == 0) && (waterLevel == 1)) && (0 != systemActive)))) && (((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 537]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((2 <= waterLevel) && (0 != systemActive)) || ((pumpRunning == 0) && (1 <= waterLevel))) Ensures: ((((((2 <= \old(waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (1 <= \old(waterLevel)))) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (2 <= waterLevel)) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:55:29,757 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