./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 190527f0b5c755657048457e241e1db06174c0bd15c9c37dddb3c55b0e7d73ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:00:22,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:00:22,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:00:22,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:00:22,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:00:22,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:00:22,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:00:22,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:00:22,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:00:22,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:00:22,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:00:22,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:00:22,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:00:22,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:00:22,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:00:22,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:00:22,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:00:22,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:00:22,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:00:22,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:00:22,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:00:22,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:00:22,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:00:22,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:00:22,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:00:22,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:00:22,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:00:22,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:00:22,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:00:22,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:00:22,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:00:22,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:00:22,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:22,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:00:22,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:00:22,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:00:22,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:00:22,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:00:22,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:00:22,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:00:22,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:00:22,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:00:22,519 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-clean/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-clean/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 -> 190527f0b5c755657048457e241e1db06174c0bd15c9c37dddb3c55b0e7d73ce [2024-10-11 03:00:22,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:00:22,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:00:22,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:00:22,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:00:22,811 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:00:22,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c [2024-10-11 03:00:24,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:00:24,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:00:24,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c [2024-10-11 03:00:24,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/29dffebe6/a87f52d10b5f4cd2803c4565b9618c0d/FLAG1051548e7 [2024-10-11 03:00:24,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/29dffebe6/a87f52d10b5f4cd2803c4565b9618c0d [2024-10-11 03:00:24,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:00:24,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:00:24,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:24,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:00:24,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:00:24,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:24" (1/1) ... [2024-10-11 03:00:24,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6726298a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:24, skipping insertion in model container [2024-10-11 03:00:24,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:24" (1/1) ... [2024-10-11 03:00:24,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:00:25,011 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c[17943,17956] [2024-10-11 03:00:25,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:25,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:00:25,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-11 03:00:25,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] [2024-10-11 03:00:25,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] [2024-10-11 03:00:25,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [554] [2024-10-11 03:00:25,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [582] [2024-10-11 03:00:25,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [681] [2024-10-11 03:00:25,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [749] [2024-10-11 03:00:25,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [929] [2024-10-11 03:00:25,181 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c[17943,17956] [2024-10-11 03:00:25,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:25,204 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:00:25,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25 WrapperNode [2024-10-11 03:00:25,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:25,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:25,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:00:25,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:00:25,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,254 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 196 [2024-10-11 03:00:25,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:25,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:00:25,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:00:25,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:00:25,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,285 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:00:25,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:00:25,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:00:25,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:00:25,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:00:25,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (1/1) ... [2024-10-11 03:00:25,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:25,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:00:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:00:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:00:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 03:00:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 03:00:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 03:00:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 03:00:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 03:00:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 03:00:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 03:00:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 03:00:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:00:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 03:00:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 03:00:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:00:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:00:25,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:00:25,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:00:25,778 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-11 03:00:25,779 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:00:25,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:00:25,867 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:00:25,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:25 BoogieIcfgContainer [2024-10-11 03:00:25,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:00:25,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:00:25,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:00:25,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:00:25,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:00:24" (1/3) ... [2024-10-11 03:00:25,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcab0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:25, skipping insertion in model container [2024-10-11 03:00:25,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:25" (2/3) ... [2024-10-11 03:00:25,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcab0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:25, skipping insertion in model container [2024-10-11 03:00:25,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:25" (3/3) ... [2024-10-11 03:00:25,877 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product42.cil.c [2024-10-11 03:00:25,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:00:25,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:00:25,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:00:25,970 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;@74fdcc55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:00:25,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:00:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 47 states have internal predecessors, (65), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:00:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 03:00:25,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:25,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:25,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:25,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1210334168, now seen corresponding path program 1 times [2024-10-11 03:00:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165239640] [2024-10-11 03:00:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165239640] [2024-10-11 03:00:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165239640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:26,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:26,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701489921] [2024-10-11 03:00:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:00:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:00:26,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:26,228 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 47 states have internal predecessors, (65), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-11 03:00:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:26,310 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2024-10-11 03:00:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:00:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-10-11 03:00:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:26,323 INFO L225 Difference]: With dead ends: 110 [2024-10-11 03:00:26,324 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 03:00:26,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:26,331 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:26,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 03:00:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 03:00:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 43 states have internal predecessors, (55), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:00:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-10-11 03:00:26,414 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 12 [2024-10-11 03:00:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:26,415 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-10-11 03:00:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-11 03:00:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-10-11 03:00:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 03:00:26,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:26,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:26,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:00:26,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:26,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1134460825, now seen corresponding path program 1 times [2024-10-11 03:00:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846692155] [2024-10-11 03:00:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846692155] [2024-10-11 03:00:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846692155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:26,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:26,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313748258] [2024-10-11 03:00:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,605 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 03:00:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:26,641 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2024-10-11 03:00:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-10-11 03:00:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:26,643 INFO L225 Difference]: With dead ends: 75 [2024-10-11 03:00:26,643 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 03:00:26,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,645 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:26,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 03:00:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 03:00:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 03:00:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-10-11 03:00:26,652 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 13 [2024-10-11 03:00:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:26,653 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-10-11 03:00:26,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 03:00:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-10-11 03:00:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:00:26,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:26,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:00:26,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -957327185, now seen corresponding path program 1 times [2024-10-11 03:00:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267655168] [2024-10-11 03:00:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267655168] [2024-10-11 03:00:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267655168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901148489] [2024-10-11 03:00:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,768 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 03:00:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:26,807 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2024-10-11 03:00:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-10-11 03:00:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:26,810 INFO L225 Difference]: With dead ends: 84 [2024-10-11 03:00:26,811 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 03:00:26,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,813 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:26,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 03:00:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 03:00:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 38 states have internal predecessors, (48), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 03:00:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-10-11 03:00:26,829 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2024-10-11 03:00:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:26,830 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-10-11 03:00:26,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 03:00:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-10-11 03:00:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 03:00:26,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:26,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:26,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:00:26,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:26,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2020498868, now seen corresponding path program 1 times [2024-10-11 03:00:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026835187] [2024-10-11 03:00:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:26,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:26,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026835187] [2024-10-11 03:00:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026835187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:26,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:26,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569602313] [2024-10-11 03:00:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:26,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,924 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:00:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:26,986 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2024-10-11 03:00:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 03:00:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:26,990 INFO L225 Difference]: With dead ends: 115 [2024-10-11 03:00:26,990 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 03:00:26,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:26,992 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 48 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:26,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 88 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 03:00:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-11 03:00:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 62 states have internal predecessors, (78), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-11 03:00:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2024-10-11 03:00:27,017 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 21 [2024-10-11 03:00:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:27,017 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2024-10-11 03:00:27,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:00:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2024-10-11 03:00:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 03:00:27,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:27,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:00:27,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 512847219, now seen corresponding path program 1 times [2024-10-11 03:00:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422498851] [2024-10-11 03:00:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422498851] [2024-10-11 03:00:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422498851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:27,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521030333] [2024-10-11 03:00:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:27,132 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-11 03:00:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:27,222 INFO L93 Difference]: Finished difference Result 208 states and 294 transitions. [2024-10-11 03:00:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 25 [2024-10-11 03:00:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:27,225 INFO L225 Difference]: With dead ends: 208 [2024-10-11 03:00:27,228 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 03:00:27,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:27,230 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:27,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 03:00:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-10-11 03:00:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 116 states have internal predecessors, (148), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-11 03:00:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-10-11 03:00:27,257 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 25 [2024-10-11 03:00:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:27,257 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-10-11 03:00:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-11 03:00:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-10-11 03:00:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 03:00:27,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:27,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:00:27,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash 254681781, now seen corresponding path program 1 times [2024-10-11 03:00:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945044388] [2024-10-11 03:00:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945044388] [2024-10-11 03:00:27,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945044388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:00:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47356311] [2024-10-11 03:00:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:27,354 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 03:00:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:27,419 INFO L93 Difference]: Finished difference Result 274 states and 392 transitions. [2024-10-11 03:00:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:27,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 25 [2024-10-11 03:00:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:27,423 INFO L225 Difference]: With dead ends: 274 [2024-10-11 03:00:27,424 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 03:00:27,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:27,427 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:27,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 03:00:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-11 03:00:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 120 states have internal predecessors, (152), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-11 03:00:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2024-10-11 03:00:27,466 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 25 [2024-10-11 03:00:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2024-10-11 03:00:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 03:00:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2024-10-11 03:00:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:00:27,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:27,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:27,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:00:27,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:27,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1165287100, now seen corresponding path program 1 times [2024-10-11 03:00:27,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:27,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826016539] [2024-10-11 03:00:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:27,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:00:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826016539] [2024-10-11 03:00:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826016539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:00:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981585863] [2024-10-11 03:00:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:27,566 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:00:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:27,658 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2024-10-11 03:00:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 03:00:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:27,660 INFO L225 Difference]: With dead ends: 142 [2024-10-11 03:00:27,661 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 03:00:27,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:27,662 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:27,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 03:00:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-11 03:00:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 120 states have internal predecessors, (150), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-11 03:00:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-10-11 03:00:27,689 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 26 [2024-10-11 03:00:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:27,689 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-10-11 03:00:27,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:00:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-10-11 03:00:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 03:00:27,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:27,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:00:27,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -138345229, now seen corresponding path program 1 times [2024-10-11 03:00:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385853466] [2024-10-11 03:00:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385853466] [2024-10-11 03:00:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385853466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:00:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336264735] [2024-10-11 03:00:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:27,776 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-11 03:00:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:27,836 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2024-10-11 03:00:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:00:27,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 25 [2024-10-11 03:00:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:27,837 INFO L225 Difference]: With dead ends: 273 [2024-10-11 03:00:27,837 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 03:00:27,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:27,839 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:27,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 130 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 03:00:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 03:00:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 113 states have internal predecessors, (142), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (22), 14 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-11 03:00:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2024-10-11 03:00:27,863 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 25 [2024-10-11 03:00:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:27,863 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2024-10-11 03:00:27,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-11 03:00:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2024-10-11 03:00:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 03:00:27,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:27,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:27,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:00:27,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:27,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1470709301, now seen corresponding path program 1 times [2024-10-11 03:00:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314657006] [2024-10-11 03:00:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314657006] [2024-10-11 03:00:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314657006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:27,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:00:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561701700] [2024-10-11 03:00:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:27,931 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-10-11 03:00:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:28,128 INFO L93 Difference]: Finished difference Result 352 states and 490 transitions. [2024-10-11 03:00:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 29 [2024-10-11 03:00:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:28,131 INFO L225 Difference]: With dead ends: 352 [2024-10-11 03:00:28,131 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 03:00:28,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:00:28,133 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:28,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 03:00:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-10-11 03:00:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 169 states have (on average 1.319526627218935) internal successors, (223), 185 states have internal predecessors, (223), 24 states have call successors, (24), 21 states have call predecessors, (24), 23 states have return successors, (43), 22 states have call predecessors, (43), 24 states have call successors, (43) [2024-10-11 03:00:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 290 transitions. [2024-10-11 03:00:28,171 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 290 transitions. Word has length 29 [2024-10-11 03:00:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 290 transitions. [2024-10-11 03:00:28,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-10-11 03:00:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 290 transitions. [2024-10-11 03:00:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:00:28,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:28,173 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:00:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:00:28,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1160149456, now seen corresponding path program 1 times [2024-10-11 03:00:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595661310] [2024-10-11 03:00:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:00:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595661310] [2024-10-11 03:00:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595661310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989225272] [2024-10-11 03:00:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:28,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:28,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:28,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:00:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:28,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:00:28,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:28,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:00:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:28,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989225272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:00:28,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:00:28,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-11 03:00:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753182244] [2024-10-11 03:00:28,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:00:28,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:28,647 INFO L87 Difference]: Start difference. First operand 217 states and 290 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:28,962 INFO L93 Difference]: Finished difference Result 537 states and 737 transitions. [2024-10-11 03:00:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-10-11 03:00:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:28,966 INFO L225 Difference]: With dead ends: 537 [2024-10-11 03:00:28,966 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 03:00:28,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:00:28,968 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:28,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 216 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 03:00:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2024-10-11 03:00:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 228 states have (on average 1.3026315789473684) internal successors, (297), 249 states have internal predecessors, (297), 33 states have call successors, (33), 29 states have call predecessors, (33), 32 states have return successors, (59), 29 states have call predecessors, (59), 33 states have call successors, (59) [2024-10-11 03:00:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 389 transitions. [2024-10-11 03:00:28,994 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 389 transitions. Word has length 50 [2024-10-11 03:00:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:28,994 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 389 transitions. [2024-10-11 03:00:28,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 389 transitions. [2024-10-11 03:00:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:00:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:28,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 03:00:29,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:00:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:00:29,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 591127275, now seen corresponding path program 2 times [2024-10-11 03:00:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097779760] [2024-10-11 03:00:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:00:29,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:00:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:00:29,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:00:29,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:00:29,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:00:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:00:29,281 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:29,355 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:00:29,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:00:29 BoogieIcfgContainer [2024-10-11 03:00:29,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:00:29,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:00:29,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:00:29,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:00:29,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:25" (3/4) ... [2024-10-11 03:00:29,368 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:00:29,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:00:29,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:00:29,449 INFO L158 Benchmark]: Toolchain (without parser) took 4806.70ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 95.1MB in the beginning and 111.6MB in the end (delta: -16.6MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,449 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:00:29,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.76ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 135.5MB in the end (delta: -40.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 132.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,450 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,451 INFO L158 Benchmark]: RCFGBuilder took 562.36ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 108.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,451 INFO L158 Benchmark]: TraceAbstraction took 3492.17ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 107.2MB in the beginning and 117.9MB in the end (delta: -10.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,454 INFO L158 Benchmark]: Witness Printer took 81.85ms. Allocated memory is still 245.4MB. Free memory was 117.9MB in the beginning and 111.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 03:00:29,456 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.26ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.76ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 135.5MB in the end (delta: -40.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 132.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.36ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 108.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3492.17ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 107.2MB in the beginning and 117.9MB in the end (delta: -10.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 81.85ms. Allocated memory is still 245.4MB. Free memory was 117.9MB in the beginning and 111.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] - GenericResultAtLocation [Line: 516]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [554] - GenericResultAtLocation [Line: 582]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [582] - GenericResultAtLocation [Line: 681]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [681] - GenericResultAtLocation [Line: 749]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [749] - GenericResultAtLocation [Line: 929]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [929] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 934]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L320] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L583] int cleanupTimeShifts = 4; [L752] int pumpRunning = 0; [L753] int systemActive = 1; [L659] int retValue_acc ; [L660] int tmp ; [L664] FCALL select_helpers() [L665] FCALL select_features() [L666] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); [L666] RET, EXPR valid_product() [L666] tmp = valid_product() [L668] COND TRUE \read(tmp) [L670] FCALL setup() [L671] CALL runTest() [L653] CALL test() [L684] int splverifierCounter ; [L685] int tmp ; [L686] int tmp___0 ; [L687] int tmp___1 ; [L688] int tmp___2 ; [L691] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L693] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L695] COND TRUE splverifierCounter < 4 [L701] tmp = __VERIFIER_nondet_int() [L703] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L705] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L75] COND TRUE waterLevel < 2 [L76] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L705] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L711] tmp___0 = __VERIFIER_nondet_int() [L713] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L721] tmp___2 = __VERIFIER_nondet_int() [L723] COND TRUE \read(tmp___2) [L725] CALL startSystem() [L925] systemActive = 1 [L725] RET startSystem() [L738] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L759] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L766] COND TRUE \read(systemActive) [L768] CALL processEnvironment() [L788] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L791] COND TRUE ! pumpRunning [L793] CALL, EXPR isHighWaterLevel() [L903] int retValue_acc ; [L904] int tmp ; [L905] int tmp___0 ; [L909] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(waterLevel < 2) [L144] retValue_acc = 0 [L145] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L909] RET, EXPR isHighWaterSensorDry() [L909] tmp = isHighWaterSensorDry() [L911] COND FALSE !(\read(tmp)) [L914] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L916] retValue_acc = tmp___0 [L917] return (retValue_acc); [L793] RET, EXPR isHighWaterLevel() [L793] tmp = isHighWaterLevel() [L795] COND TRUE \read(tmp) [L797] CALL activatePump() [L822] int tmp ; [L826] CALL, EXPR isMethaneAlarm() [L847] int retValue_acc ; [L851] CALL, EXPR isMethaneLevelCritical() [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); [L851] RET, EXPR isMethaneLevelCritical() [L851] retValue_acc = isMethaneLevelCritical() [L853] return (retValue_acc); [L826] RET, EXPR isMethaneAlarm() [L826] tmp = isMethaneAlarm() [L828] COND FALSE !(\read(tmp)) [L832] CALL activatePump__wrappee__highWaterSensor() [L816] pumpRunning = 1 [L832] RET activatePump__wrappee__highWaterSensor() [L797] RET activatePump() [L768] RET processEnvironment() [L774] CALL __utac_acc__Specification4_spec__1() [L558] int tmp ; [L559] int tmp___0 ; [L563] CALL, EXPR getWaterLevel() [L128] int retValue_acc ; [L131] retValue_acc = waterLevel [L132] return (retValue_acc); [L563] RET, EXPR getWaterLevel() [L563] tmp = getWaterLevel() [L565] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L774] RET __utac_acc__Specification4_spec__1() [L738] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L693] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L695] COND TRUE splverifierCounter < 4 [L701] tmp = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L711] tmp___0 = __VERIFIER_nondet_int() [L713] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L721] tmp___2 = __VERIFIER_nondet_int() [L723] COND TRUE \read(tmp___2) [L725] CALL startSystem() [L925] systemActive = 1 [L725] RET startSystem() [L738] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L759] COND TRUE \read(pumpRunning) [L761] CALL lowerWaterLevel() [L63] COND TRUE waterLevel > 0 [L64] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L761] RET lowerWaterLevel() [L766] COND TRUE \read(systemActive) [L768] CALL processEnvironment() [L788] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L791] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L806] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L768] RET processEnvironment() [L774] CALL __utac_acc__Specification4_spec__1() [L558] int tmp ; [L559] int tmp___0 ; [L563] CALL, EXPR getWaterLevel() [L128] int retValue_acc ; [L131] retValue_acc = waterLevel [L132] return (retValue_acc); [L563] RET, EXPR getWaterLevel() [L563] tmp = getWaterLevel() [L565] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L774] RET __utac_acc__Specification4_spec__1() [L738] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L693] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L695] COND TRUE splverifierCounter < 4 [L701] tmp = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L711] tmp___0 = __VERIFIER_nondet_int() [L713] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L721] tmp___2 = __VERIFIER_nondet_int() [L723] COND TRUE \read(tmp___2) [L725] CALL startSystem() [L925] systemActive = 1 [L725] RET startSystem() [L738] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L759] COND TRUE \read(pumpRunning) [L761] CALL lowerWaterLevel() [L63] COND TRUE waterLevel > 0 [L64] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L761] RET lowerWaterLevel() [L766] COND TRUE \read(systemActive) [L768] CALL processEnvironment() [L788] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L791] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L806] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L768] RET processEnvironment() [L774] CALL __utac_acc__Specification4_spec__1() [L558] int tmp ; [L559] int tmp___0 ; [L563] CALL, EXPR getWaterLevel() [L128] int retValue_acc ; [L131] retValue_acc = waterLevel [L132] return (retValue_acc); [L563] RET, EXPR getWaterLevel() [L563] tmp = getWaterLevel() [L565] COND TRUE tmp == 0 [L567] CALL, EXPR isPumpRunning() [L858] int retValue_acc ; [L861] retValue_acc = pumpRunning [L862] return (retValue_acc); [L567] RET, EXPR isPumpRunning() [L567] tmp___0 = isPumpRunning() [L569] COND TRUE \read(tmp___0) [L571] CALL __automaton_fail() [L934] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 1191 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 669 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 522 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 2 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 32/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 03:00:29,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE